TY - JOUR
T1 - An extension of linear-size suffix tries for parameterized strings
AU - Nakashima, Katsuhito
AU - Hendrian, Diptarama
AU - Yoshinaka, Ryo
AU - Shinohara, Ayumi
N1 - Funding Information:
This research was partially supported by JSPS KAKENHI Grant Numbers JP15H05706 and JP19K20208.
Publisher Copyright:
Copyright © 2020 for this paper by its authors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0).
PY - 2020
Y1 - 2020
N2 - In this paper, we propose a new indexing structure for parameterized strings which we call PLSTs, by generalizing linear-size suffix tries for ordinary strings. Two parameterized strings are said to match if there is a bijection on the symbol set that makes the two coincide. PLSTs are applicable to the parameterized pattern matching problem, which is to decide whether the input parameterized text has a substring that matches the input parameterized pattern. The size of PLSTs is linear in the text size, with which our algorithm solves the parameterized pattern matching problem in linear time in the pattern size. PLSTs can be seen as a compacted version of parameterized suffix tries and a combination of linear-size suffix tries and parameterized suffix trees. We experimentally show that PLSTs are more space efficient than parameterized suffix trees for highly repetitive strings.
AB - In this paper, we propose a new indexing structure for parameterized strings which we call PLSTs, by generalizing linear-size suffix tries for ordinary strings. Two parameterized strings are said to match if there is a bijection on the symbol set that makes the two coincide. PLSTs are applicable to the parameterized pattern matching problem, which is to decide whether the input parameterized text has a substring that matches the input parameterized pattern. The size of PLSTs is linear in the text size, with which our algorithm solves the parameterized pattern matching problem in linear time in the pattern size. PLSTs can be seen as a compacted version of parameterized suffix tries and a combination of linear-size suffix tries and parameterized suffix trees. We experimentally show that PLSTs are more space efficient than parameterized suffix trees for highly repetitive strings.
KW - Indexing data structure
KW - Linear-size suffix trie
KW - Parameterized pattern matching
UR - http://www.scopus.com/inward/record.url?scp=85081642588&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85081642588&partnerID=8YFLogxK
M3 - Conference article
AN - SCOPUS:85081642588
VL - 2568
SP - 97
EP - 108
JO - CEUR Workshop Proceedings
JF - CEUR Workshop Proceedings
SN - 1613-0073
T2 - 46th International Conference on Current Trends in Theory and Practice of Computer Science Doctoral Student Research Forum, SOFSEM-SRF 2020
Y2 - 20 January 2020 through 24 January 2020
ER -