VECTOR ALGORITHMS FOR APPROXIMATE STRING MATCHING

DOI10.1142/S0129054102000947zbMath1066.68153DBLPjournals/ijfcs/BergeronH02OpenAlexW2048819748WikidataQ60704269 ScholiaQ60704269MaRDI QIDQ3021938

Anne Bergeron, Sylvie Hamel

Publication date: 22 June 2005

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054102000947

zbMATH Keywords

string matchingcomputational biologyvector algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Formal languages and automata (68Q45) Protein sequences, DNA sequences (92D20)

Related Items (4)

Vectorial languages and linear temporal logic ⋮ From cascade decompositions to bit-vector algorithms. ⋮ Practical algorithms for transposition-invariant string-matching ⋮ BIT-PARALLEL COMPUTATION OF LOCAL SIMILARITY SCORE MATRICES WITH UNITARY WEIGHTS

Cites Work

• A fast bit-vector algorithm for approximate string matching based on dynamic programming
• Algorithms for approximate string matching
• The theory and computation of evolutionary distances: Pattern recognition

This page was built for publication: VECTOR ALGORITHMS FOR APPROXIMATE STRING MATCHING