BIT-PARALLEL COMPUTATION OF LOCAL SIMILARITY SCORE MATRICES WITH UNITARY WEIGHTS

DOI10.1142/S0129054106004443MaRDI QIDQ3421848zbMATH OpenFDO

Authors Heikki Hyyrö, Gonzalo Navarro

Publication date 8 February 2007

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

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

zbMATH Keywords

approximate string matchingbit-parallelismlocal similarity

Mathematics Subject Classification ID

Searching and sorting (68P10) Pattern recognition, speech recognition (68T10)

Recommendations

• Parallel algorithms with local Fourier basis
• Public Key Cryptography - PKC 2005
• A time-efficient, linar-space local similarity algorithm
• Publication:4870332

Cites work

• A fast bit-vector algorithm for approximate string matching based on dynamic programming
• A faster algorithm computing string edit distances
• A subquadratic algorithm for approximate limited expression matching
• Algorithms on Strings, Trees and Sequences
• Bit-parallel witnesses and their applications to approximate string matching
• VECTOR ALGORITHMS FOR APPROXIMATE STRING MATCHING

Cited in

(2)

• scientific article; zbMATH DE number 1945174 (Why is no real title available?)
• A bit-parallel, general integer-scoring sequence alignment algorithm

This page was built for publication: BIT-PARALLEL COMPUTATION OF LOCAL SIMILARITY SCORE MATRICES WITH UNITARY WEIGHTS

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