Index Terms
- Fast algorithms for sorting and searching strings
Recommendations
Fast Searching in Packed Strings
Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching - Volume 5577Given strings P and Q the exact string matching problem is to find all positions of substrings in Q matching P. The classical Knuth-Morris-Pratt algorithm [SIAM J. Comput., 1977] solves the string matching problem in linear time which is optimal if we ...
Generic algorithms for factoring strings
Information Theory, Combinatorics, and Search TheoryIn this paper we describe algorithms for factoring words over sets of strings known as circ-UMFFs, generalizations of the well-known Lyndon words based on lexorder, whose properties were first studied in 1958 by Chen, Fox and Lyndon. In 1983 Duval ...
Comments