A Heuristic Algorithm for Reconstructing Ancestral Gene Orders with Duplications

  • Jian Ma
  • Aakrosh Ratan
  • Louxin Zhang
  • Webb Miller
  • David Haussler
Conference paper

DOI: 10.1007/978-3-540-74960-8_10

Volume 4751 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Ma J., Ratan A., Zhang L., Miller W., Haussler D. (2007) A Heuristic Algorithm for Reconstructing Ancestral Gene Orders with Duplications. In: Tesler G., Durand D. (eds) Comparative Genomics. RECOMB-CG 2007. Lecture Notes in Computer Science, vol 4751. Springer, Berlin, Heidelberg

Abstract

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.

Keywords

gene order reconstruction duplication contiguous ancestral region 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Jian Ma
    • 1
  • Aakrosh Ratan
    • 2
  • Louxin Zhang
    • 3
  • Webb Miller
    • 2
  • David Haussler
    • 1
  1. 1.Center for Biomolecular Science and Engineering, University of California, Santa Cruz, CA 95064USA
  2. 2.Center for Comparative Genomics and Bioinformatics, Penn State University, University Park, PA 16802USA
  3. 3.Department of Mathematics, National University of Singapore, 117543Singapore