Abstract

BackgroundOMA is a project that aims to identify orthologs within publicly available, complete genomes. With 657 genomes analyzed to date, OMA is one of the largest projects of its kind.ResultsThe algorithm of OMA improves upon standard bidirectional best-hit approach in several respects: it uses evolutionary distances instead of scores, considers distance inference uncertainty, includes many-to-many orthologous relations, and accounts for differential gene losses. Herein, we describe in detail the algorithm for inference of orthology and provide the rationale for parameter selection through multiple tests.ConclusionOMA contains several novel improvement ideas for orthology inference and provides a unique dataset of large-scale orthology assignments.

Highlights

  • OMA is a project that aims to identify orthologs within publicly available, complete genomes

  • Homologs can be divided into several classes [1]: orthologs, which originate from a speciation event; paralogs, which originate from gene duplication; and xenologs, which originate from horizontal gene transfer

  • A substantial reduction occurs with the classification of stable pairs from candidate pairs and serves to reduce the complexity of the verification step

Read more

Summary

Introduction

OMA is a project that aims to identify orthologs within publicly available, complete genomes. The classification of genes according to evolutionary relations is essential for many aspects of comparative and functional genomics. Two genes that share a common ancestor are defined as homologs, while genes that are similar in sequence without a common origin are termed analogs. Homologs can be divided into several classes [1]: orthologs, which originate from a speciation event; paralogs, which originate from gene duplication; and xenologs, which originate from horizontal gene transfer. Evolutionary relations can be defined with respect to a third gene. In-paralogs are genes that diverged by a duplication that occurred after a speciation event of reference. Outparalogs are paralogs that diverged before a particular speciation event of reference

Methods
Results
Conclusion
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.