{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T01:07:34Z","timestamp":1773277654395,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540442110","type":"print"},{"value":"9783540457848","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45784-4_23","type":"book-chapter","created":{"date-parts":[[2007,10,16]],"date-time":"2007-10-16T14:33:38Z","timestamp":1192545218000},"page":"300-315","source":"Crossref","is-referenced-by-count":26,"title":["Exploring the Set of All Minimal Sequences of Reversals \u2014 An Application to Test the Replication-Directed Reversal Hypothesis"],"prefix":"10.1007","author":[{"given":"Yasmine","family":"Ajana","sequence":"first","affiliation":[]},{"given":"Lefebvre","family":"Jean-Fran\u00e7ois","sequence":"additional","affiliation":[]},{"given":"Elisabeth R.M.","family":"Tillier","sequence":"additional","affiliation":[]},{"given":"Nadia","family":"El-Mabrouk","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,10,10]]},"reference":[{"issue":"5","key":"23_CR1","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1089\/106652701753216503","volume":"8","author":"D.A. Bader","year":"2001","unstructured":"D.A. Bader, B.M.E. Moret, and M. Yan. A linear-time algorithm for computing inv. dist. between signed perm. J. Comput. Biol., 8(5):483\u2013491, 2001.","journal-title":"J. Comput. Biol."},{"issue":"2","key":"23_CR2","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1137\/S089548019528280X","volume":"11","author":"V. Bafna","year":"1998","unstructured":"V. Bafna and P.A. Pevzner. Sorting by transpositions. SIAM Journal on Discrete Mathematics, 11(2):224\u2013240, 1998.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"23_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1007\/3-540-48194-X_9","volume-title":"CPM\u201901","author":"A. Bergeron","year":"2001","unstructured":"A. Bergeron. A very elementary presentation of the Hannenhalli-Pevzner theory. In CPM\u201901, LNCS, pages 106\u2013117. Springer Verlag, 2001."},{"key":"23_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1007\/3-540-61258-0_14","volume-title":"CPM\u201996","author":"P. Berman","year":"1996","unstructured":"P. Berman and S. Hannenhalli. Fast sorting by reversals. In CPM\u201996, LNCS, pages 168\u2013185. Springer-Verlag, 1996."},{"key":"23_CR5","first-page":"11","volume":"172","author":"M. Blanchette","year":"1996","unstructured":"M. Blanchette, T. Kunisawa, and D. Sankoff. Parametric genome rearrangement. Gene-Combis, 172:11\u201317, 1996.","journal-title":"Gene-Combis"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"N. El-Mabrouk. Sorting signed permutations by reversals and insertions\/deletions of contiguous segments. to appear in J. Disc. Algo., 2000.","DOI":"10.1007\/3-540-45123-4_20"},{"key":"23_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1007\/3-540-60044-2_41","volume-title":"CPM","author":"S. Hannenhalli","year":"1995","unstructured":"S. Hannenhalli. Polynomial-time algorithm for computing translocation distance between genomes. In CPM, LNCS 937, pages 162\u2013176. Springer, 1995."},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"S. Hannenhalli and P.A. Pevzner. Transforming cabbage into turnip. In Proc. 27th Annu. ACM-SIAM Symp. Theory of Comp., pages 178\u2013189, 1995.","DOI":"10.1145\/225058.225112"},{"key":"23_CR9","unstructured":"S. Hannenhalli and P.A. Pevzner. Transforming men into mice. In Proc. of the IEEE 36th Annu. Symp. on Found. of Comp. Sci., pages 581\u2013592, 1995."},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"H. Kaplan, R. Shamir, and R.E. Tarjan. Faster and simpler algo. for sorting sign. perm. by rev. In Proc. 8th Annu. ACM-SIAM Symp. Disc. Algo., 1997.","DOI":"10.1145\/267521.267544"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"A. C. Siepel. An algorithm to find all sorting reversals. In RECOMB\u201902, pages 281\u2013290, Washington, 2002. ACM.","DOI":"10.1145\/565196.565233"},{"key":"23_CR12","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1038\/79918","volume":"26","author":"E.R.M. Tillier","year":"2000","unstructured":"E.R.M. Tillier and R.A. Collins. Genome rearrangement by replication-directed translocation. Nature Genetics, 26:195\u2013197, October 2000.","journal-title":"Nature Genetics"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"M. E. Walter, Z. Dias, and J. Meidanis. Reversal and transposition distance of linear chromosomes. In SPIRE\u2019 98, 1998.","DOI":"10.1109\/SPIRE.1998.712988"}],"container-title":["Lecture Notes in Computer Science","Algorithms in Bioinformatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45784-4_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,14]],"date-time":"2023-05-14T12:19:47Z","timestamp":1684066787000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45784-4_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540442110","9783540457848"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-45784-4_23","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]}}}