Journal of Computational BiologyBioinformaticsPeer-reviewed journal article
Simple and thorough detection of related sequences with position-varying probabilities of substitutions, insertions, and deletions
Martin C. FrithiD, Patrick BoppertiD, Patrick StylliD, Milot MirditaiD
Abstract
One way to understand biology is by finding genetic sequences that are related to each other. Often, a family of related sequences has position-varying probabilities of substitutions, insertions, and deletions: we can use these to find distantly-related sequences. There are popular software tools for this task, which all have limitations. They either do not use all probability evidence (e.g. PSI-BLAST, MMseqs2), or have excessive complexity and minor biases (e.g. HMMER). This complexity inhibits fertile development of alternative tools. This study describes a simplest reasonable way to find related sequences, making full use of position-varying probabilities. The algorithms likely use the fewest operations that such algorithms possibly could, so they are fast and simple. This has been implemented in prototype software named DUMMER (Dumb Uncomplicated Match ModelER). Its sensitivity and specificity are competitive with HMMER. It finds evidence that the human genome has vastly more relics of LF-SINE, retrotransposons that were co-opted for various functions in common ancestors of all land vertebrates.
- organism: human
- assay: DNA methylation
- assay: whole-genome sequencing
- research focus: differential expression
- research focus: gene regulatory network inference
- research focus: database / resource
- research focus: software / tool
- approach: statistical model
- Citations
- 0
- FWCI
- 0.00
- Field percentile
- 15th percentile
Reproducibility ledger
Nobody has reported trying to reproduce this paper yet. Did you replicate an experiment or run the code? Your report saves the next lab a week.
Sign in to file a reproducibility report.
Related papers
- A simple theory for finding related sequences by adding probabilities of alternative alignments
Martin C. Frith·Genome ResearchPeer-reviewed·Aug 1, 2024
- DUMMEST: A simpler and faster model for frameshift-aware alignment of a DNA sequence to a protein family
Harvey Shawn Chua, Anish Man Singh Shrestha·bioRxiv·Oct 15, 2026
- Similarity Estimation Between DNA Sequences Based on Local Pattern Histograms of Binary Images
Yusei Kobori, Satoshi Mizuta·Genomics, Proteomics & BioinformaticsPeer-reviewed·Apr 27, 2016
- Remote homology search with hidden Potts models
Grey W. Wilburn, Sean R. Eddy·PLoS Computational BiologyPeer-reviewed·Nov 30, 2020
- Improved DNA-versus-Protein Homology Search for Protein Fossils
Yao Yin, Martin C. Frith·IEEE Transactions on Computational Biology and BioinformaticsPeer-reviewed·May 26, 2022
- How sequence alignment scores correspond to probability models
Martin C. Frith·BioinformaticsPeer-reviewed·Jul 19, 2019