{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:23:15Z","timestamp":1740140595086,"version":"3.37.3"},"reference-count":36,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2017,3,1]],"date-time":"2017-03-01T00:00:00Z","timestamp":1488326400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada (NSERC)","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100009059","name":"Pacific Institute for Mathematical Sciences (PIMS)","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100009059","id-type":"DOI","asserted-by":"publisher"}]},{"name":"International Graduate Training Centre in Mathematical Biology"},{"DOI":"10.13039\/501100001807","name":"FAPESP","doi-asserted-by":"publisher","award":["2013\/07868-6"],"award-info":[{"award-number":["2013\/07868-6"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Comput. Biol. and Bioinf."],"published-print":{"date-parts":[[2017,3,1]]},"DOI":"10.1109\/tcbb.2016.2528239","type":"journal-article","created":{"date-parts":[[2016,2,11]],"date-time":"2016-02-11T12:43:35Z","timestamp":1455194615000},"page":"418-430","source":"Crossref","is-referenced-by-count":2,"title":["Algorithms and Complexity Results for Genome Mapping Problems"],"prefix":"10.1109","volume":"14","author":[{"given":"Ashok","family":"Rajaraman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joao Paulo Pereira","family":"Zanetti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Manuch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cedric","family":"Chauve","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1186\/s13059-014-0573-1"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0106689"},{"key":"ref31","first-page":"349","article-title":"Cerulean: A hybrid assembly using high throughput short and long reads","author":"deshpande","year":"0","journal-title":"Proc 13th Int Workshop Algorithms Bioinf"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1038\/nbt.2280"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2011.0170"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btp690"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1186\/gb-2009-10-8-r88"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1093\/molbev\/mst100"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.1995.2.159"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.1995.2.139"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1038\/nrg3164"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"11s","DOI":"10.1186\/1471-2105-13-S19-S11","article-title":"Linearization of ancestral multichromosomal genomes","volume":"13","author":"man\u02c6uch","year":"2012","journal-title":"BMC Bioinf"},{"key":"ref15","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-14279-6","author":"diestel","year":"2010","journal-title":"Graph Theory"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(76)80045-1"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1971.39.535"},{"key":"ref18","first-page":"768","article-title":"A certifying algorithm for the consecutive-ones property","author":"mcconnell","year":"2004","journal-title":"Proc 15th Annu ACM-SIAM Symp Discrete Algorithms"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48452-3_5"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33122-0_25"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btr224"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/585265.585267"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2008.135"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"4s","DOI":"10.1186\/1471-2105-13-S19-S4","article-title":"A flexible ancestral genome reconstruction method based on gapped adjacencies","volume":"13","author":"gagnon","year":"2012","journal-title":"BMC Bioinf"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0059128"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btr461"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2008.0069"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btt527"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pcbi.1000234"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"1910","DOI":"10.1093\/bioinformatics\/btq315","article-title":"Count: Evolutionary analysis of phylogenetic profiles with parsimony and likelihood","volume":"26","author":"csur\u00f6s","year":"2010","journal-title":"Bioinf"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1101\/gr.5383506"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2011.0083"},{"key":"ref22","first-page":"27","article-title":"Algorithimic aspects of the consecutive-ones property","volume":"98","author":"dom","year":"2009","journal-title":"Bull Eur Assoc Theor Comput Sci"},{"year":"2012","author":"patterson","key":"ref21"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-45278-9_37"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-58338-6_78"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1051\/ro\/1993270201691"},{"key":"ref25","first-page":"17","article-title":"An $o(\\sqrt{\\vert v \\vert} {\\vert e \\vert})$ algorithm for finding maximum matching in general graphs","author":"micali","year":"0","journal-title":"Proc Annu Symp Found Comput Sci"}],"container-title":["IEEE\/ACM Transactions on Computational Biology and Bioinformatics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8857\/7887773\/07403931.pdf?arnumber=7403931","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:19:59Z","timestamp":1642004399000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7403931\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,1]]},"references-count":36,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tcbb.2016.2528239","relation":{},"ISSN":["1545-5963"],"issn-type":[{"type":"print","value":"1545-5963"}],"subject":[],"published":{"date-parts":[[2017,3,1]]}}}