Abstract
We present several efficient data structures for answering queries related to periods in words. For a given word w of length n the Period Query given a factor of w (represented by an interval) returns its shortest period and a compact representation of all periods. Several algorithmic solutions are proposed that balance the data structure space (ranging from O(n) to O(nlogn)), and the query time complexity (ranging from O(log1∈+∈ε n) to O(logn)). © 2012 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Kociumaka, T., Radoszewski, J., Rytter, W., & Waleń, T. (2012). Efficient data structures for the factor periodicity problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7608 LNCS, pp. 284–294). Springer Verlag. https://doi.org/10.1007/978-3-642-34109-0_30
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
