Matching a set of strings with variable length don't cares
- 30 May 1997
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 178 (1-2) , 129-154
- https://doi.org/10.1016/s0304-3975(97)88195-9
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- String matching with constraintsPublished by Springer Nature ,2005
- On-line construction of suffix treesAlgorithmica, 1995
- Dynamic dictionary matchingJournal of Computer and System Sciences, 1994
- Dynamic dictionary matching with failure functionsTheoretical Computer Science, 1994
- A Four Russians algorithm for regular expression pattern matchingJournal of the ACM, 1992
- An algorithm for string matching with a sequence of don't caresInformation Processing Letters, 1991
- Complete inverted files for efficient text retrieval and analysisJournal of the ACM, 1987
- Transducers and repetitionsTheoretical Computer Science, 1986
- The smallest automation recognizing the subwords of a textTheoretical Computer Science, 1985
- A data structure for dynamic treesJournal of Computer and System Sciences, 1983