TY - GEN
T1 - Computing all distinct squares in linear time for integer alphabets
AU - Bannai, Hideo
AU - Inenaga, Shunsuke
AU - Köppl, Dominik
N1 - Publisher Copyright:
© Hideo Bannai, Shunsuke Inenaga, and Dominik Köppl.
Copyright:
Copyright 2017 Elsevier B.V., All rights reserved.
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
T2 - 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017
Y2 - 4 July 2017 through 6 July 2017
ER -