Abstract
Given a string on an integer alphabet, we present an algorithm that computes the set of all distinct squares belonging to this string in time linear in the string length. As an application, we show how to compute the tree topology of the minimal augmented suffix tree in linear time. Asides from that, we elaborate an algorithm computing the longest previous table in a succinct representation using compressed working space.
| Original language | English |
|---|---|
| Title of host publication | 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017 |
| Editors | Jakub Radoszewski, Juha Karkkainen, Jakub Radoszewski, Wojciech Rytter |
| Publisher | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing |
| ISBN (Electronic) | 9783959770392 |
| DOIs | |
| Publication status | Published - Jul 1 2017 |
| Event | 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017 - Warsaw, Poland Duration: Jul 4 2017 → Jul 6 2017 |
Publication series
| Name | Leibniz International Proceedings in Informatics, LIPIcs |
|---|---|
| Volume | 78 |
| ISSN (Print) | 1868-8969 |
Other
| Other | 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017 |
|---|---|
| Country | Poland |
| City | Warsaw |
| Period | 7/4/17 → 7/6/17 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Software
Cite this
Computing all distinct squares in linear time for integer alphabets. / Bannai, Hideo; Inenaga, Shunsuke; Köppl, Dominik.
28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017. ed. / Jakub Radoszewski; Juha Karkkainen; Jakub Radoszewski; Wojciech Rytter. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2017. 22 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 78).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Computing all distinct squares in linear time for integer alphabets
AU - Bannai, Hideo
AU - Inenaga, Shunsuke
AU - Köppl, Dominik
PY - 2017/7/1
Y1 - 2017/7/1
N2 - Given a string on an integer alphabet, we present an algorithm that computes the set of all distinct squares belonging to this string in time linear in the string length. As an application, we show how to compute the tree topology of the minimal augmented suffix tree in linear time. Asides from that, we elaborate an algorithm computing the longest previous table in a succinct representation using compressed working space.
AB - Given a string on an integer alphabet, we present an algorithm that computes the set of all distinct squares belonging to this string in time linear in the string length. As an application, we show how to compute the tree topology of the minimal augmented suffix tree in linear time. Asides from that, we elaborate an algorithm computing the longest previous table in a succinct representation using compressed working space.
UR - http://www.scopus.com/inward/record.url?scp=85027249545&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85027249545&partnerID=8YFLogxK
U2 - 10.4230/LIPIcs.CPM.2017.22
DO - 10.4230/LIPIcs.CPM.2017.22
M3 - Conference contribution
AN - SCOPUS:85027249545
T3 - Leibniz International Proceedings in Informatics, LIPIcs
BT - 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017
A2 - Radoszewski, Jakub
A2 - Karkkainen, Juha
A2 - Radoszewski, Jakub
A2 - Rytter, Wojciech
PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ER -