InParanoid-DIAMOND: faster orthology analysis with the InParanoid algorithm.
basic_science · Level V
Where this comes from
- Record sourced from PubMed, PMID 35561192.
- Also identified by DOI 10.1093/bioinformatics/btac194 and PMC identifier 9113356.
- No licence information is recorded for this record.
- Because redistribution is not established, this page shows the abstract only. Follow the links below for the full text.
Abstract
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. The source code is available at (https://bitbucket.org/sonnhammergroup/inparanoid). Supplementary data are available at Bioinformatics online.
Medical subject headings
- Algorithms
- Software