Sequence similarity measures based on bounded Hamming distance
From MaRDI portal
Publication:294940
DOI10.1016/j.tcs.2016.01.023zbMath1344.68306OpenAlexW2292149143MaRDI QIDQ294940
Gad M. Landau, Alberto Apostolico, Cinzia Pizzi, Concettina Guerra
Publication date: 16 June 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.01.023
pattern matchingalignment-free distancesbinary stringlongest common substringmismatchesstring comparison
Related Items (3)
Algorithmic Framework for Approximate Matching Under Bounded Edits with Applications to Sequence Analysis ⋮ A new distributed alignment-free approach to compare whole proteomes ⋮ Fast matching statistics in small space
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Motif discovery by monotone scores
- Scoring unusual words with varying mismatch errors
- \(k\)-difference matching in amortized linear time for all the words in a text
- Fast gapped variants for Lempel-Ziv-Welch compression
- Irredundant tandem motifs
- The Similarity Metric
- A measure of the similarity of sets of sequences not requiring sequence alignment.
- A Measure of DNA Sequence Dissimilarity Based on Mahalanobis Distance between Frequencies of Words
This page was built for publication: Sequence similarity measures based on bounded Hamming distance
