Pages that link to "Item:Q1277393"
From MaRDI portal
The following pages link to Faster approximate string matching (Q1277393):
Displaying 44 items.
- Very fast and simple approximate string matching (Q294703) (← links)
- A new filtration method and a hybrid strategy for approximate string matching (Q385045) (← links)
- A practical semi-external memory method for approximate pattern matching (Q529654) (← links)
- Faster approximate string matching for short patterns (Q692899) (← links)
- Matching regular expressions on uncertain data (Q832529) (← links)
- Multiple serial episodes matching (Q844201) (← links)
- A programmable array processor architecture for flexible approximate string matching algorithms (Q866747) (← 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)
- Fast string matching with k differences (Q1109574) (← links)
- Approximate matching of regular expressions (Q1119025) (← links)
- An approximate string-matching algorithm (Q1190457) (← links)
- A faster quick search algorithm (Q1736618) (← 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)
- Efficient online string matching based on characters distance text sampling (Q2205639) (← links)
- Index structures for fast similarity search for symbol strings (Q2287426) (← links)
- Fast and compact regular expression matching (Q2378530) (← links)
- Efficient generation of super condensed neighborhoods (Q2466013) (← links)
- Fast string matching by using probabilities: on an optimal mismatch variant of Horspool's algorithm (Q2503305) (← 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)
- Extracting approximate patterns (Q2569404) (← links)
- Approximate search of short patterns with high error rates using the \(01^\ast 0\) lossless seeds (Q2628801) (← links)
- Optimal spaced seeds for faster approximate string matching (Q2643727) (← links)
- On-line string matching algorithms: survey and experimental results (Q2720122) (← links)
- NR-grep: A fast and flexible pattern-matching tool (Q2785069) (← links)
- Run-Length Encoded Nondeterministic KMP and Suffix Automata (Q2947413) (← links)
- VECTOR ALGORITHMS FOR APPROXIMATE STRING MATCHING (Q3021938) (← links)
- Approximate String Matching: A Simpler Faster Algorithm (Q3149893) (← links)
- A fast bit-vector algorithm for approximate string matching based on dynamic programming (Q3158541) (← links)
- Fast Approximate Search in Large Dictionaries (Q3225420) (← links)
- New and faster filters for multiple approximate string matching (Q4534215) (← links)
- On-Line Approximate String Searching Algorithms: Survey and Experimental Results (Q4551538) (← links)
- Boosting the Quality of Approximate String Matching by Synonyms (Q5012537) (← links)
- Multiple approximate string matching (Q5096936) (← links)
- Faster Online Elastic Degenerate String Matching (Q5140772) (← links)
- Combinatorial Pattern Matching (Q5315353) (← links)
- SOFSEM 2005: Theory and Practice of Computer Science (Q5711555) (← links)
- A randomized algorithm for approximate string matching (Q5930159) (← links)
- Improving an algorithm for approximate pattern matching (Q5940613) (← links)
- Fast approximate dictionary matching (Q6487972) (← links)
