Genome ResearchBioinformaticsPeer-reviewed journal article
A simple theory for finding related sequences by adding probabilities of alternative alignments
Abstract
The main way of analyzing genetic sequences is by finding sequence regions that are related to each other. There are many methods to do that, usually based on this idea: find an alignment of two sequence regions, which would be unlikely to exist between unrelated sequences. Unfortunately, it is hard to tell if an alignment is likely to exist by chance. Also, the precise alignment of related regions is uncertain. One alignment does not hold all evidence that they are related. We should consider alternative alignments too. This is rarely done, because we lack a simple and fast method that fits easily into practical sequence-search software. Here is described a simplest-possible change to standard sequence alignment, which sums probabilities of alternative alignments. Remarkably, this makes it easier to tell if a similarity is likely to occur by chance. This approach is better than standard alignment at finding distant relationships, at least in a few tests. It can be used in practical sequence-search software, with minimal increase in implementation difficulty or run time. It generalizes to different kinds of alignment, e.g. DNA-versus-protein with frameshifts. Thus, it can widely contribute to finding subtle relationships between sequences.
- assay: DNA methylation
- assay: whole-genome sequencing
- research focus: sequence-to-function modeling
- approach: statistical model
- Citations
- 8
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
- Simple and thorough detection of related sequences with position-varying probabilities of substitutions, insertions, and deletions
Martin C. Frith, Patrick Boppert, … Milot Mirdita·Journal of Computational BiologyPeer-reviewed·Mar 25, 2026
- Alignment of multiple protein sequences without using amino acid frequencies.
Veronika Shelyekhova, Roman E. Shirokov·bioRxiv·Jun 5, 2024
- Similarity Estimation Between DNA Sequences Based on Local Pattern Histograms of Binary Images
Yusei Kobori, Satoshi Mizuta·Genomics, Proteomics & BioinformaticsPeer-reviewed·Apr 27, 2016
- Exact global alignment using A* with chaining seed heuristic and match pruning
Ragnar Groot Koerkamp, Pesho Ivanov·BioinformaticsPeer-reviewed·Jan 20, 2024
- Sequence Comparison without Alignment: The SpaM approaches
Burkhard Morgenstern·bioRxiv·Dec 16, 2019
- Improving protein alignment algorithms using amino-acid hydrophobicities - Applications of TMATCH, A new algorithm
David P. Cavanaugh, Krishnan K. Chittur·bioRxiv·Jan 1, 2020