A Heuristic Algorithm for Reconstructing Ancestral Gene Orders with Duplications
- 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
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.
Keywordsgene order reconstruction duplication contiguous ancestral region
Unable to display preview. Download preview PDF.