henhaobio
Sign in

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

PDFDOIPreprint

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.

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.

Similarity Map
SelectedSame fieldCross-field
THISFrith '24Chua '26Kobori '16Wilburn '20Yin '22Frith '19
71% semantic matchBioinformatics
Martin C. Frith·Genome Research·Aug 1, 2024· 8 citations