{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T21:47:05Z","timestamp":1767649625116},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405344"},{"type":"electronic","value":"9783540450719"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45071-8_9","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T08:04:43Z","timestamp":1193472283000},"page":"68-79","source":"Crossref","is-referenced-by-count":42,"title":["On the Similarity of Sets of Permutations and Its Applications to Genome Comparison"],"prefix":"10.1007","author":[{"given":"Anne","family":"Bergeron","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jens","family":"Stoye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"key":"9_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1007\/3-540-45784-4_23","volume-title":"Proc. WABI 2002","author":"Y. Ajana","year":"2002","unstructured":"Y. Ajana, J.-F. Lefebvre, E. R. M. Tillier, and N. El-Mabrouk. Exploring the set of all minimal sequences of reversals \u2014 an application to test the replication-directed reversal hypothesis. In Proc. WABI 2002, volume 2452 of LNCS, pages 300\u2013315. Springer Verlag, 2002."},{"issue":"5","key":"9_CR2","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 inversion distance between signed permutations with an experimental study. J. Comp. Biol., 8(5):483\u2013492, 2001.","journal-title":"J. Comp. Biol."},{"issue":"2","key":"9_CR3","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 J. Disc. Math., 11(2):224\u2013240, 1998.","journal-title":"SIAM J. Disc. Math."},{"issue":"Suppl. 2","key":"9_CR4","doi-asserted-by":"crossref","first-page":"S54","DOI":"10.1093\/bioinformatics\/18.suppl_2.S54","volume":"18","author":"A. Bergeron","year":"2002","unstructured":"A. Bergeron, S. Heber, and J. Stoye. Common intervals and sorting by reversals: A marriage of necessity. Bioinformatics, 18(Suppl. 2):S54\u2013S63, 2002. (Proc. ECCB 2002).","journal-title":"Bioinformatics"},{"key":"9_CR5","unstructured":"A. Bergeron and J. Stoye. On the similarity of sets of permutations and its application to genome comparison. Report 2003-01, Technische Fakult\u00e4t der Universit\u00e4t Bielefeld, 2003. (Available at www.techfak.uni-bielefeld.de\/stoye\/rpublications\/report2003-01.pdf)."},{"issue":"2","key":"9_CR6","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/PL00006542","volume":"49","author":"M. Blanchette","year":"1999","unstructured":"M. Blanchette, T. Kunisawa, and D. Sankoff. Gene order breakpoint evidence in animal mitochondrial phylogeny. J. Mol. Evol., 49(2):193\u2013203, 1999.","journal-title":"J. Mol. Evol."},{"key":"9_CR7","unstructured":"J. L. Boore. Mitochondrial gene arrangement source guide. www.jgi.doe.gov\/programs\/comparative\/Mito_top_level.html."},{"issue":"3","key":"9_CR8","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"K. S. Booth","year":"1976","unstructured":"K. S. Booth and G. S. Lueker. Testing for the consecutive ones property, interval graphs and graph planarity using PQ-tree algorithms. J. Comput. Syst. Sci., 13(3):335\u2013379, 1976.","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"9_CR9","first-page":"26","volume":"12","author":"G. Bourque","year":"2002","unstructured":"G. Bourque and P. A. Pevzner. Genome-scale evolution: Reconstructing gene orders in the ancestral species. Genome Res., 12(1):26\u201336, 2002.","journal-title":"Genome Res."},{"key":"9_CR10","unstructured":"D. A. Christie. Genome Rearrangement Problems. PhD thesis, The University of Glasgow, 1998."},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"S. Hannenhalli and P. A. Pevzner. Transforming men into mice (polynomial algorithm for genomic distance problem). In Proc. FOCS 1995, pages 581\u2013592. IEEE Press, 1995.","DOI":"10.1109\/SFCS.1995.492588"},{"issue":"1","key":"9_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/300515.300516","volume":"46","author":"S. Hannenhalli","year":"1999","unstructured":"S. Hannenhalli and P. A. Pevzner. Transforming cabbage into turnip: Polynomial algorithm for sorting signed permutations by reversals. J. ACM, 46(1):1\u201327, 1999.","journal-title":"J. ACM"},{"key":"9_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/3-540-48194-X_19","volume-title":"Proc. CPM 2001","author":"S. Heber","year":"2001","unstructured":"S. Heber and J. Stoye. Finding all common intervals of k permutations. In Proc. CPM 2001, volume 2089 of LNCS, pages 207\u2013218. Springer Verlag, 2001."},{"issue":"3","key":"9_CR14","doi-asserted-by":"publisher","first-page":"880","DOI":"10.1137\/S0097539798334207","volume":"29","author":"H. Kaplan","year":"1999","unstructured":"H. Kaplan, R. Shamir, and R. E. Tarjan. A faster and simpler algorithm for sorting signed permutations by reversals. SIAM J. Computing, 29(3):880\u2013892, 1999.","journal-title":"SIAM J. Computing"},{"key":"9_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/3-540-58094-8_26","volume-title":"Proc. CPM 1994","author":"J. D. Kececioglu","year":"1994","unstructured":"J. D. Kececioglu and D. Sankoff. Efficient bounds for oriented chromosome inversion distance. In Proc. CPM 1994, volume 807 of LNCS, pages 307\u2013325. Springer Verlag, 1994."},{"key":"9_CR16","volume-title":"A Markov chain Monte Carlo approach to reconstructing ancestral genome rearrangements","author":"B. Larget","year":"2002","unstructured":"B. Larget, J. Kadane, and D. Simon. A Markov chain Monte Carlo approach to reconstructing ancestral genome rearrangements. Technical report, Carnegie Mellon University, Pittsburgh, 2002."},{"key":"9_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1007\/3-540-45784-4_40","volume-title":"Proc. WABI 2002","author":"B. M. E. Moret","year":"2002","unstructured":"B. M. E. Moret, A. C. Siepel, J. Tang, and T. Liu. Inversion medians outperform breakpoint medians in phylogeny reconstruction from gene-order data. In Proc. WABI 2002, volume 2452 of LNCS, pages 521\u2013536. Springer Verlag, 2002."},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"M. Ozery-Flato and R. Shamir. Two notes on genome rearrangements. J. Bioinf. Comput. Biol., to appear.","DOI":"10.1142\/S0219720003000198"},{"issue":"10","key":"9_CR19","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1093\/bioinformatics\/18.10.1305","volume":"18","author":"D. Sankoff","year":"2002","unstructured":"D. Sankoff. Short inversions and conserved gene clusters. Bioinformatics, 18(10):1305\u20131308, 2002.","journal-title":"Bioinformatics"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"A. Siepel. An algorithm to find all sorting reversals. In Proc. RECOMB 2002, pages 281\u2013290. ACM Press, 2002.","DOI":"10.1145\/565196.565233"},{"issue":"3","key":"9_CR21","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1016\/S0022-0000(02)00011-9","volume":"65","author":"G. Tesler","year":"2002","unstructured":"G. Tesler. Efficient algorithms for multichromosomal genome rearrangement. J. Comput. Syst. Sci., 65(3):587\u2013609, 2002.","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"9_CR22","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/s004539910014","volume":"26","author":"T. Uno","year":"2000","unstructured":"T. Uno and M. Yagiura. Fast algorithms to enumerate all common intervals of two permutations. Algorithmica, 26(2):290\u2013309, 2000.","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45071-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T02:09:12Z","timestamp":1556935752000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45071-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405344","9783540450719"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-45071-8_9","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}