A fast algorithm for the multiple genome rearrangement problem with weighted reversals and transpositions

BMC Bioinformatics

Volumn 9, Issue , 2008, Pages

  Bader, Martin ^a   Abouelhoda, Mohamed I ^b,c   Ohlebusch, Enno ^a  

^a UNIVERSITY OF ULM   (Germany)

^b CAIRO UNIVERSITY   (Egypt)

^c NILE UNIVERSITY   (Egypt)

Author keywords

[No Author keywords available]

Indexed keywords

BREAKPOINT DISTANCE; GENOME REARRANGEMENTS; GENOME SEQUENCING; PHYLOGENETIC RECONSTRUCTION; PHYLOGENETIC TREES; REALISTIC SCENARIO; REVERSAL DISTANCE; TRANSPOSITION DISTANCES;

APPROXIMATION ALGORITHMS; BIOINFORMATICS; HEURISTIC ALGORITHMS; TREES (MATHEMATICS);

GENES;

CHLOROPLAST DNA; CIRCULAR DNA; MITOCHONDRIAL DNA;

ALGORITHM; ANALYSIS OF VARIANCE; ANIMAL; ARTICLE; BIOLOGICAL MODEL; BIOLOGY; CAMPANULACEAE; GENE REARRANGEMENT; GENETIC DATABASE; GENETICS; GENOME; GENOMICS; METHODOLOGY; MOLECULAR EVOLUTION; MUTATION; PHYLOGENY;

ALGORITHMS; ANALYSIS OF VARIANCE; ANIMALS; CAMPANULACEAE; COMPUTATIONAL BIOLOGY; DATABASES, GENETIC; DNA, CHLOROPLAST; DNA, CIRCULAR; DNA, MITOCHONDRIAL; EVOLUTION, MOLECULAR; GENE REARRANGEMENT; GENOME; GENOMICS; MODELS, GENETIC; MUTATION; PHYLOGENY;

EID: 60849083813     PISSN: None     EISSN: 14712105     Source Type: Journal    
DOI: 10.1186/1471-2105-9-516     Document Type: Article

References (28)

1. Pevzner P Tesler G Genome Rearrangements in Mammalian Evolution: Lessons From Human and Mouse Genomes Genome Research 2003, 13:37-45. 430962 12529304
2. 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-491. 11694179
3. 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-399.
4. Bader M Ohlebusch E Sorting by Weighted Reversals, Transpositions, and Inverted Transpositions Journal of Computational Biology 2007, 14(5):615-636. 17683264
5. Bader M Sorting by Weighted Transpositions and Reversals Diploma thesis University of Ulm 2005. http://www.uni-ulm.de/fileadmin/website_uni_ulm/ iui.inst.190/Mitarbeiter/bader/bad_2005.pdf
6. 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-320.
7. Pe'er I Shamir R The median problems for breakpoints are NP-complete Electronic Colloquium on Computational Complexity 1998, 5:71.
8. Caprara A Formulations and Hardness of Multiple Sorting by Reversals Proc 3rd Annual International Conference on Computational Molecular Biology ACM 1999, 84-93.
9. Sankoff D Blanchette M Multiple Genome Rearrangement and Breakpoint Phylogeny Journal of Computational Biology 1998, 5(3):555-570. 9773350
10. 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-594. 11262975
11. Moret B Siepel A Tang J Liu T Inversion Medians Outperform Breakpoint Medians in Phylogeny Reconstruction from Gene-order Data Proc 2nd Workshop on Algorithms in Bioinformatics, of Lecture Notes in Computer Science Springer-Verlag 2002, 2452:521-536.
12. Tang J Moret B Cui L dePamphilis C Phylogenetic Reconstruction from Arbitrary Gene-order Data Proc 4th IEEE Conference on Bioinformatics and Bioengineering IEEE Press 2004, 592-599.
13. Bourque B Pevzner P Genome-Scale Evolution: Reconstructing Gene Orders in the Ancestral Species Genome Research 2002, 12:26-36. 155248 11779828
14. Wu S Gu X Multiple Genome Rearrangement by Reversals Pacific Symposium on Biocomputing World Scientific 2002, 259-270. 11928481
15. Sankoff D Sundaram G Kececioglu J Steiner Points in the Space of Genome Rearrangements International Journal of Foundations of Computer Science 1996, 7:1-9.
16. Wu S Gu X Algorithms for Multiple Genome Rearrangement by Signed Reversals Pacific Symposium on Biocomputing World Scientific 2003, 363-374. 12603042
17. Bernt M Merkle D Middendorf M Using median sets for inferring phylogenetic trees Bioinformatics 2007, 23:e129-e135. 17237080
18. 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 Comparative Genomics: Empirical and Analytical Approaches to Gene Order Dynamics, Map Alignment, and the Evolution of Gene Families Kluwer Academic Publishers 2000, 99-121.
19. Blanchette M Kunisawa T Sankoff D Parametric genome rearrangement Gene 1996, 172:GC11-17. 8654963
20. Hannenhalli S Pevzner P Transforming cabbage into turnip: Polynomial algorithm for sorting signed permutations by reversals Journal of the ACM 1999, 46:1-27.
21. Tannier E Bergeron A Sagot MF Advances on sorting by reversals Discrete Applied Mathematics 2007, 155:881-888.
22. Caprara A The Reversal Median Problem INFORMS Journal on Computing 2003, 15:93-113.
23. Blanchette M Kunisawa T Sankoff D Gene order breakpoint evidence in animal mitochondrial phylogeny Journal of Molecular Evolution 1999, 49(2):193-203. 10441671
24. Fritzsch G Schlegel M Stadler P Alignments of mitochondrial genome arrangements: Applications to metazoan phylogeny Journal of Theoretical Biology 2006, 240(4):511-520. 16325206
25. Bafna V Pevzner P Genome Rearrangements and Sorting by Reversals SIAM Journal on Computing 1996, 25(2):272-289.
26. Eriksen N (1 + )-approximation of Sorting by Reversals and Transpositions Theoretical Computer Science 2002, 289:517-529.
27. Moret B Tang J GRAPPA's Homepage World Wide Web http://www.cs.unm.edu/ ~moret/GRAPPA
28. Liu T Tang J Moret M Quartet-Based Phylogeny Reconstruction from Gene Orders Proc 11th Annual International Conference on Computing and Combinatorics, of Lecture Notes in Computer Science Springer-Verlag 2005, 3595:63-73.