SIAM Journal on Computing
A very fast substring search algorithm
Communications of the ACM
A new approach to text searching
Communications of the ACM
Fast text searching: allowing errors
Communications of the ACM
Software—Practice & Experience
Experimental results on string matching algorithms
Software—Practice & Experience
A fast string searching algorithm
Communications of the ACM
Flexible pattern matching in strings: practical on-line search algorithms for texts and biological sequences
A Bit-Parallel Approach to Suffix Automata: Fast Extended String Matching
CPM '98 Proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching
String regularities with don't cares
Nordic Journal of Computing - Special issue: Selected papers of the Prague Stringology conference (PSC'02), September 23-24, 2002
A simple fast hybrid pattern-matching algorithm
Journal of Discrete Algorithms
Practical and optimal string matching
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
A simple fast hybrid pattern-matching algorithm
Journal of Discrete Algorithms
New Perspectives on the Prefix Array
SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
A new approach to the periodicity lemma on strings with holes
Theoretical Computer Science
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Indeterminate string inference algorithms
Journal of Discrete Algorithms
| Hi-index | 0.00 |
In a string x on an alphabet @S, a position i is said to be indeterminate iff x[i] may be any one of a specified subset {@l"1,@l"2,...,@l"j} of @S, 2=