Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CPM.2019.23
URN: urn:nbn:de:0030-drops-104943
URL: https://drops.dagstuhl.de/opus/volltexte/2019/10494/
Sugahara, Ryo ; Nakashima, Yuto ; Inenaga, Shunsuke ; Bannai, Hideo ; Takeda, Masayuki
Computing Runs on a Trie
| pdf-format: |
|
Abstract
A maximal repetition, or run, in a string, is a maximal periodic substring whose smallest period is at most half the length of the substring. In this paper, we consider runs that correspond to a path on a trie, or in other words, on a rooted edge-labeled tree where the endpoints of the path must be a descendant/ancestor of the other. For a trie with n edges, we show that the number of runs is less than n. We also show an O(n sqrt{log n}log log n) time and O(n) space algorithm for counting and finding the shallower endpoint of all runs. We further show an O(n log n) time and O(n) space algorithm for finding both endpoints of all runs. We also discuss how to improve the running time even more.
BibTeX - Entry
@InProceedings{sugahara_et_al:LIPIcs:2019:10494,
author = {Ryo Sugahara and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda},
title = {{Computing Runs on a Trie}},
booktitle = {30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019)},
pages = {23:1--23:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-103-0},
ISSN = {1868-8969},
year = {2019},
volume = {128},
editor = {Nadia Pisanti and Solon P. Pissis},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2019/10494},
URN = {urn:nbn:de:0030-drops-104943},
doi = {10.4230/LIPIcs.CPM.2019.23},
annote = {Keywords: runs, Lyndon words}
}
| Keywords: | runs, Lyndon words | |
| Seminar: | 30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019) | |
| Issue date: | 2019 | |
| Date of publication: | 06.06.2019 |
