Pages that link to "Item:Q1277393"
From MaRDI portal
The following pages link to Faster approximate string matching (Q1277393):
Displaying 17 items.
- Very fast and simple approximate string matching (Q294703) (← links)
- A new filtration method and a hybrid strategy for approximate string matching (Q385045) (← links)
- Matching regular expressions on uncertain data (Q832529) (← links)
- Multiple serial episodes matching (Q844201) (← links)
- Practical and flexible pattern matching over Ziv-Lempel compressed text. (Q878012) (← links)
- Improving the bit-parallel NFA of Baeza-Yates and Navarro for approximate string matching (Q975479) (← links)
- Approximate string matching on Ziv--Lempel compressed text (Q1827277) (← links)
- Fast and practical approximate string matching (Q1847363) (← links)
- Finding approximate palindromes in strings (Q1860243) (← links)
- Index structures for fast similarity search for symbol strings (Q2287426) (← links)
- Fast and compact regular expression matching (Q2378530) (← links)
- Indexing text with approximate \(q\)-grams (Q2569395) (← links)
- Bit-parallel (\(\delta ,\gamma\))-matching and suffix automata (Q2569397) (← links)
- Bit-parallel approximate string matching algorithms with transposition (Q2569398) (← links)
- NR‐grep: a fast and flexible pattern‐matching tool (Q2785069) (← links)
- Run-Length Encoded Nondeterministic KMP and Suffix Automata (Q2947413) (← links)
- Fast Approximate Search in Large Dictionaries (Q3225420) (← links)
