Approximate string matching using withinword parallelism
From MaRDI portal
Publication:4305003
DOI10.1002/spe.4380240402zbMath0942.68787MaRDI QIDQ4305003
Publication date: 2 August 2000
Published in: Software: Practice and Experience (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/spe.4380240402
dynamic programming; parallel computation; parallel algorithm; approximate string matching; edit distance; approximate string searching; pseudo-parallelism
68P10: Searching and sorting
68W05: Nonnumerical algorithms
90C39: Dynamic programming
68W10: Parallel algorithms in computer science
Related Items
New and faster filters for multiple approximate string matching, On-Line Approximate String Searching Algorithms: Survey and Experimental Results, Faster approximate string matching for short patterns, A fast and practical bit-vector algorithm for the longest common subsequence problem, Bit-parallel approximate string matching algorithms with transposition