{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T05:07:58Z","timestamp":1740114478173,"version":"3.37.3"},"reference-count":21,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2018,7,1]],"date-time":"2018-07-01T00:00:00Z","timestamp":1530403200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2022,7,22]],"date-time":"2022-07-22T00:00:00Z","timestamp":1658448000000},"content-version":"vor","delay-in-days":1482,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61472222","61628207"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1016\/j.tcs.2017.09.019","type":"journal-article","created":{"date-parts":[[2017,10,12]],"date-time":"2017-10-12T21:32:21Z","timestamp":1507843941000},"page":"38-45","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Can a breakpoint graph be decomposed into none other than 2-cycles?"],"prefix":"10.1016","volume":"734","author":[{"given":"Lianrong","family":"Pu","sequence":"first","affiliation":[]},{"given":"Yu","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Daming","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Haitao","family":"Jiang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2017.09.019_br0010","unstructured":"Vineet Bafna, Pavel A. Pevzner, Genome rearrangements and sorting by reversals, in: FOCS'1993, pp. 148\u2013157."},{"issue":"2","key":"10.1016\/j.tcs.2017.09.019_br0020","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1137\/S0097539793250627","article-title":"Genome rearrangements and sorting by reversals","volume":"25","author":"Bafna","year":"1996","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.tcs.2017.09.019_br0030","series-title":"ACM-SIAM Symposium on Discrete Algorithms","first-page":"244","article-title":"A 3\/2-approximation algorithm for sorting by reversals","author":"Christie","year":"1998"},{"issue":"7","key":"10.1016\/j.tcs.2017.09.019_br0040","doi-asserted-by":"crossref","first-page":"1045","DOI":"10.1016\/j.jcss.2007.03.009","article-title":"A 1.75-approximation algorithm for unsigned translocation distance","volume":"73","author":"Cui","year":"2007","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/j.tcs.2017.09.019_br0050","series-title":"CPM","first-page":"162","article-title":"Polynomial-time algorithm for computing translocation distance between genomes","author":"Hannenhalli","year":"1995"},{"issue":"1\u20133","key":"10.1016\/j.tcs.2017.09.019_br0060","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/S0166-218X(96)00061-3","article-title":"Polynomial-time algorithm for computing translocation distance between genomes","volume":"71","author":"Hannenhalli","year":"1996","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"10.1016\/j.tcs.2017.09.019_br0070","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1023\/B:JOCO.0000031419.12290.2b","article-title":"A further improved approximation algorithm for breakpoint graph cycle decomposition","volume":"8","author":"Lin","year":"2004","journal-title":"J. Comb. Optim."},{"key":"10.1016\/j.tcs.2017.09.019_br0080","series-title":"Combinatorial Pattern Matching, Fourth Annual Symposium","first-page":"87","article-title":"Exact and approximation algorithms for the inversion distance between two chromosomes","volume":"vol. 684","author":"Kececioglu","year":"1993"},{"key":"10.1016\/j.tcs.2017.09.019_br0090","series-title":"Proceedings of the First Annual International Conference on Computational Molecular Biology","article-title":"Sorting by reversals is difficult","author":"Caprara","year":"1997"},{"key":"10.1016\/j.tcs.2017.09.019_br0100","series-title":"Proc. 27th Ann. ACM Symp. Theory of Comput.","article-title":"Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals)","author":"Hannenhalli","year":"1995"},{"issue":"2","key":"10.1016\/j.tcs.2017.09.019_br0110","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1023\/A:1009838309166","article-title":"On the tightness of the alternating-cycle lower bound for sorting by reversals","volume":"3","author":"Caprara","year":"1999","journal-title":"J. Comb. Optim."},{"issue":"10","key":"10.1016\/j.tcs.2017.09.019_br0120","doi-asserted-by":"crossref","first-page":"1339","DOI":"10.1089\/cmb.2009.0156","article-title":"Hurdles and sorting by inversions: combinatorial, statistical, and experimental results","volume":"16","author":"Swenson","year":"2009","journal-title":"J. Comput. Biol."},{"key":"10.1016\/j.tcs.2017.09.019_br0140","series-title":"Proc. Sixth Ann. ACM-SIAM Symp. Discrete Algorithms","article-title":"Of mice and men: algorithms for evolutionary distances between genomes with translocation","author":"Kececioglu","year":"1995"},{"issue":"16","key":"10.1016\/j.tcs.2017.09.019_br0150","doi-asserted-by":"crossref","first-page":"3340","DOI":"10.1093\/bioinformatics\/bti535","article-title":"Efficient sorting of genomic permutations by translocation, inversion and block interchange","volume":"21","author":"Yancopoulos","year":"2005","journal-title":"Bioinformatics"},{"issue":"3","key":"10.1016\/j.tcs.2017.09.019_br0160","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1093\/bioinformatics\/btq674","article-title":"Algorithms for sorting unsigned linear genomes by the DCJ operations","volume":"27","author":"Jiang","year":"2010","journal-title":"Bioinformatics"},{"key":"10.1016\/j.tcs.2017.09.019_br0170","series-title":"International Workshop on Algorithms in Bioinformatics","article-title":"A unifying view of genome rearrangements","author":"Bergeron","year":"2006"},{"issue":"4","key":"10.1016\/j.tcs.2017.09.019_br0180","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1109\/TCBB.2005.48","article-title":"Assignment of orthologous genes via genome rearrangement","volume":"2","author":"Chen","year":"2005","journal-title":"ACM\/IEEE Trans. Comput. Biol. Bioinform."},{"key":"10.1016\/j.tcs.2017.09.019_br0190","series-title":"Proc. 18th Annual International Conference on Research in Computational Molecular Biology","first-page":"282","article-title":"An exact algorithm to compute the DCJ distance for genomes with duplicate genes","volume":"vol. 8394","author":"Shao","year":"2014"},{"key":"10.1016\/j.tcs.2017.09.019_br0200","series-title":"Algorithmic Aspects in Information and Management","first-page":"291","article-title":"The approximability of the exemplar breakpoint distance problem","volume":"vol. 4041","author":"Chen","year":"2006"},{"issue":"38","key":"10.1016\/j.tcs.2017.09.019_br0210","doi-asserted-by":"crossref","first-page":"14254","DOI":"10.1073\/pnas.0805217105","article-title":"The infinite sites model of genome evolution","volume":"105","author":"Ma","year":"2008","journal-title":"Proc. Nat. Acad. Sci."},{"issue":"1\u20133","key":"10.1016\/j.tcs.2017.09.019_br0220","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1016\/j.tcs.2005.09.078","article-title":"On the complexity of unsigned translocation distances","volume":"352","author":"Zhu","year":"2006","journal-title":"Theoret. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397517306813?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397517306813?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,7,22]],"date-time":"2022-07-22T14:55:42Z","timestamp":1658501742000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397517306813"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7]]},"references-count":21,"alternative-id":["S0304397517306813"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2017.09.019","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2018,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Can a breakpoint graph be decomposed into none other than 2-cycles?","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2017.09.019","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2017 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}