{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T00:12:40Z","timestamp":1773274360363,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,12,1]],"date-time":"2008-12-01T00:00:00Z","timestamp":1228089600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/2.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["BMC Bioinformatics"],"published-print":{"date-parts":[[2008,12]]},"DOI":"10.1186\/1471-2105-9-516","type":"journal-article","created":{"date-parts":[[2008,12,4]],"date-time":"2008-12-04T14:16:40Z","timestamp":1228400200000},"source":"Crossref","is-referenced-by-count":16,"title":["A fast algorithm for the multiple genome rearrangement problem with weighted reversals and transpositions"],"prefix":"10.1186","volume":"9","author":[{"given":"Martin","family":"Bader","sequence":"first","affiliation":[]},{"given":"Mohamed I","family":"Abouelhoda","sequence":"additional","affiliation":[]},{"given":"Enno","family":"Ohlebusch","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,12,4]]},"reference":[{"key":"2501_CR1","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1101\/gr.757503","volume":"13","author":"P Pevzner","year":"2003","unstructured":"Pevzner P, Tesler G: Genome Rearrangements in Mammalian Evolution: Lessons From Human and Mouse Genomes. Genome Research 2003, 13: 37\u201345.","journal-title":"Genome Research"},{"key":"2501_CR2","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1089\/106652701753216503","volume":"8","author":"D Bader","year":"2001","unstructured":"Bader D, Moret B, Yan M: A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study. Journal of Computational Biology 2001, 8: 483\u2013491.","journal-title":"Journal of Computational Biology"},{"key":"2501_CR3","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/978-3-540-27801-6_29","volume":"3109","author":"A Bergeron","year":"2004","unstructured":"Bergeron A, Mixtacki J, Stoye J: Reversal Distance without Hurdles and Fortresses. Proc 15th Annual Symposium on Combinatorial Pattern Matching, of Lecture Notes in Computer Science 2004, 3109: 388\u2013399.","journal-title":"Proc 15th Annual Symposium on Combinatorial Pattern Matching, of Lecture Notes in Computer Science"},{"issue":"5","key":"2501_CR4","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1089\/cmb.2007.R006","volume":"14","author":"M Bader","year":"2007","unstructured":"Bader M, Ohlebusch E: Sorting by Weighted Reversals, Transpositions, and Inverted Transpositions. Journal of Computational Biology 2007, 14(5):615\u2013636.","journal-title":"Journal of Computational Biology"},{"key":"2501_CR5","volume-title":"Diploma thesis","author":"M Bader","year":"2005","unstructured":"Bader M: Sorting by Weighted Transpositions and Reversals. Diploma thesis University of Ulm; 2005. [\n                    http:\/\/www.uni-ulm.de\/fileadmin\/website_uni_ulm\/iui.inst.190\/Mitarbeiter\/bader\/bad_2005.pdf\n                    \n                  ]"},{"issue":"3","key":"2501_CR6","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/j.jcss.2004.12.006","volume":"70","author":"T Hartman","year":"2005","unstructured":"Hartman T, Sharan R: A 1.5-Approximation Algorithm for Sorting by Transpositions and Transreversals. Journal of Computer and System Sciences 2005, 70(3):300\u2013320.","journal-title":"Journal of Computer and System Sciences"},{"key":"2501_CR7","unstructured":"Pe'er I, Shamir R: The median problems for breakpoints are NP-complete. Electronic Colloquium on Computational Complexity 1998., 5(71):"},{"key":"2501_CR8","first-page":"84","volume-title":"Proc 3rd Annual International Conference on Computational Molecular Biology","author":"A Caprara","year":"1999","unstructured":"Caprara A: Formulations and Hardness of Multiple Sorting by Reversals. In Proc 3rd Annual International Conference on Computational Molecular Biology. ACM; 1999:84\u201393."},{"issue":"3","key":"2501_CR9","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1089\/cmb.1998.5.555","volume":"5","author":"D Sankoff","year":"1998","unstructured":"Sankoff D, Blanchette M: Multiple Genome Rearrangement and Breakpoint Phylogeny. Journal of Computational Biology 1998, 5(3):555\u2013570.","journal-title":"Journal of Computational Biology"},{"key":"2501_CR10","first-page":"583","volume-title":"Pacific Symposium on Biocomputing","author":"B Moret","year":"2001","unstructured":"Moret B, Wyman S, Bader D, Warnow T, Yan M: A New Implementation and Detailed Study of Breakpoint Analysis. Pacific Symposium on Biocomputing 2001, 583\u2013594."},{"key":"2501_CR11","first-page":"521","volume-title":"Proc 2nd Workshop on Algorithms in Bioinformatics, of Lecture Notes in Computer Science","author":"B Moret","year":"2002","unstructured":"Moret B, Siepel A, Tang J, Liu T: Inversion Medians Outperform Breakpoint Medians in Phylogeny Reconstruction from Gene-order Data. In Proc 2nd Workshop on Algorithms in Bioinformatics, of Lecture Notes in Computer Science. Volume 2452. Springer-Verlag; 2002:521\u2013536."},{"key":"2501_CR12","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1109\/BIBE.2004.1317396","volume-title":"Proc 4th IEEE Conference on Bioinformatics and Bioengineering","author":"J Tang","year":"2004","unstructured":"Tang J, Moret B, Cui L, dePamphilis C: Phylogenetic Reconstruction from Arbitrary Gene-order Data. In Proc 4th IEEE Conference on Bioinformatics and Bioengineering. IEEE Press; 2004:592\u2013599."},{"key":"2501_CR13","first-page":"26","volume":"12","author":"B Bourque","year":"2002","unstructured":"Bourque B, Pevzner P: Genome-Scale Evolution: Reconstructing Gene Orders in the Ancestral Species. Genome Research 2002, 12: 26\u201336.","journal-title":"Genome Research"},{"key":"2501_CR14","first-page":"259","volume-title":"Pacific Symposium on Biocomputing","author":"S Wu","year":"2002","unstructured":"Wu S, Gu X: Multiple Genome Rearrangement by Reversals. In Pacific Symposium on Biocomputing. World Scientific; 2002:259\u2013270."},{"key":"2501_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S0129054196000026","volume":"7","author":"D Sankoff","year":"1996","unstructured":"Sankoff D, Sundaram G, Kececioglu J: Steiner Points in the Space of Genome Rearrangements. International Journal of Foundations of Computer Science 1996, 7: 1\u20139.","journal-title":"International Journal of Foundations of Computer Science"},{"key":"2501_CR16","first-page":"363","volume-title":"Pacific Symposium on Biocomputing","author":"S Wu","year":"2003","unstructured":"Wu S, Gu X: Algorithms for Multiple Genome Rearrangement by Signed Reversals. In Pacific Symposium on Biocomputing. World Scientific; 2003:363\u2013374."},{"key":"2501_CR17","doi-asserted-by":"publisher","first-page":"e129","DOI":"10.1093\/bioinformatics\/btl300","volume":"23","author":"M Bernt","year":"2007","unstructured":"Bernt M, Merkle D, Middendorf M: Using median sets for inferring phylogenetic trees. Bioinformatics 2007, 23: e129-e135.","journal-title":"Bioinformatics"},{"key":"2501_CR18","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-94-011-4309-7_11","volume-title":"Comparative Genomics: Empirical and Analytical Approaches to Gene Order Dynamics, Map Alignment, and the Evolution of Gene Families","author":"M Cosner","year":"2000","unstructured":"Cosner M, Jansen R, Moret B, Raubeson L, Wang LS, Warnow T, Wyman S: An Empirical Comparison Between BPAnalysis and MPBE on the Campanulaceae Chloroplast Genome Dataset. In Comparative Genomics: Empirical and Analytical Approaches to Gene Order Dynamics, Map Alignment, and the Evolution of Gene Families. Kluwer Academic Publishers; 2000:99\u2013121."},{"key":"2501_CR19","doi-asserted-by":"publisher","first-page":"GC11","DOI":"10.1016\/0378-1119(95)00878-0","volume":"172","author":"M Blanchette","year":"1996","unstructured":"Blanchette M, Kunisawa T, Sankoff D: Parametric genome rearrangement. Gene 1996, 172: GC11\u201317.","journal-title":"Gene"},{"key":"2501_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/300515.300516","volume":"46","author":"S Hannenhalli","year":"1999","unstructured":"Hannenhalli S, Pevzner P: Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals. Journal of the ACM 1999, 46: 1\u201327.","journal-title":"Journal of the ACM"},{"key":"2501_CR21","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1016\/j.dam.2005.02.033","volume":"155","author":"E Tannier","year":"2007","unstructured":"Tannier E, Bergeron A, Sagot MF: Advances on sorting by reversals. Discrete Applied Mathematics 2007, 155: 881\u2013888.","journal-title":"Discrete Applied Mathematics"},{"key":"2501_CR22","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1287\/ijoc.15.1.93.15155","volume":"15","author":"A Caprara","year":"2003","unstructured":"Caprara A: The Reversal Median Problem. INFORMS Journal on Computing 2003, 15: 93\u2013113.","journal-title":"INFORMS Journal on Computing"},{"issue":"2","key":"2501_CR23","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/PL00006542","volume":"49","author":"M Blanchette","year":"1999","unstructured":"Blanchette M, Kunisawa T, Sankoff D: Gene order breakpoint evidence in animal mitochondrial phylogeny. Journal of Molecular Evolution 1999, 49(2):193\u2013203.","journal-title":"Journal of Molecular Evolution"},{"issue":"4","key":"2501_CR24","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1016\/j.jtbi.2005.10.010","volume":"240","author":"G Fritzsch","year":"2006","unstructured":"Fritzsch G, Schlegel M, Stadler P: Alignments of mitochondrial genome arrangements: Applications to metazoan phylogeny. Journal of Theoretical Biology 2006, 240(4):511\u2013520.","journal-title":"Journal of Theoretical Biology"},{"issue":"2","key":"2501_CR25","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1137\/S0097539793250627","volume":"25","author":"V Bafna","year":"1996","unstructured":"Bafna V, Pevzner P: Genome Rearrangements and Sorting by Reversals. SIAM Journal on Computing 1996, 25(2):272\u2013289.","journal-title":"SIAM Journal on Computing"},{"key":"2501_CR26","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1016\/S0304-3975(01)00338-3","volume":"289","author":"N Eriksen","year":"2002","unstructured":"Eriksen N: (1 + \u03f5)-approximation of Sorting by Reversals and Transpositions. Theoretical Computer Science 2002, 289: 517\u2013529.","journal-title":"Theoretical Computer Science"},{"key":"2501_CR27","unstructured":"Moret B, Tang J: GRAPPA's Homepage. World Wide Web [\n                    http:\/\/www.cs.unm.edu\/~moret\/GRAPPA\n                    \n                  ]"},{"key":"2501_CR28","first-page":"63","volume-title":"Proc 11th Annual International Conference on Computing and Combinatorics, of Lecture Notes in Computer Science","author":"T Liu","year":"2005","unstructured":"Liu T, Tang J, Moret M: Quartet-Based Phylogeny Reconstruction from Gene Orders. In Proc 11th Annual International Conference on Computing and Combinatorics, of Lecture Notes in Computer Science. Volume 3595. Springer-Verlag; 2005:63\u201373."}],"container-title":["BMC Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1471-2105-9-516.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/1471-2105-9-516\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1471-2105-9-516.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,22]],"date-time":"2019-01-22T05:10:21Z","timestamp":1548133821000},"score":1,"resource":{"primary":{"URL":"https:\/\/bmcbioinformatics.biomedcentral.com\/articles\/10.1186\/1471-2105-9-516"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,12]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,12]]}},"alternative-id":["2501"],"URL":"https:\/\/doi.org\/10.1186\/1471-2105-9-516","relation":{},"ISSN":["1471-2105"],"issn-type":[{"value":"1471-2105","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,12]]},"article-number":"516"}}