论文信息 - Recovery of Ancestral Tetraploids

Recovery of Ancestral Tetraploids

Methods to recover an ancestral pre-duplicated genome giving rise to a minimal number of genomic rearrangements. Rearrangement operations considered are reversals and translocations. We obtain exact algorithms running in polynomial time.

N. El-Mabrouk

[1] Pavel A. Pevzner,et al. Transforming men into mice (polynomial algorithm for genomic distance problem) , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[2] Pavel A. Pevzner,et al. Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals , 1995, JACM.

[3] Sridhar Hannenhalli,et al. Polynomial-time Algorithm for Computing Translocation Distance Between Genomes , 1995, Discret. Appl. Math..

[4] João Meidanis,et al. Introduction to computational molecular biology , 1997 .

[5] K. H. Wolfe,et al. Molecular evidence for an ancient duplication of the entire yeast genome , 1997, Nature.

[6] D. Sankoff,et al. Genome Halving , 1998, CPM.

[7] T. Takagi,et al. Genome Informatics 1999 , 1999 .

[8] El-Mabrouk,et al. On the Reconstruction of Ancient Doubled Circular Genomes Using Minimum Reversals. , 1999, Genome informatics. Workshop on Genome Informatics.

[9] David Sankoff,et al. Reconstructing the pre-doubling genome , 1999, RECOMB.