Chapter

Comparative Genomics

Volume 4751 of the series Lecture Notes in Computer Science pp 122-135

A Heuristic Algorithm for Reconstructing Ancestral Gene Orders with Duplications

  • Jian MaAffiliated withCenter for Biomolecular Science and Engineering, University of California, Santa Cruz, CA 95064
  • , Aakrosh RatanAffiliated withCenter for Comparative Genomics and Bioinformatics, Penn State University, University Park, PA 16802
  • , Louxin ZhangAffiliated withDepartment of Mathematics, National University of Singapore, 117543
  • , Webb MillerAffiliated withCenter for Comparative Genomics and Bioinformatics, Penn State University, University Park, PA 16802
  • , David HausslerAffiliated withCenter for Biomolecular Science and Engineering, University of California, Santa Cruz, CA 95064

* Final gross prices may vary according to local VAT.

Get Access

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