Background: Taxonomic classification of reads obtained by metagenomic sequencing is often a first step for understanding a microbial community, but correctly assigning sequencing reads to the strain or sub-species level has remained a challenging computational problem.
Results: We introduce Mora, a MetagenOmic read Re-Assignment algorithm capable of assigning short and long metagenomic reads with high precision, even at the strain level. Mora is able to accurately re-assign reads by first estimating abundances through an expectation-maximization algorithm and then utilizing abundance information to re-assign query reads. The key idea behind Mora is to maximize read re-assignment qualities while simultaneously minimizing the difference from estimated abundance levels, allowing Mora to avoid over assigning reads to the same genomes. On simulated diverse reads, this allows Mora to achieve F1 scores comparable to other algorithms while having less runtime. However, Mora significantly outshines other algorithms on very similar reads. We show that the high penalty of over assigning reads to a common reference genome allows Mora to accurately infer correct strains for real data in the form of E. coli reads.
Conclusions: Mora is a fast and accurate read re-assignment algorithm that is modularized, allowing it to be incorporated into general metagenomics and genomics workflows. It is freely available at https://github.com/AfZheng126/MORA .
Download full-text PDF |
Source |
---|---|
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC11035124 | PMC |
http://dx.doi.org/10.1186/s12859-024-05768-9 | DOI Listing |
BMC Bioinformatics
April 2024
Mathematics, University of Toronto, 27 King's College Circle, Toronto, Ontario, M3R 0A3, Canada.
Background: Taxonomic classification of reads obtained by metagenomic sequencing is often a first step for understanding a microbial community, but correctly assigning sequencing reads to the strain or sub-species level has remained a challenging computational problem.
Results: We introduce Mora, a MetagenOmic read Re-Assignment algorithm capable of assigning short and long metagenomic reads with high precision, even at the strain level. Mora is able to accurately re-assign reads by first estimating abundances through an expectation-maximization algorithm and then utilizing abundance information to re-assign query reads.
Surgery
December 2023
Department of Surgery, University of South Florida Morsani College of Medicine, Tampa, FL. Electronic address:
Background: The volume of robotic lung resection continues to increase despite its higher costs and unproven superiority to video-assisted thoracoscopic surgery. We evaluated whether machine learning can accurately identify factors influencing cost and reclassify high-cost operative approaches into lower-cost alternatives.
Methods: The Florida Agency for Healthcare Administration and Centers for Medicare and Medicaid Services Hospital and Physician Compare datasets were queried for patients undergoing open, video-assisted thoracoscopic surgery and robotic lobectomy.
Cogn Neurodyn
June 2015
Department of Psychological and Brain Sciences, Indiana University, 1101 E. 10th St., Bloomington, IN 47405 USA.
The binding problem-question of how information between the modules of the linguistic system is integrated during language processing-is as yet unresolved. The remarkable speed of language processing and comprehension (Pulvermüller et al. 2009) suggests that at least coarse semantic information (e.
View Article and Find Full Text PDFEnter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!