{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T01:48:31Z","timestamp":1773280111454,"version":"3.50.1"},"reference-count":12,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2002,11,1]],"date-time":"2002-11-01T00:00:00Z","timestamp":1036108800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3911,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[2002,11]]},"DOI":"10.1016\/s0022-0000(02)00011-9","type":"journal-article","created":{"date-parts":[[2003,1,21]],"date-time":"2003-01-21T18:45:29Z","timestamp":1043174729000},"page":"587-609","source":"Crossref","is-referenced-by-count":137,"title":["Efficient algorithms for multichromosomal genome rearrangements"],"prefix":"10.1016","volume":"65","author":[{"given":"Glenn","family":"Tesler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(02)00011-9_BIB1","doi-asserted-by":"crossref","unstructured":"D. Bader, B. Moret, T. Warnow, S. Wyman, M. Yan, GRAPPA, http:\/\/www.cs.unm.edu\/~moret\/GRAPPA, 2000.","DOI":"10.1142\/9789814447362_0056"},{"issue":"5","key":"10.1016\/S0022-0000(02)00011-9_BIB2","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1089\/106652701753216503","article-title":"A linear-time algorithm for computing inversion distances between signed permutations with an experimental study","volume":"8","author":"Bader","year":"2001","journal-title":"J. Comput. Biol."},{"issue":"1","key":"10.1016\/S0022-0000(02)00011-9_BIB3","first-page":"26","article-title":"Genome-scale evolution","volume":"12","author":"Bourque","year":"2002","journal-title":"Genome Res."},{"key":"10.1016\/S0022-0000(02)00011-9_BIB4","doi-asserted-by":"crossref","unstructured":"A. Caprara, Formulations and complexity of multiple sorting by reversals, in: Proceedings of the Third Annual International Conference on Computational Molecular Biology (RECOMB \u201999), ACM Press, Lyon, France, 1999, pp. 84\u201393.","DOI":"10.1145\/299432.299461"},{"key":"10.1016\/S0022-0000(02)00011-9_BIB5","series-title":"36th Annual Symposium on Foundations of Computer Science","first-page":"581","article-title":"Transforming men into mice (polynomial algorithm for genomic distance problem)","author":"Hannenhalli","year":"1995"},{"issue":"1","key":"10.1016\/S0022-0000(02)00011-9_BIB6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/300515.300516","article-title":"Transforming cabbage into turnip","volume":"46","author":"Hannenhalli","year":"1999","journal-title":"J. ACM"},{"issue":"3","key":"10.1016\/S0022-0000(02)00011-9_BIB7","doi-asserted-by":"crossref","first-page":"880","DOI":"10.1137\/S0097539798334207","article-title":"A faster and simpler algorithm for sorting signed permutations by reversals","volume":"29","author":"Kaplan","year":"2000","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(02)00011-9_BIB8","doi-asserted-by":"crossref","unstructured":"J. Kececioglu, D. Sankoff, Efficient bounds for oriented chromosome inversion distance, in: Combinatorial Pattern Matching, Asilomar, CA, Springer, Berlin, 1994, pp. 307\u2013325.","DOI":"10.1007\/3-540-58094-8_26"},{"issue":"1\u20132","key":"10.1016\/S0022-0000(02)00011-9_BIB9","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/BF01188586","article-title":"Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement","volume":"13","author":"Kececioglu","year":"1995","journal-title":"Algorithmica"},{"key":"10.1016\/S0022-0000(02)00011-9_BIB10","series-title":"Computational Molecular Biology: an Algorithmic Approach","author":"Pevzner","year":"2000"},{"key":"10.1016\/S0022-0000(02)00011-9_BIB11","unstructured":"G. Tesler, GRIMM, http:\/\/www-cse.ucsd.edu\/groups\/bioinformatics\/GRIMM, 2001."},{"issue":"3","key":"10.1016\/S0022-0000(02)00011-9_BIB12","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1093\/bioinformatics\/18.3.492","article-title":"GRIMM","volume":"18","author":"Tesler","year":"2002","journal-title":"Bioinformatics"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000002000119?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000002000119?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,12]],"date-time":"2020-03-12T06:04:40Z","timestamp":1583993080000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000002000119"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,11]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,11]]}},"alternative-id":["S0022000002000119"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(02)00011-9","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[2002,11]]}}}