A simple algorithm to infer gene duplication and speciation events on a gene tree.

Area of Science:

• Bioinformatics
• Computational Biology
• Genomics

Background:

• Orthologous sequences, diverging by speciation, are better functional predictors than paralogous sequences, which arise from gene duplication and enable functional diversification.
• Phylogenomics, utilizing phylogenetic information for high-throughput genome annotation, is valuable but often relies on manual or indirect methods.
• Automating phylogenomics requires explicit phylogenetic inference, necessitating algorithms to distinguish speciation from duplication events in gene trees.

Purpose of the Study:

• To develop and present an automated algorithm for inferring speciation and duplication events within a gene tree.
• To enable more reliable functional predictions of proteins by accurately distinguishing orthologs from paralogs.

Main Methods:

• An algorithm was developed to infer speciation and duplication events by comparing a gene tree to a trusted species tree.
• The algorithm's performance was evaluated empirically using 1750 gene trees from the Pfam protein family database.

Main Results:

• The developed algorithm has a worst-case running time of O(n(2)), which is less efficient than some existing O(n) algorithms.
• Empirical testing on real gene trees demonstrated the algorithm's practicality and often superior performance compared to existing methods, especially on non-pathological datasets.
• The algorithm's simplicity is a key advantage for practical application.

Conclusions:

• The presented algorithm offers a practical and effective approach to automate phylogenomics by inferring gene duplication and speciation events.
• This method aids in distinguishing orthologous from paralogous sequences, leading to more accurate protein function prediction.