Sorting Jordan sequences in linear time using level-linked search trees
Information and Control
Efficient detection of quasiperiodicities in strings
Theoretical Computer Science
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
How many squares can a string contain?
Journal of Combinatorial Theory Series A
A Space-Economical Suffix Tree Construction Algorithm
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Simple and flexible detection of contiguous repeats using a suffix tree
Theoretical Computer Science
Finding Maximal Quasiperiodicities in Strings
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
Optimal suffix tree construction with large alphabets
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Linear pattern matching algorithms
SWAT '73 Proceedings of the 14th Annual Symposium on Switching and Automata Theory (swat 1973)
Range Non-overlapping Indexing
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Searching for smallest grammars on large sequences and application to DNA
Journal of Discrete Algorithms
Computing q-gram non-overlapping frequencies on SLP compressed texts
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Improved algorithms for the range next value problem and applications
Theoretical Computer Science
Cycle detection and correction
ACM Transactions on Algorithms (TALG)
Range non-overlapping indexing and successive list indexing
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
| Hi-index | 0.00 |
The stringstatistics problem consists of preprocessinga stringof length n such that given a query pattern of length m, the maximum number of non-overlappingo ccurrences of the query pattern in the stringcan be reported efficiently. Apostolico and Preparata introduced the minimal augmented suffix tree (MAST) as a data structure for the stringstatistics problem, and showed how to construct the MAST in time O(n log2 n) and how it supports queries in time O(m) for constant sized alphabets. A subsequent theorem by Fraenkel and Simpson stating that a stringhas at most a linear number of distinct squares implies that the MAST requires space O(n). In this paper we improve the construction time for the MAST to O(n log n) by extendingthe algorithm of Apostolico and Preparata to exploit properties of efficient joining and splitting of search trees together with a refined analysis.