The following pages link to Efficient string matching (Q4055184):
Displaying 50 items.
- The shortest path problem with forbidden paths (Q146692) (← links)
- Automata and forbidden words (Q293331) (← links)
- Compression of finite-state automata through failure transitions (Q300258) (← links)
- Giant complete automaton for uncertain multiple string matching and its high speed construction algorithm (Q350914) (← links)
- Sparse approaches for the exact distribution of patterns in long state sequences generated by a Markov source (Q384993) (← links)
- Efficient seed computation revisited (Q390905) (← links)
- A survey on tree matching and XML retrieval (Q394973) (← links)
- A graph-theoretic model to solve the approximate string matching problem allowing for translocations (Q396701) (← links)
- Motif matching using gapped patterns (Q401471) (← links)
- On the bit-parallel simulation of the nondeterministic Aho-Corasick and suffix automata for a set of patterns (Q414441) (← links)
- Optimizing restriction site placement for synthetic genomes (Q418177) (← links)
- Parameterized longest previous factor (Q441845) (← links)
- String matching with variable length gaps (Q442239) (← links)
- Number of holes in unavoidable sets of partial words. II. (Q450549) (← links)
- Worst-case efficient single and multiple string matching on packed texts in the word-RAM model (Q450552) (← links)
- Asynchronous trace-matching automata (Q466372) (← links)
- Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion (Q489728) (← links)
- A space-efficient alphabet-independent Four-Russians' lookup table and a multithreaded Four-Russians' edit distance algorithm (Q507395) (← links)
- 2D Lyndon words and applications (Q513297) (← links)
- A grouping approach for succinct dynamic dictionary matching (Q513298) (← links)
- Fast searching in packed strings (Q533408) (← links)
- An index-split Bloom filter for deep packet inspection (Q543154) (← links)
- La reconnaissance des facteurs d'un mot dans un texte (Q580994) (← links)
- The submatrices character count problem: An efficient solution using separable values (Q598188) (← links)
- On the complexity of deciding avoidability of sets of partial words (Q606993) (← links)
- BLIM: A new bit-parallel pattern matching algorithm overcoming computer word size limitation (Q626897) (← links)
- Verifying and enumerating parameterized border arrays (Q650937) (← links)
- Multiple matching of parameterized patterns (Q672748) (← links)
- A sheaf-theoretic approach to pattern matching and related problems (Q685382) (← links)
- On the complexity of learning strings and sequences (Q688167) (← links)
- Approximate string matching with suffix automata (Q689099) (← links)
- Unavoidable sets of partial words (Q733729) (← links)
- Distributions of pattern statistics in sparse Markov models (Q778872) (← links)
- Construction of Aho Corasick automaton in linear time for integer alphabets (Q844159) (← links)
- Efficient parameterized string matching (Q845838) (← links)
- A general compression algorithm that supports fast searching (Q845872) (← links)
- From searching text to querying XML streams (Q876703) (← links)
- A linear-time algorithm for finding approximate shortest common superstrings (Q911299) (← links)
- Searching for a set of correlated patterns (Q924555) (← links)
- Fast profile matching algorithms - A survey (Q932308) (← links)
- Multiple pattern matching: a Markov chain approach (Q938109) (← links)
- An aggressive algorithm for multiple string matching (Q987821) (← links)
- A new taxonomy of sublinear right-to-left scanning keyword pattern matching algorithms (Q988198) (← links)
- Thread allocation in CMP-based multithreaded network processors (Q991084) (← links)
- A faster algorithm for matching a set of patterns with variable length don't cares (Q991757) (← links)
- Testing avoidability on sets of partial words is hard (Q1006080) (← links)
- Average-optimal string matching (Q1044048) (← links)
- Two-dimensional pattern matching by two-dimensional on-line tessellation acceptors (Q1054480) (← links)
- An \(O(| T| ^ 3)\) algorithm for testing the Church-Rosser property of Thue systems (Q1057263) (← links)
- The smallest automaton recognizing the subwords of a text (Q1063423) (← links)
