{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T00:45:05Z","timestamp":1740185105104,"version":"3.37.3"},"reference-count":9,"publisher":"Oxford University Press (OUP)","issue":"3","license":[{"start":{"date-parts":[[2017,9,28]],"date-time":"2017-09-28T00:00:00Z","timestamp":1506556800000},"content-version":"vor","delay-in-days":1,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001711","name":"Swiss National Science Foundation","doi-asserted-by":"publisher","award":["200020_162343\/1"],"award-info":[{"award-number":["200020_162343\/1"]}],"id":[{"id":"10.13039\/501100001711","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100004807","name":"DFG","doi-asserted-by":"publisher","award":["SFB1129, DFG HA4364\/9-1"],"award-info":[{"award-number":["SFB1129, DFG HA4364\/9-1"]}],"id":[{"id":"10.13039\/100004807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003801","name":"HGS MathComp","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003801","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,2,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:sec>\n                  <jats:title>Motivation<\/jats:title>\n                  <jats:p>We introduce a formulation for the general task of finding diverse shortest paths between two end-points. Our approach is not linked to a specific biological problem and can be applied to a large variety of images thanks to its generic implementation as a user-friendly ImageJ\/Fiji plugin. It relies on the introduction of additional layers in a Viterbi path graph, which requires slight modifications to the standard Viterbi algorithm rules. This layered graph construction allows for the specification of various constraints imposing diversity between solutions.<\/jats:p>\n               <\/jats:sec>\n               <jats:sec>\n                  <jats:title>Results<\/jats:title>\n                  <jats:p>The software allows obtaining a collection of diverse shortest paths under some user-defined constraints through a convenient and user-friendly interface. It can be used alone or be integrated into larger image analysis pipelines.<\/jats:p>\n               <\/jats:sec>\n               <jats:sec>\n                  <jats:title>Availability and implementation<\/jats:title>\n                  <jats:p>http:\/\/bigwww.epfl.ch\/algorithms\/diversepathsj<\/jats:p>\n               <\/jats:sec>\n               <jats:sec>\n                  <jats:title>Supplementary information<\/jats:title>\n                  <jats:p>Supplementary data are available at Bioinformatics online.<\/jats:p>\n               <\/jats:sec>","DOI":"10.1093\/bioinformatics\/btx621","type":"journal-article","created":{"date-parts":[[2017,9,26]],"date-time":"2017-09-26T11:09:36Z","timestamp":1506424176000},"page":"538-540","source":"Crossref","is-referenced-by-count":2,"title":["DiversePathsJ: diverse shortest paths for bioimage analysis"],"prefix":"10.1093","volume":"34","author":[{"given":"Virginie","family":"Uhlmann","sequence":"first","affiliation":[{"name":"\u00c9cole polytechnique f\u00e9d\u00e9rale de Lausanne (EPFL), Biomedical Imaging Group, Lausanne, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carsten","family":"Haubold","sequence":"additional","affiliation":[{"name":"Heidelberg University, Interdisziplin\u00e4ren Zentrums f\u00fcr Wissenschaftliches Rechnen\/Heidelberg Collaboratory for Image Processing (IWR\/HCI), Heidelberg, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fred A","family":"Hamprecht","sequence":"additional","affiliation":[{"name":"Heidelberg University, Interdisziplin\u00e4ren Zentrums f\u00fcr Wissenschaftliches Rechnen\/Heidelberg Collaboratory for Image Processing (IWR\/HCI), Heidelberg, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Unser","sequence":"additional","affiliation":[{"name":"\u00c9cole polytechnique f\u00e9d\u00e9rale de Lausanne (EPFL), Biomedical Imaging Group, Lausanne, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2017,9,27]]},"reference":[{"key":"2023012712324626400_btx621-B1","first-page":"121","volume-title":"Proc. 28th Conf. Uncertain. Artif. Intell. (UAI\u201912)","author":"Batra","year":"2012"},{"key":"2023012712324626400_btx621-B2","first-page":"1","volume-title":"Proc. 12th Eur. Conf. Comput. Vis. (ECCV\u201912)","author":"Batra","year":"2012"},{"key":"2023012712324626400_btx621-B3","doi-asserted-by":"crossref","first-page":"716","DOI":"10.1073\/pnas.38.8.716","article-title":"On the theory of dynamic programming","volume":"38","author":"Bellman","year":"1952","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"2023012712324626400_btx621-B4","first-page":"3359","volume-title":"Proc. IEEE Int. Conf. Robotic. Autom. (ICRA\u201903)","author":"Fujita","year":"2003"},{"volume-title":"Proc. 39th Ger. Conf. Pattern Recognit. (GCPR\u201917)","year":"2017","author":"Haubold","key":"2023012712324626400_btx621-B5"},{"key":"2023012712324626400_btx621-B6","first-page":"1814","volume-title":"Proc. IEEE Int. Conf. Comput. Vis. (ICCV\u201915)","author":"Kirillov","year":"2015"},{"key":"2023012712324626400_btx621-B7","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1287\/mnsc.18.7.401","article-title":"A procedure for computing the k best solutions to discrete optimization problems and its application to the shortest path problem","volume":"18","author":"Lawler","year":"1972","journal-title":"Manag. Sci"},{"key":"2023012712324626400_btx621-B8","first-page":"1249","article-title":"Locally defined principal curves and surfaces","volume":"12","author":"Ozertem","year":"2011","journal-title":"J. Mach. Learn. Res"},{"key":"2023012712324626400_btx621-B9","first-page":"375","volume-title":"Proc. 35th Ger. Conf. Pattern Recognit. (GCPR\u201913)","author":"Straehle","year":"2013"}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/34\/3\/538\/48913551\/bioinformatics_34_3_538.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/34\/3\/538\/48913551\/bioinformatics_34_3_538.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T13:20:38Z","timestamp":1674825638000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/34\/3\/538\/4259193"}},"subtitle":[],"editor":[{"given":"Robert","family":"Murphy","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2017,9,27]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,2,1]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/btx621","relation":{},"ISSN":["1367-4803","1367-4811"],"issn-type":[{"type":"print","value":"1367-4803"},{"type":"electronic","value":"1367-4811"}],"subject":[],"published-other":{"date-parts":[[2018,2,1]]},"published":{"date-parts":[[2017,9,27]]}}}