An extension of linear-size suffix tries for parameterized strings

Research output: Contribution to journalConference articlepeer-review

Abstract

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.

Original languageEnglish
Pages (from-to)97-108
Number of pages12
JournalCEUR Workshop Proceedings
Volume2568
Publication statusPublished - 2020 Jan 1
Event46th International Conference on Current Trends in Theory and Practice of Computer Science Doctoral Student Research Forum, SOFSEM-SRF 2020 - Limassol, Cyprus
Duration: 2020 Jan 202020 Jan 24

Keywords

  • Indexing data structure
  • Linear-size suffix trie
  • Parameterized pattern matching

ASJC Scopus subject areas

  • Computer Science(all)

Fingerprint Dive into the research topics of 'An extension of linear-size suffix tries for parameterized strings'. Together they form a unique fingerprint.

Cite this