Approximate string matching using withinword parallelism

DOI10.1002/spe.4380240402zbMath0942.68787OpenAlexW2075760092MaRDI QIDQ4305003

Alden H. Wright

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

zbMATH Keywords

dynamic programmingparallel computationparallel algorithmapproximate string matchingedit distanceapproximate string searchingpseudo-parallelism

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05) Dynamic programming (90C39) Parallel algorithms in computer science (68W10)

Related Items (6)

New and faster filters for multiple approximate string matching ⋮ On-Line Approximate String Searching Algorithms: Survey and Experimental Results ⋮ Multiple approximate string matching ⋮ Faster approximate string matching for short patterns ⋮ Bit-parallel approximate string matching algorithms with transposition ⋮ A fast and practical bit-vector algorithm for the longest common subsequence problem

This page was built for publication: Approximate string matching using withinword parallelism