{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,24]],"date-time":"2025-03-24T06:53:50Z","timestamp":1742799230939},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540425168"},{"type":"electronic","value":"9783540446965"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44696-6_13","type":"book-chapter","created":{"date-parts":[[2007,5,31]],"date-time":"2007-05-31T23:45:10Z","timestamp":1180655110000},"page":"164-174","source":"Crossref","is-referenced-by-count":3,"title":["Experiments in Computing Sequences of Reversals"],"prefix":"10.1007","author":[{"given":"Anne","family":"Bergeron","sequence":"first","affiliation":[]},{"given":"Fran\u00e7ois","family":"Strasbourg","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,17]]},"reference":[{"key":"13_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-45422-5","volume-title":"Proc. 7th Workshop on Algs. and Data Structs. WADS01","author":"D. Bader","year":"2001","unstructured":"David Bader, Bernard Moret, Mi Yan, A Linear-Time Algorithm for Computing Inversion Distance Between Signed Permutations with an Experiemntal Study. Proc. 7th Workshop on Algs. and Data Structs. WADS01, Providence (2001), to appear in Lecture Notes in Computer Science, Springer Verlag."},{"key":"13_CR2","series-title":"Lect Notes Comput Sci","volume-title":"A Very Elementary Presentation of the Hannenhalli-Pevzner Theory","author":"A. Bergeron","year":"2001","unstructured":"Anne Bergeron, A Very Elementary Presentation of the Hannenhalli-Pevzner Theory. CPM 2001, Jerusalem (2001), to appear in Lecture Notes in Computer Science, Springer Verlag."},{"key":"13_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1007\/3-540-61258-0_14","volume-title":"CPM 1996","author":"P. Berman","year":"1996","unstructured":"Piotr Berman and Sridhar Hannenhalli, Fast Sorting by Reversal. CPM 1996, LNCS 1075: 168\u2013185 (1996)."},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Alberto Caprara, Sorting by reversals is difficult. RECOMB 1997, ACM Press: 75\u201383 (1997).","DOI":"10.1145\/267521.267531"},{"issue":"1","key":"13_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/300515.300516","volume":"46","author":"S. Hannenhalli","year":"1999","unstructured":"Sridhar Hannenhalli and Pavel Pevzner, Transforming Cabbage into Turnip: Polynomial Algorithm for Sorting Signed Permutations by Reversals. JACM 46(1): 1\u201327 (1999).","journal-title":"JACM"},{"key":"13_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/3-540-58094-8_26","volume-title":"CPM 1994","author":"J. Kececioglu","year":"1994","unstructured":"John Kececioglu and David Sankoff, Efficient bounds for oriented chromosome-inversion distance. CPM 1994, LNCS 807: 307\u2013325 (1994)."},{"issue":"3","key":"13_CR7","doi-asserted-by":"publisher","first-page":"880","DOI":"10.1137\/S0097539798334207","volume":"29","author":"H. Kaplan","year":"1999","unstructured":"Haim Kaplan, Ron Shamir, Robert Tarjan, A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals. SIAM J. Comput. 29(3): 880\u2013892 (1999).","journal-title":"SIAM J. Comput"},{"key":"13_CR8","doi-asserted-by":"crossref","first-page":"314","DOI":"10.7551\/mitpress\/2022.001.0001","volume-title":"Computational Molecular Biology","author":"P. Pevzner","year":"2000","unstructured":"Pavel Pevzner, Computational Molecular Biology, MIT Press, Cambridge, Mass., 314 pp. (2000)."},{"key":"13_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/3-540-56024-6_10","volume-title":"CPM 1992","author":"D. Sankoff","year":"1992","unstructured":"David Sankoff, Edit Distances for Genome Comparisons Based on Non-Local Operations. CPM 1992, LNCS 644: 121\u2013135 (1992)."}],"container-title":["Lecture Notes in Computer Science","Algorithms in Bioinformatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44696-6_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T11:19:38Z","timestamp":1556450378000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44696-6_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540425168","9783540446965"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-44696-6_13","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}