{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T21:45:35Z","timestamp":1757540735986},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540280613"},{"type":"electronic","value":"9783540318064"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11533719_8","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T09:34:13Z","timestamp":1127813653000},"page":"52-62","source":"Crossref","is-referenced-by-count":3,"title":["Genome Rearrangements with Partially Ordered Chromosomes"],"prefix":"10.1007","author":[{"given":"Chunfang","family":"Zheng","sequence":"first","affiliation":[]},{"given":"David","family":"Sankoff","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1089\/106652701753216503","volume":"8","author":"D.A. Bader","year":"2001","unstructured":"Bader, D.A., Bernard, M.E., Moret, B.M.E., Yan, M.: A linear-time algorithm for computing inversion distance between signed permutations with an experimental study. Journal of Computational Biology\u00a08, 483\u2013491 (2001)","journal-title":"Journal of Computational Biology"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Hannenhalli, S., Pevzner, P.A.: Transforming men into mice polynomial algorithm for genomic distance problem. In: Proceedings of the IEEE 36th Annual Symposium on Foundations of Computer Science, pp. 581\u2013592 (1995)","DOI":"10.1109\/SFCS.1995.492588"},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/300515.300516","volume":"48","author":"S. Hannenhalli","year":"1999","unstructured":"Hannenhalli, S., Pevzner, P.A.: Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals). Journal of the ACM\u00a048, 1\u201327 (1999)","journal-title":"Journal of the ACM"},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1016\/S0022-0000(02)00011-9","volume":"65","author":"G. Tesler","year":"2002","unstructured":"Tesler, G.: Efficient algorithms for multichromosomal genome rearrangements. Journal of Computer and System Sciences\u00a065, 587\u2013609 (2002)","journal-title":"Journal of Computer and System Sciences"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Zheng, C., Lenert, A., Sankoff, D.: Reversal distance for partially ordered genomes. In: Bioinformatics 21, supplementary issue, Proceedings of ISMB 2005 (2005)","DOI":"10.1093\/bioinformatics\/bti1037"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11533719_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T04:07:03Z","timestamp":1553141223000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11533719_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540280613","9783540318064"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/11533719_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}