Towards a real time algorithm for parameterized longest common prefix computation

Amihood Amir, Eitan Kondratovsky

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Abstract

Parameterized matching has proven to be an efficient and useful tool for detecting code duplications. This paper presents a technique for calculating parameterized Longest Common Prefix (plcp) in constant time based on the knowledge about the plcp of the following suffixes. Using this technique, online p-suffix tree construction can be done in worst case time O(log⁡n) per input symbol. Searching for a pattern of length m in the resulting suffix tree takes O(min⁡{mlog⁡(|Σ|+|Π|),m+log⁡n}+mτΠ+tocc) time, where tocc is the number of occurrences of the pattern, and τΠ depends on Π. For constant-sized Π, τΠ=1, for polynomial-sized Π, τΠ=log⁡log⁡|Π|, and for unbounded Π, τΠ=log⁡|Π|.

Original languageEnglish
Pages (from-to)132-137
Number of pages6
JournalTheoretical Computer Science
Volume852
DOIs
StatePublished - 8 Jan 2021

Bibliographical note

Publisher Copyright:
© 2020 Elsevier B.V.

Funding

This work was partially supported by ISF grant 1475/18 and BSF grant 2018141 .

FundersFunder number
United States - Israel Binational Science Foundation2018141
Israel Science Foundation1475/18

    Keywords

    • Online indexing
    • Parameterized longest common prefix
    • Parameterized matching

    Fingerprint

    Dive into the research topics of 'Towards a real time algorithm for parameterized longest common prefix computation'. Together they form a unique fingerprint.

    Cite this