Pages that link to "Item:Q4305003"
From MaRDI portal
The following pages link to Approximate string matching using withinword parallelism (Q4305003):
Displayed 5 items.
- Faster approximate string matching for short patterns (Q692899) (← links)
- A fast and practical bit-vector algorithm for the longest common subsequence problem (Q1607132) (← links)
- Bit-parallel approximate string matching algorithms with transposition (Q2569398) (← links)
- New and faster filters for multiple approximate string matching (Q4534215) (← links)
- On-Line Approximate String Searching Algorithms: Survey and Experimental Results (Q4551538) (← links)