Matching a set of strings with variable length don't cares
From MaRDI portal
Publication:1391531
DOI10.1016/S0304-3975(97)88195-9zbMath0901.68037MaRDI QIDQ1391531
Gregory Kucherov, Michaël Rusinowitch
Publication date: 22 July 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items
Window-accumulated subsequence matching problem is linear, Multiple serial episodes matching, A faster algorithm for matching a set of patterns with variable length don't cares, Multi-subsequence searching, A linear time lower bound on McCreight and general updating algorithms for suffix trees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An algorithm for string matching with a sequence of don't cares
- The smallest automaton recognizing the subwords of a text
- Dynamic dictionary matching with failure functions
- Dynamic dictionary matching
- Parallel string matching with variable length don't cares
- Transducers and repetitions
- A data structure for dynamic trees
- On-line construction of suffix trees
- A Four Russians algorithm for regular expression pattern matching
- Complete inverted files for efficient text retrieval and analysis