On Simon's string searching algorithm
Information Processing Letters
Dynamic Perfect Hashing: Upper and Lower Bounds
SIAM Journal on Computing
Trans-dichotomous algorithms for minimum spanning trees and shortest paths
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
On the comparison complexity of the string prefix-matching problem
Journal of Algorithms
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
A Space-Economical Suffix Tree Construction Algorithm
Journal of the ACM (JACM)
String Matching Algorithms and Automata
Proceedings of the Colloquium in Honor of Arto Salomaa on Results and Trends in Theoretical Computer Science
Optimal suffix tree construction with large alphabets
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Rapid identification of repeated patterns in strings, trees and arrays
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
Journal of Algorithms
Border array on bounded alphabet
Journal of Automata, Languages and Combinatorics
Algorithms on Strings
Counting Parameterized Border Arrays for a Binary Alphabet
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Verifying a parameterized border array in O(n1.5) time
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
Counting and verifying maximal palindromes
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Reversing longest previous factor tables is hard
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Verifying and enumerating parameterized border arrays
Theoretical Computer Science
Inferring strings from suffix trees and links on a binary alphabet
Discrete Applied Mathematics
| Hi-index | 0.00 |
Let π′w denote the failure function of the Knuth-Morris-Pratt algorithm for a word w. In this paper we study the following problem: given an integer array A′[1 .. n], is there a word w over an arbitrary alphabet Σ such that A′[i]=π′w[i] for all i? Moreover, what is the minimum cardinality of Σ required? We give an elementary and self-contained $\mathcal{O}(n\log n)$ time algorithm for this problem, thus improving the previously known solution [8] with no polynomial time bound. Using both deeper combinatorial insight into the structure of π′ and more advanced tools, we further improve the running time to $\mathcal{O}(n)$.