Pages that link to "Item:Q1907030"
From MaRDI portal
The following pages link to A subquadratic algorithm for approximate limited expression matching (Q1907030):
Displayed 9 items.
- Improving the bit-parallel NFA of Baeza-Yates and Navarro for approximate string matching (Q975479) (← links)
- A sublinear algorithm for approximate keyword searching (Q1336965) (← links)
- Improved approximate pattern matching on hypertext (Q1566744) (← links)
- A fast and practical bit-vector algorithm for the longest common subsequence problem (Q1607132) (← links)
- Fast and practical approximate string matching (Q1847363) (← links)
- Approximate Boyer-Moore string matching for small alphabets (Q1957645) (← links)
- BIT-PARALLEL COMPUTATION OF LOCAL SIMILARITY SCORE MATRICES WITH UNITARY WEIGHTS (Q3421848) (← links)
- New and faster filters for multiple approximate string matching (Q4534215) (← links)
- On-Line Approximate String Searching Algorithms: Survey and Experimental Results (Q4551538) (← links)