Finding Maximal Quasiperiodicities in Strings
DOI:
https://doi.org/10.7146/brics.v6i25.20094Resumé
Apostolico and Ehrenfeucht defined the notion of a maximal quasiperiodicsubstring and gave an algorithm that finds all maximal quasiperiodic
substrings in a string of length n in time O(n log2 n). In this paper we
give an algorithm that finds all maximal quasiperiodic substrings in a
string of length n in time O(n log n) and space O(n). Our algorithm uses
the suffix tree as the fundamental data structure combined with efficient
methods for merging and performing multiple searches in search trees.
Besides finding all maximal quasiperiodic substrings, our algorithm also
marks the nodes in the suffix tree that have a superprimitive path-label.
Downloads
Publiceret
1999-01-25
Citation/Eksport
Brodal, G. S., & Pedersen, C. N. S. (1999). Finding Maximal Quasiperiodicities in Strings. BRICS Report Series, 6(25). https://doi.org/10.7146/brics.v6i25.20094
Nummer
Sektion
Artikler
Licens
Authors who publish with this journal agree to the following terms:- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
