A Heuristic Algorithm for Reconstructing Ancestral Gene Orders with Duplications

Accurately reconstructing the large-scale gene order in an ancestral genome is a critical step to better understand genome evolution. In this paper, we propose a heuristic algorithm for reconstructing ancestral genomic orders with duplications. The method starts from the order of genes in modern genomes and predicts predecessor and successor relationships in the ancestor. Then a greedy algorithm is used to reconstruct the ancestral orders by connecting genes into contiguous regions based on predicted adjacencies. Computer simulation was used to validate the algorithm. We also applied the method to reconstruct the ancestral genomes of ciliate Paramecium tetraurelia.

[1]  Nicoletta Archidiacono,et al.  Ancestral genomes reconstruction: an integrated, multi-disciplinary approach is needed. , 2006, Genome research.

[2]  Dannie Durand,et al.  NOTUNG: A Program for Dating Gene Duplications and Optimizing Gene Family Trees , 2000, J. Comput. Biol..

[3]  Oliver Eulenstein,et al.  Heuristics for the Gene-Duplication Problem: A Theta ( n ) Speed-Up for the Local Search , 2007, RECOMB.

[4]  D. Sankoff,et al.  Duplication, Rearrangement, and Reconciliation , 2000 .

[5]  Fengtang Yang,et al.  Are molecular cytogenetics and bioinformatics suggesting diverging models of ancestral mammalian genomes? , 2006, Genome research.

[6]  R. Guigó,et al.  Global trends of whole-genome duplications revealed by the ciliate Paramecium tetraurelia , 2006, Nature.

[7]  Krister M. Swenson,et al.  Genomic Distances under Deletions and Insertions , 2004, Theor. Comput. Sci..

[8]  David Sankoff,et al.  Multiple Genome Rearrangement and Breakpoint Phylogeny , 1998, J. Comput. Biol..

[9]  James F. Gimpel,et al.  Covering Points of a Digraph with Point-Disjoint Paths and Its Application to Code Optimization , 1977, JACM.

[10]  K. H. Wolfe,et al.  Extent of genomic rearrangement after genome duplication in yeast. , 1998, Proceedings of the National Academy of Sciences of the United States of America.

[11]  Temple F. Smith,et al.  Reconstruction of ancient molecular phylogeny. , 1996, Molecular phylogenetics and evolution.

[12]  Bernard B. Suh,et al.  Reconstructing contiguous regions of an ancestral genome. , 2006, Genome research.

[13]  R. Page,et al.  From gene to organismal phylogeny: reconciled trees and the gene tree/species tree problem. , 1997, Molecular phylogenetics and evolution.

[14]  D. Sankoff,et al.  Comparative Genomics: "Empirical And Analytical Approaches To Gene Order Dynamics, Map Alignment And The Evolution Of Gene Families" , 2000 .

[15]  P. Pevzner,et al.  Genome-scale evolution: reconstructing gene orders in the ancestral species. , 2002, Genome research.

[16]  E. Eichler,et al.  Structural Dynamics of Eukaryotic Chromosome Evolution , 2003, Science.

[17]  J. G. Burleigh,et al.  Heuristics for the Gene-duplication Problem : A Θ ( n ) Speed-up for the Local Search , 2007 .

[18]  G. Moore,et al.  Fitting the gene lineage into its species lineage , 1979 .

[19]  David Sankoff,et al.  The Reconstruction of Doubled Genomes , 2003, SIAM J. Comput..

[20]  Ron Shamir,et al.  The median problems for breakpoints are NP-complete , 1998, Electron. Colloquium Comput. Complex..

[21]  David Sankoff,et al.  Genome rearrangement with gene families , 1999, Bioinform..

[22]  P. Pevzner,et al.  The convergence of cytogenetics and rearrangement-based models for ancestral genome reconstruction. , 2006, Genome research.

[23]  W. Fitch.  Toward Defining the Course of Evolution: Minimum Change for a Specific Tree Topology , 1971 .

[24]  David A. Bader,et al.  A New Implmentation and Detailed Study of Breakpoint Analysis , 2000, Pacific Symposium on Biocomputing.

[25]  David Sankoff,et al.  Genome Halving with an Outgroup , 2006 .

[26]  Pavel A. Pevzner,et al.  Whole Genome Duplications and Contracted Breakpoint Graphs , 2007, SIAM J. Comput..

[27]  Alberto Caprara,et al.  Formulations and hardness of multiple sorting by reversals , 1999, RECOMB.