Metraipolis › archive › dc_01928eba3936
OperonSEQer: A set of machine-learning algorithms with threshold voting for detection of operon pairs using short-read RNA-sequencing data — Europe PMC PMID:34986143
- Source
- Europe PMC (en)
- Original
- https://europepmc.org/article/MED/34986143
- DOI
- 10.1371/journal.pcbi.1009731
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-31T17:11:42.828Z
- SHA-256 of the archived text
4265e796076459cc1cd3cf0aa344e5bc4408b4601f7fb08b2686557b12fabe2c- Stable URL of this page
https://metraipolis.com/documento/dc_01928eba3936
How to cite
OperonSEQer: A set of machine-learning algorithms with threshold voting for detection of operon pairs using short-read RNA-sequencing data — Europe PMC PMID:34986143 — Europe PMC (en), https://europepmc.org/article/MED/34986143 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_01928eba3936 (Metraipolis archive dc_01928eba3936, sha256 4265e796076459cc1cd3cf0aa344e5bc4408b4601f7fb08b2686557b12fabe2c)
BibTeX
@misc{dc01928eba3936,
title = {OperonSEQer: A set of machine-learning algorithms with threshold voting for detection of operon pairs using short-read RNA-sequencing data — Europe PMC PMID:34986143},
howpublished = {Europe PMC (en)},
url = {https://europepmc.org/article/MED/34986143},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_01928eba3936; sha256 4265e796076459cc1cd3cf0aa344e5bc4408b4601f7fb08b2686557b12fabe2c},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: Europe PMC (en), https://europepmc.org/article/MED/34986143. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Operon prediction in prokaryotes is critical not only for understanding the regulation of endogenous gene expression, but also for exogenous targeting of genes using newly developed tools such as CRISPR-based gene modulation. A number of methods have used transcriptomics data to predict operons, based on the premise that contiguous genes in an operon will be expressed at similar levels. While promising results have been observed using these methods, most of them do not address uncertainty caused by technical variability between experiments, which is especially relevant when the amount of data available is small. In addition, many existing methods do not provide the flexibility to determine the stringency with which genes should be evaluated for being in an operon pair. We present OperonSEQer, a set of machine learning algorithms that uses the statistic and p-value from a non-parametric analysis of variance test (Kruskal-Wallis) to determine the likelihood that two adjacent genes are expressed from the same RNA molecule. We implement a voting system to allow users to choose the stringency of operon calls depending on whether your priority is high recall or high specificity. In addition, we provide the code so that users can retrain the algorithm and re-establish hyperparameters based on any data they choose, allowing for this method to be expanded as additional data is generated. We show that our approach detects operon pairs that are missed by current methods by comparing our predictions to publicly available long-read sequencing data. OperonSEQer therefore improves on existing methods in terms of accuracy, flexibility, and adaptability. Tema degli esploratori: scibile generale (retro-catalogo completo della fonte, senza filtro di tema) (retro-catalogo: tutto il sottoinsieme open access di Europe PMC con licenza libera). Pubblicazione: PLoS computational biology, 2022 (prima pubblicazione 2022-01-05). Identificativi: PMID 34986143 · PMCID PMC8765615 · DOI 10.1371/journal.pcbi.1009731. Descrittori MeSH principali: Algorithms; Machine Learning. Pagina: https://europepmc.org/article/MED/34986143 — https://doi.org/10.1371/journal.pcbi.1009731. Autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza dell'articolo dichiarata da Europe PMC: CC0 (la versione è indicata dall'editore sulla pagina). Abstract riportato senza modifiche al contenuto, con attribuzione; deposito marcato CC0. Letto il 2026-10-31T17:02:46.522Z tramite l'API REST ufficiale di Europe PMC (EMBL-EBI), nel rispetto del robots.txt e del crawl-delay.