{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:23:19Z","timestamp":1740140599141,"version":"3.37.3"},"reference-count":38,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T00:00:00Z","timestamp":1535760000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T00:00:00Z","timestamp":1535760000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T00:00:00Z","timestamp":1535760000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"German Israeli Foundation"},{"name":"Novel gene order analysis methods based on pattern identification in gene interaction networks","award":["G-2343-407.6\/2014"],"award-info":[{"award-number":["G-2343-407.6\/2014"]}]},{"DOI":"10.13039\/501100008678","name":"University of Leipzig","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100008678","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001659","name":"German Research Foundation","doi-asserted-by":"crossref","award":["MI 439\/14-1"],"award-info":[{"award-number":["MI 439\/14-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Comput. Biol. and Bioinf."],"published-print":{"date-parts":[[2018,9,1]]},"DOI":"10.1109\/tcbb.2017.2708121","type":"journal-article","created":{"date-parts":[[2017,5,25]],"date-time":"2017-05-25T18:12:15Z","timestamp":1495735935000},"page":"1585-1593","source":"Crossref","is-referenced-by-count":8,"title":["Genome Rearrangement with ILP"],"prefix":"10.1109","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1260-1685","authenticated-orcid":false,"given":"Tom","family":"Hartmann","sequence":"first","affiliation":[{"name":"Faculty of Mathematics and Computer Science, University of Leipzig, Augustusplatz 10, Leipzig, Germany"}]},{"given":"Nicolas","family":"Wieseke","sequence":"additional","affiliation":[{"name":"Faculty of Mathematics and Computer Science, University of Leipzig, Augustusplatz 10, Leipzig, Germany"}]},{"given":"Roded","family":"Sharan","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Israel"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5426-1092","authenticated-orcid":false,"given":"Martin","family":"Middendorf","sequence":"additional","affiliation":[{"name":"Faculty of Mathematics and Computer Science, University of Leipzig, Augustusplatz 10, Leipzig, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3763-0797","authenticated-orcid":false,"given":"Matthias","family":"Bernt","sequence":"additional","affiliation":[{"name":"Faculty of Mathematics and Computer Science, University of Leipzig, Augustusplatz 10, Leipzig, Germany"}]}],"member":"263","reference":[{"key":"ref38","article-title":"Combinatorics of tandem duplication random loss mutations on circular genomes","author":"hartmann","year":"0","journal-title":"IEEE\/ACM Trans Comput Biol Bioinf"},{"key":"ref33","first-page":"124","article-title":"Weighted genomic distance can hardly impose a bound on the proportion of transpositions","author":"jiang","year":"2011","journal-title":"Proc 15th Ann Int Conf Comput Mol Biol"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/s11390-010-9370-9"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00338-3"},{"key":"ref30","first-page":"491","article-title":"A unified integer programming model for genome rearrangement problems","author":"lancia","year":"2015","journal-title":"Proc Int Conf Bioinf Biomed Eng"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-011-4309-7_13"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1080\/10635150500221044"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.ympev.2013.05.002"},{"year":"2015","key":"ref34","article-title":"Gurobi optimizer reference manual"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s002940050225"},{"key":"ref11","first-page":"75","article-title":"Sorting by reversals is difficult","author":"caprara","year":"1997","journal-title":"Proc 1st Ann Int Conf Comput Mol Biol"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/3-540-48523-6_17","article-title":"On some tighter inapproximability results (extended abstract)","author":"berman","year":"1999","journal-title":"Proc 26th Int Colloquium Automata Languages Program"},{"key":"ref13","first-page":"200","article-title":"1.375-approximation algorithm for sorting by reversals","author":"berman","year":"2002","journal-title":"Proc 10th Eur Symp Algorithms"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013851611274"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1023\/B:JOCO.0000031419.12290.2b"},{"key":"ref16","first-page":"12","article-title":"Fast practical solution of sorting by reversals","author":"caprara","year":"2000","journal-title":"Proc 11th Annu ACM-SIAM Symp Discrete Algorithms"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/300515.300516"},{"key":"ref18","first-page":"1","article-title":"Sorting by reversals in subquadratic time","author":"tannier","year":"2004","journal-title":"Proc Combinatorial Pattern Matching"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1089\/106652701753216503"},{"key":"ref28","first-page":"13","article-title":"Constraint programming models for transposition distance problem","author":"dias","year":"2009","journal-title":"Proc Brazilian Symp Bioinformat"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/11533719_5"},{"key":"ref27","article-title":"Polynomial-sized ILP models for rearrangement distance problems","author":"dias","year":"2007","journal-title":"Proc Brazilian Symp Bioinformat"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2006.44"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/11554714_11","article-title":"Power boosts for cluster tests","author":"sankoff","year":"2005","journal-title":"Proc RECOMB Workshop Comparative Genomics"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2007.R006"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/11554714_3","article-title":"Maximizing synteny blocks to identify ancestral homologs","author":"bourque","year":"2005","journal-title":"Proc RECOMB Workshop Comparative Genomics"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/15.11.909"},{"key":"ref7","first-page":"3","article-title":"The breakpoint distance for signed sequences","author":"blin","year":"2004","journal-title":"Proc Algorithms Comput Methods Biochemical Evol Netw"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/978-94-011-4309-7_19","article-title":"The complexity of calculating exemplar distances","author":"bryant","year":"2000","journal-title":"Comparative Genomics Empirical and Analytical Approaches to Gene Order Dynamics Map Alignment and the Evolution of Gene Families"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/11851561_16"},{"key":"ref1","first-page":"121","article-title":"Edit distance for genome comparison based on non-local operations","author":"sankoff","year":"1992","journal-title":"Proc Ann Symp Combinatorial Pattern Matching"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.ympev.2012.10.020"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/110851390"},{"key":"ref21","first-page":"14","article-title":"On weighting schemes for gene order analysis","author":"bernt","year":"2013","journal-title":"Proc German Conf Bioinformatics"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/SPIRE.1998.712988"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1137\/S089548019528280X"},{"key":"ref26","first-page":"75","article-title":"How pseudo-boolean programming can help genome rearrangement distance computation","author":"angibaud","year":"2006","journal-title":"Proc RECOMB 2006 Int Workshop Comparative Genomics"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00038-4"}],"container-title":["IEEE\/ACM Transactions on Computational Biology and Bioinformatics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8857\/8485525\/07934076.pdf?arnumber=7934076","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,30]],"date-time":"2024-07-30T18:17:37Z","timestamp":1722363457000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7934076\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,1]]},"references-count":38,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tcbb.2017.2708121","relation":{},"ISSN":["1545-5963","1557-9964","2374-0043"],"issn-type":[{"type":"print","value":"1545-5963"},{"type":"electronic","value":"1557-9964"},{"type":"electronic","value":"2374-0043"}],"subject":[],"published":{"date-parts":[[2018,9,1]]}}}