{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T11:27:45Z","timestamp":1751282865858},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540580942"},{"type":"electronic","value":"9783540484509"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58094-8_26","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:12:44Z","timestamp":1330251164000},"page":"307-325","source":"Crossref","is-referenced-by-count":36,"title":["Efficient bounds for oriented chromosome inversion distance"],"prefix":"10.1007","author":[{"given":"John","family":"Kececioglu","sequence":"first","affiliation":[]},{"given":"David","family":"Sankoff","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"Bafna, Vineet and Pavel A. Pevzner. Genome rearrangements and sorting by reversals. In Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science, 148\u2013157, November 1993.","DOI":"10.1109\/SFCS.1993.366872"},{"key":"26_CR2","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1016\/0304-3975(90)90053-K","volume":"71","author":"M. Chrobak","year":"1990","unstructured":"Chrobak, M., T. Szymacha, and A. Krawczyk. A data structure useful for finding Hamiltonian cycles. Theoretical Computer Science 71, 419\u2013424, 1990.","journal-title":"Theoretical Computer Science"},{"key":"26_CR3","volume-title":"On the problem of sorting burnt pancakes","author":"D. S. Cohen","year":"1993","unstructured":"Cohen, David S. and Manuel Blum. On the problem of sorting burnt pancakes. Manuscript, Computer Science Division, University of California at Berkeley, 1993."},{"key":"26_CR4","unstructured":"Fredman, M.L., D.S. Johnson, L.A. McGeoch, and G. Ostheimer. Data structures for traveling salesmen. In Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, 145\u2013154, 1993."},{"key":"26_CR5","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0012-365X(79)90068-2","volume":"27","author":"W. H. Gates","year":"1979","unstructured":"Gates, William H. and Christos H. Papadimitriou. Bounds for sorting by prefix reversals. Discrete Mathematics 27, 47\u201357, 1979.","journal-title":"Discrete Mathematics"},{"key":"26_CR6","volume-title":"PhD dissertation","author":"M. H. Heydari","year":"1993","unstructured":"Heydari, Mohammad H. The Pancake Problem. PhD dissertation, Department of Computer Science, University of Texas at Dallas, 1993."},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Kececioglu, John and David Sankoff. Exact and approximation algorithms for the inversion distance between two chromosomes. In Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching, Lecture Notes in Computer Science 684, Springer-Verlag, 87\u2013105, June 1993. (An earlier version appeared as \u201cExact and approximation algorithms for the reversal distance between two permutations,\u201d Technical Report 1824, Centre de recherches math\u00e9matiques, Universit\u00e9 de Montr\u00e9al, Montr\u00e9al, Canada, July 1992.)","DOI":"10.1007\/BFb0029799"},{"key":"26_CR8","unstructured":"Kececioglu, John and David Sankoff. Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement. To appear in Algorithmica, 1993."},{"key":"26_CR9","doi-asserted-by":"crossref","first-page":"6575","DOI":"10.1073\/pnas.89.14.6575","volume":"89","author":"S. David","year":"1992","unstructured":"Sankoff, David, Guillame Leduc, Natalie Antoine, Bruno Paquin, B. Franz Lang, and Robert Cedergren. Gene order comparisons for phylogenetic inference: evolution of the mitochondrial genome. Proceedings of the National Academy of Science USA 89, 6575\u20136579, 1992.","journal-title":"Proceedings of the National Academy of Science USA"},{"key":"26_CR10","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1007\/BF02459633","volume":"54","author":"S. Michael","year":"1992","unstructured":"Sch\u00f6niger, Michael and Michael S. Waterman. A local algorithm for DNA sequence alignment with inversions. Bulletin of Mathematical Biology 54, 521\u2013536, 1992.","journal-title":"Bulletin of Mathematical Biology"},{"key":"26_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0022-5193(82)90384-8","volume":"99","author":"G.A. Watterson","year":"1982","unstructured":"Watterson, G.A., W.J. Ewens, T.E. Hall, and A. Morgan. The chromosome inversion problem. Journal of Theoretical Biology 99, 1\u20137, 1982.","journal-title":"Journal of Theoretical Biology"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58094-8_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:16:56Z","timestamp":1605629816000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58094-8_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540580942","9783540484509"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-58094-8_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}