VECTOR ALGORITHMS FOR APPROXIMATE STRING MATCHING

DOI10.1142/S0129054102000947MaRDI QIDQ3021938zbMATH OpenOpenAlexDBLPWikidataFDO

Authors 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

computational biologystring matchingvector algorithms

Mathematics Subject Classification ID

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

Recommendations

• A fast bit-vector algorithm for approximate string matching based on dynamic programming
• scientific article; zbMATH DE number 1773073
• Efficient Bit-Parallel Algorithms for (δ,α)-Matching
• Faster approximate string matching
• Multiple approximate string matching

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

Cited in

(8)

• An integer linear programming approach for approximate string comparison
• From cascade decompositions to bit-vector algorithms.
• Vectorial languages and linear temporal logic
• Practical algorithms for transposition-invariant string-matching
• BIT-PARALLEL COMPUTATION OF LOCAL SIMILARITY SCORE MATRICES WITH UNITARY WEIGHTS
• scientific article; zbMATH DE number 1949642 (Why is no real title available?)
• scientific article; zbMATH DE number 1773073 (Why is no real title available?)
• A^*PA2: up to 19 faster exact global alignment

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3021938)