Ontology highlight
ABSTRACT: Summary
Predicting orthologs, genes in different species having shared ancestry, is an important task in bioinformatics. Orthology prediction tools are required to make accurate and fast predictions, in order to analyze large amounts of data within a feasible time frame. InParanoid is a well-known algorithm for orthology analysis, shown to perform well in benchmarks, but having the major limitation of long runtimes on large datasets. Here, we present an update to the InParanoid algorithm that can use the faster tool DIAMOND instead of BLAST for the homolog search step. We show that it reduces the runtime by 94%, while still obtaining similar performance in the Quest for Orthologs benchmark.Availability and implementation
The source code is available at (https://bitbucket.org/sonnhammergroup/inparanoid).Supplementary information
Supplementary data are available at Bioinformatics online.
SUBMITTER: Persson E
PROVIDER: S-EPMC9113356 | biostudies-literature | 2022 May
REPOSITORIES: biostudies-literature
Persson Emma E Sonnhammer Erik L L ELL
Bioinformatics (Oxford, England) 20220501 10
<h4>Summary</h4>Predicting orthologs, genes in different species having shared ancestry, is an important task in bioinformatics. Orthology prediction tools are required to make accurate and fast predictions, in order to analyze large amounts of data within a feasible time frame. InParanoid is a well-known algorithm for orthology analysis, shown to perform well in benchmarks, but having the major limitation of long runtimes on large datasets. Here, we present an update to the InParanoid algorithm ...[more]