{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T00:07:55Z","timestamp":1773274075423,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540676331","type":"print"},{"value":"9783540451235","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-45123-4_20","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T14:59:14Z","timestamp":1194965954000},"page":"222-234","source":"Crossref","is-referenced-by-count":43,"title":["Genome Rearrangement by Reversals and Insertions\/Deletions of Contiguous Segments"],"prefix":"10.1007","author":[{"given":"Nadia","family":"El-Mabrouk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,11,7]]},"reference":[{"key":"20_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1007\/3-540-61258-0_14","volume-title":"Combinatorial Pattern Matching, Proceedings of the 7th Annual Symposium","author":"P. Berman","year":"1996","unstructured":"P. Berman and S. Hannenhalli. Fast sorting by reversals. In D. Hirschberg and G. Myers, editors, Combinatorial Pattern Matching, Proceedings of the 7th Annual Symposium, number 1075 in Lecture Notes in Computer Science, pages 168\u2013185. Springer, 1996."},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"A. Caprara. Sorting by reversals is difficult. In Proceedings of the First Annual International Conference on Computational Molecular Biology (RE-COMB 97), pages 75\u201383, New York, 1997. ACM.","DOI":"10.1145\/267521.267531"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"A. Caprara. Formulations and hardness of multiple sorting by reversals. In S. Istrail, P.A. Pevzner, and M.S. Waterman, editors, Proceedings of the Third Annual International Conference on Computational Molecular Biology (RECOMB 99), pages 84\u201393, New York, 1999. ACM.","DOI":"10.1145\/299432.299461"},{"key":"20_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1007\/3-540-60044-2_41","volume-title":"Sixth Annual Symposium on Combinatorial Pattern Matching","author":"S. Hannenhalli","year":"1995","unstructured":"S. Hannenhalli. Polynomial-time algorithm for computing translocation distance between genomes. In Z. Galil and E. Ukkonen, editors, Sixth Annual Symposium on Combinatorial Pattern Matching, volume 937 of Lecture Notes in Computer Science, pages 162\u2013176, Berlin, 1995. Springer."},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"S. Hannenhalli and P.A. Pevzner. Transforming cabbage into turnip. (polynomial algorithm for sorting signed permutations by reversals). In Proceedings of the 27th Annual ACM-SIAM Symposium on the Theory of Computing, pages 178\u2013189, 1995.","DOI":"10.1145\/225058.225112"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"S. Hannenhalli and P.A. Pevzner. Transforming men into mice (polynomial algorithm for genomic distance problem). In Proceedings of the IEEE 36th Annual Symposium on Foundations of Computer Science, pages 581\u2013592, 1995.","DOI":"10.1109\/SFCS.1995.492588"},{"key":"20_CR7","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1093\/nar\/26.1.138","volume":"26","author":"K.L.R.B.+.9.8._.M. Korab-Laskowska","year":"1998","unstructured":"KLRB+98._M. Korab-Laskowska, P. Rioux, N. Brossard, TG. Littlejohn, MW. Gray, BF. Lang, and G. Burger. The organelle genome database project (gobase). Nucleic Acids Res, 26:139\u2013146, 1998.","journal-title":"Nucleic Acids Res"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"H. Kaplan, R. Shamir, and R.E. Tarjan. Faster and simpler algorithm for sorting signed permutations by reversals. In Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 344\u2013351, New York, 1997.","DOI":"10.1145\/267521.267544"},{"key":"20_CR9","unstructured":"Introduction to Computational Molecular Biology. PWS Publishing Company, 1997."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45123-4_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T06:38:16Z","timestamp":1556951896000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45123-4_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540676331","9783540451235"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-45123-4_20","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2000]]}}}