Computing all distinct squares in linear time for integer alphabets

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

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 languageEnglish
Title of host publication28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017
EditorsJakub Radoszewski, Juha Karkkainen, Jakub Radoszewski, Wojciech Rytter
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959770392
DOIs
Publication statusPublished - Jul 1 2017
Event28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017 - Warsaw, Poland
Duration: Jul 4 2017Jul 6 2017

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume78
ISSN (Print)1868-8969

Other

Other28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017
CountryPoland
CityWarsaw
Period7/4/177/6/17

Fingerprint

Topology

All Science Journal Classification (ASJC) codes

  • Software

Cite this

Bannai, H., Inenaga, S., & Köppl, D. (2017). Computing all distinct squares in linear time for integer alphabets. In J. Radoszewski, J. Karkkainen, J. Radoszewski, & W. Rytter (Eds.), 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017 [22] (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 78). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.CPM.2017.22

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 proceedingConference contribution

Bannai, H, Inenaga, S & Köppl, D 2017, Computing all distinct squares in linear time for integer alphabets. in J Radoszewski, J Karkkainen, J Radoszewski & W Rytter (eds), 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017., 22, Leibniz International Proceedings in Informatics, LIPIcs, vol. 78, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017, Warsaw, Poland, 7/4/17. https://doi.org/10.4230/LIPIcs.CPM.2017.22
Bannai H, Inenaga S, Köppl D. Computing all distinct squares in linear time for integer alphabets. In Radoszewski J, Karkkainen J, Radoszewski J, Rytter W, editors, 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. 2017. 22. (Leibniz International Proceedings in Informatics, LIPIcs). https://doi.org/10.4230/LIPIcs.CPM.2017.22
Bannai, Hideo ; Inenaga, Shunsuke ; Köppl, Dominik. / Computing all distinct squares in linear time for integer alphabets. 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017. editor / Jakub Radoszewski ; Juha Karkkainen ; Jakub Radoszewski ; Wojciech Rytter. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2017. (Leibniz International Proceedings in Informatics, LIPIcs).
@inproceedings{45e2f3b03668458d816119f8b981d37c,
title = "Computing all distinct squares in linear time for integer alphabets",
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.",
author = "Hideo Bannai and Shunsuke Inenaga and Dominik K{\"o}ppl",
year = "2017",
month = "7",
day = "1",
doi = "10.4230/LIPIcs.CPM.2017.22",
language = "English",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
editor = "Jakub Radoszewski and Juha Karkkainen and Jakub Radoszewski and Wojciech Rytter",
booktitle = "28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017",

}

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 -