compleasm: a faster and more accurate reimplementation of BUSCO
Bioinformatics · 03.10.2023 · 39 (10)
DOI: 10.1093/bioinformatics/btad595 ↗Kurz gefasst
Fachartikel in der Zeitschrift Bioinformatics, online erschienen am 27.09.2023. Verfasst von Neng Huang und 1 weiteren Autor:innen. Beteiligte Einrichtung: Department of Data Sciences, Dana-Farber Cancer Institute, Boston, MA 02215, United States. Hauptthemen laut MEDLINE: Genomics, Benchmarking. Die Arbeit wurde bisher 419-mal zitiert (Crossref) und nennt 13 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: NHGRI NIH HHS, National Human Genome Research Institute, Chan-Zuckerberg Initiative.
Abstract (Originalsprache)
Motivation Evaluating the gene completeness is critical to measuring the quality of a genome assembly. An incomplete assembly can lead to errors in gene predictions, annotation, and other downstream analyses. Benchmarking Universal Single-Copy Orthologs (BUSCO) is a widely used tool for assessing the completeness of genome assembly by testing the presence of a set of single-copy orthologs conserved across a wide range of taxa. However, BUSCO is slow particularly for large genome assemblies. It is cumbersome to apply BUSCO to a large number of assemblies. Results Here, we present compleasm, an efficient tool for assessing the completeness of genome assemblies. Compleasm utilizes the miniprot protein-to-genome aligner and the conserved orthologous genes from BUSCO. It is 14 times faster than BUSCO for human assemblies and reports a more accurate completeness of 99.6% than BUSCO’s 95.7%, which is in close agreement with the annotation completeness of 99.5% for T2T-CHM13. Availability and implementation https://github.com/huangnengCSU/compleasm.
Schlagwörter
MeSH-Schlagwörter (MEDLINE)
Autor:innen und Institutionen
- Department of Data Sciences, Dana-Farber Cancer Institute, Boston, MA 02215, United States.
- Department of Biomedical Informatics, Harvard Medical School, Boston, MA 02115, United States.
ORCID-Profile: Neng Huang
Förderung
- NHGRI NIH HHS
- National Human Genome Research Institute
- Chan-Zuckerberg Initiative
Zitieren
APA
Huang, N., & Li, H. (2023). compleasm: a faster and more accurate reimplementation of BUSCO. Bioinformatics, 39(10). https://doi.org/10.1093/bioinformatics/btad595
Vancouver
Huang N, Li H. compleasm: a faster and more accurate reimplementation of BUSCO. Bioinformatics. 2023;39(10). doi:10.1093/bioinformatics/btad595
BibTeX
@article{Huang2023,
author = {Huang, Neng and Li, Heng},
title = {compleasm: a faster and more accurate reimplementation of BUSCO},
journal = {Bioinformatics},
year = {2023},
volume = {39},
number = {10},
doi = {10.1093/bioinformatics/btad595}
}
EUVIMED