{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:20:20Z","timestamp":1757312420496},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540223412"},{"type":"electronic","value":"9783540278016"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27801-6_1","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T23:00:15Z","timestamp":1283727615000},"page":"1-13","source":"Crossref","is-referenced-by-count":37,"title":["Sorting by Reversals in Subquadratic Time"],"prefix":"10.1007","author":[{"given":"Eric","family":"Tannier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marie-France","family":"Sagot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Bader, D.A., Moret, B.M.E., Yan, M.: A linear-time algorithm for compting inversion distance between signed permutations with an experimental study. In: Proceedings of the 7th Workshop on Algorithms and Data Structures, pp. 365\u2013376 (2001)","DOI":"10.1007\/3-540-44634-6_34"},{"key":"1_CR2","unstructured":"Bergeron, A., Mixtacki, J., Stoye, J.: The Reversal Distance Problem. In: Gascuel, O. (ed.) Mathematics of Evolution and Phylogeny, Oxford University Press, Oxford (to appear)"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1007\/3-540-61258-0_14","volume-title":"Combinatorial Pattern Matching","author":"P. Berman","year":"1996","unstructured":"Berman, P., Hannenhalli, S.: Fast sorting by reversals. In: Hirschberg, D.S., Meyers, G. (eds.) CPM 1996. LNCS, vol.\u00a01075, pp. 168\u2013185. Springer, Heidelberg (1996)"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Hannenhalli, S., Pevzner, P.: Transforming cabbage into turnip polynomial algorithm for sorting signed permutations by reversals. In: Proceedings of the 27th ACM Symposium on Theory of Computing, pp. 178\u2013189 (1995)","DOI":"10.1145\/225058.225112"},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"880","DOI":"10.1137\/S0097539798334207","volume":"29","author":"H. Kaplan","year":"1999","unstructured":"Kaplan, H., Shamir, R., Tarjan, R.E.: Faster and simpler algorithm for sorting signed permutations by reversals. SIAM Journal on Computing\u00a029, 880\u2013892 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/3-540-44888-8_13","volume-title":"Combinatorial Pattern Matching","author":"H. Kaplan","year":"2003","unstructured":"Kaplan, H., Verbin, E.: Efficient data structures and a new randomized approach for sorting signed permutations by reversals. In: Baeza-Yates, R., Ch\u00e1vez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol.\u00a02676, pp. 170\u2013185. Springer, Heidelberg (2003)"},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1142\/S0219720003000198","volume":"1","author":"M. Ozery-Flato","year":"2003","unstructured":"Ozery-Flato, M., Shamir, R.: Two notes on genome rearrangement. Journal of Bioinformatics and Computational Biology\u00a01, 71\u201394 (2003)","journal-title":"Journal of Bioinformatics and Computational Biology"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27801-6_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:21:24Z","timestamp":1605759684000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27801-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540223412","9783540278016"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27801-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}