Whole genome duplications, multi-break rearrangements, and Genome Halving Problem

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 07-09-January-2007, Issue , 2007, Pages 665-679

  Alekseyev, Max A ^a   Pevzner, Pavel A ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GENES; MOLECULAR BIOLOGY;

ALGORITHM FOR SOLVING; BREAKPOINT GRAPHS; GENOME DUPLICATION; MOLECULAR EVOLUTION; MULTICHROMOSOMAL GENOMES; PROBLEM-BASED; SECOND CLASS;

PROBLEM SOLVING;

EID: 84969256270     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (53)

1. M. Alekseyev and P. Pevzner. Multi-Break Rearrangements and Breakpoint Re-use in Chromosomal Evolution. (unpublished manuscript).
2. M. Alekseyev and P. Pevzner. Colored de Bruijn graphs and Genome Halving Problem. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 3, 2006. (in press).
3. D. A. Bader, B. M. E. Moret, and M. Yan. A linear-time algorithm for computing inversion distances between signed permutations with an experimental study. J. Comput. Biol., 8:483-491, 2001.
4. M. Bader and E. Ohlebusch. Sorting by weighted reversals, transpositions, and inverted transpositions. Proceedings of the 10th Conference on Research in Computational Molecular Biology (RECOMB), pages 563-577, 2006.
5. V. Bafna and P. A. Pevzner. Genome rearrangement and sorting by reversals. SIAM Journal on Computing, 25:272-289, 1996.
6. V. Bafna and P. A. Pevzner. Sorting permutations by transpositions. SIAM J. Discrete Math., 11:224-240, 1998.
7. E. Belda, A. Moya, and F. J. Silva. Genome rearrangement distances and gene order phylogeny in γ proteobacteria. Mol. Biol. Evol., 22:1456-1467, 2005.
8. A. Bergeron. A very elementary presentation of the Hannenhalli-Pevzner theory. Lecture Notes in Computer Science, 2089:106-117, 2001.
9. A. Bergeron, J. Mixtacki, and J. Stoye. Reversal distance without hurdles and fortresses. Lecture Notes in Computer Science, 3109:388-399, 2004.
10. G. Bourque, P. A. Pevzner, and G. Tesler. Reconstructing the genomic architecture of ancestral mammals: lessons from human, mouse, and rat genomes. Genome Research, 14:507-516, 2004.
11. G. Bourque, Y. Yacef, and N. El-Mabrouk. Maximizing synteny blocks to identify ancestral homologs. Lecture Notes in Bioinformatics, 3678:21-34, 2005.
12. G. Bourquel, E. M. Zdobnov, P. Bork, P. A. Pevzner, and G. Tesler. Comparative architectures of mammalian and chicken genomes reveal highly variable rates of genomic rearrangements across different lineages. Genome Research, 15:98-110, 2005.
13. X. Chen, J. Zheng, P. Nan Z. Fu, Y. Zhong, S. Lonardi, and T. Jiang. Computing the assignment of orthologous genes via genome rearrangement. Proceedings of Asia Pacific Bioinformatics Conference, pages 363-378, 2005.
14. D. A. Christie. Genome Rearrangement Problems. PhD thesis, University of Glasgow, 1999.
15. A. Christoffels, E. G. L. Koh, J. Chia, S. Brenner, S. Aparicio, and B. Venkatesh. Fugu genome analysis provides evidence for a whole-genome duplication early during the evolution of ray-finned fishes. Mol. Biol. Evol., 21(6):1146-1151, 2004.
16. P. Dehal and J. L. Boore. Two rounds of genome duplication in the ancestral vertebrate genome. PLoS Biology, 3(10):e314, 2005.
17. F. S. Dietrich et al. The Ashbya gossypii Genome as a Tool for Mapping the Ancient Saccharomyces cerevisiae Genome. Science, 304:304-307, 2004.
18. N. El-Mabrouk. Genome Rearrangement by Reversals and Insertions/Deletions of Contiguous Segments. Lecture Notes in Computer Science, 1848:222-234, 2000.
19. N. El-Mabrouk, B. Bryant, and D. Sankoff. Reconstructing the pre-doubling genome. Proceedings of the Third Annual International Conference on Computational Molecular Biology (RECOMB), pages 154-163, 1999.
20. N. El-Mabrouk, J. H. Nadeau, and D. Sankoff. Genome Halving. Lecture Notes in Computer Science, 1448:235-250, 1998.
21. N. El-Mabrouk and D. Sankoff. On the reconstruction of ancient doubled circular genomes. Genome Informatics, 10:83-93, 1999.
22. N. El-Mabrouk and D. Sankoff. The Reconstruction of Doubled Genomes. SIAM Journal on Computing, 32:754-792, 2003.
23. I. Elias and T. Hartman. A 1.375-Approximation Algorithm for Sorting by Transpositions. Lecture Notes in Computer Science, 3692:204-214, 2005.
24. Q. P. Gu, S. Peng, and H. Sudborough. A 2-approximation algorithm for genome rearrangements by reversals and transpositions. Theoret. Comput. Sci., 210:327-339, 1999.
25. R. Guyot and B. Keller. Ancestral genome duplication in rice. Genome, 47:610-614, 2004.
26. S. Hannenhalli and P. Pevzner. Transforming men into mouse (polynomial algorithm for genomic distance problem). Proceedings of the 36th Annual Symposium on Foundations of Computer Science, pages 581-592, 1995.
27. S. Hannenhalli and P. Pevzner. Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals). Journal of the ACM, 46:1-27, 1999.
28. T. Hartman. A simpler 1.5-approximation algorithm for sorting by transpositions. Lecture Notes in Computer Science, 2676:156-169, 2003.
29. T. Hartman and R. Sharan. A 1.5-approximation algorithm for sorting by transpositions and transreversals. Lecture Notes in Computer Science, 3240:50-61, 2004.
30. O. Jaillon et al. Genome duplication in the teleost fish Tetraodon nigroviridis reveals the early vertebrate protokaryotype. Nature, 431:946-957, 2004.
31. H. Kaplan, R. Shamir, and R. Tarjan. Faster and simpler algorithm for sorting signed permutations by reversals. SIAM Journal on Computing, 29:880-892, 1999.
32. H. Kaplan and E. Verbin. Sorting signed permutations by reversals, revisited. J. Comput. Syst. Sci., 70(3):321-341, 2005.
33. M. Kellis, B. W. Birren, and E. S. Lander. Proof and evolutionary analysis of ancient genome duplication in the yeast Saccharomyces cerevisiae. Nature, 428:617-624, 2004.
34. G. H. Lin and G. Xue. Signed genome rearrangements by reversals and transpositions: models and approximations. Theoret. Comput. Sci., 259:513-531, 2001.
35. Y. C. Lin, C. L. Lu, H. Y. Chang, and C. Y. Tang. An Efficient Algorithm for Sorting by Block-Interchanges and Its Application to the Evolution of Vibrio Species. J. Comput. Biol., 12:102-112, 2005.
36. A. Meyer and Y. Van de Peer. From 2R to 3R: evidence for a fish-specific genome duplication (FSGD). Bio Essays, 27(9):937-945, 2005.
37. W. J. Murphy, G. Bourque, G. Tesler, P. Pevzner, and S. J. O'Brien. Reconstructing the genomic architecture of mammalian ancestors using multispecies comparative maps. Human Genomics, 1:30-40, 2003.
38. S. Ohno. Evolution by gene duplication. Springer, Berlin, 1970.
39. M. Ozery-Flato and R. Shamir. Two Notes on Genome Rearrangement. Journal of Bioinformatics and Computational Biology, 1:71-94, 2003.
40. P. Pevzner, H. Tang, and G. Tesler. De Novo Repeat Classification and Fragment Assembly. Genome Research, 14:1786-1796, 2004.
41. P. Pevzner and G. Tesler. Genome Rearrangements in Mammalian Evolution: Lessons from Human and Mouse Genomes. Genome Research, 13:37-45, 2003.
42. P. A. Pevzner. Computational Molecular Biology: An Algorithmic Approach. The MIT Press, Cambridge, 2000.
43. P. A. Pevzner and G. Tesler. Human and mouse genomic sequences reveal extensive breakpoint reuse in mammalian evolution. Proceedings of the National Academy of Sciences, 100:7672-7677, 2003.
44. A. J. Radcliffe, A. D. Scott, and E. L. Wilmer. Reversals and Transpositions Over Finite Alphabets. SIAM J. Discrete Math., 19:224-244, 2005.
45. M. Robinson-Rechavi, O. Marchand, H. Escriva, and V. Laudet. An ancestral whole-genome duplication may not have been responsible for the abundance of duplicated fish genes. Curr Biol., 11(12):458-459, 2001.
46. D. Sankoff. Genome rearrangement with gene families. Bioinformatics, 15:909-917, 1999.
47. K. M. Swenson, M. Marron, J. V. Earnest-De Young, and B. M. E. Moret. Approximating the true evolutionary distance between two genomes. Proc. 7th Workshop on Algorithm Engineering & Experiments (ALENEX), pages 121-129, 2005.
48. K. M. Swenson, N. D. Pattengale, and B. M. E. Moret. A framework for orthology assignment from gene rearrangement data. Lecture Notes in Bioinformatics, 3678:153-166, 2005.
49. E. Tannier and M. F. Sagot. Sorting by reversals in subquadratic time. Lecture Notes in Computer Science, pages 1-13, 2004.
50. G. Tesler. Efficient algorithms for multichromosomal genome rearrangements. J. Comput. Syst. Sci., 65:587-609, 2002.
51. M. E. Walter, Z. Dias, and J. Meidanis. Reversal and transposition distance of linear chromosomes. String Processing and Information Retrieval: A South American Symposium (SPIRE), pages 96-102, 1998.
52. M. E. Walter, L. Reginaldo, A. F. Curado, and A. G. Oliveira. Working on the Problem of Sorting by Transpositions on Genome Rearrangements. Lecture Notes in Computer Science, 2676:372-383, 2003.
53. S. Yancopoulos, O. Attie, and R. Friedberg. Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinformatics, 21:3340-3346, 2005.