BIT-PARALLEL COMPUTATION OF LOCAL SIMILARITY SCORE MATRICES WITH UNITARY WEIGHTS
From MaRDI portal
Publication:3421848
DOI10.1142/S0129054106004443zbMath1169.68383MaRDI QIDQ3421848
Publication date: 8 February 2007
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Cites Work
- A faster algorithm computing string edit distances
- Bit-parallel witnesses and their applications to approximate string matching
- A subquadratic algorithm for approximate limited expression matching
- VECTOR ALGORITHMS FOR APPROXIMATE STRING MATCHING
- A fast bit-vector algorithm for approximate string matching based on dynamic programming
- Algorithms on Strings, Trees and Sequences
This page was built for publication: BIT-PARALLEL COMPUTATION OF LOCAL SIMILARITY SCORE MATRICES WITH UNITARY WEIGHTS