Approximate string matching using withinword parallelism

DOI10.1002/SPE.4380240402MaRDI QIDQ4305003zbMATH OpenOpenAlexFDO

Authors 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 algorithmparallel computationedit distanceapproximate string matchingapproximate string searchingpseudo-parallelism

Mathematics Subject Classification ID

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

Cited in

(7)

• Multiple approximate string matching
• A unified view to string matching algorithms
• 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
• On-Line Approximate String Searching Algorithms: Survey and Experimental Results
• New and faster filters for multiple approximate string matching

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

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