Direct linear time construction of parameterized suffix and LCP arrays for constant alphabets
type: Item
instance of: scholarly article
title: Direct linear time construction of parameterized suffix and LCP arrays for constant alphabets
zbMATH Open document ID: 1539.68379
DOI: 10.1007/978-3-030-32686-9_27
author: Noriki Fujisato
author: Yuto Nakashima
author: Shunsuke Inenaga
author: Hideo Bannai
author: Masayuki Takeda
publication date: 2024-04-19T00:00:00Z
Mathematics Subject Classification ID: 68W32
zbMATH DE Number: 7834825
zbMATH Keywords: parameterized pattern matching
zbMATH Keywords: parameterized suffix array paramterized LCP array
MaRDI profile type: Publication
cites work: Parameterized pattern matching: Algorithms and applications
cites work: Parameterized Duplication in Strings: Algorithms and an Application to Software Maintenance
cites work: Variations of the parameterized longest previous factor
cites work: \(p\)-suffix sorting as arithmetic coding
cites work: Computing longest previous factor in linear time and applications
cites work: Position Heaps for Parameterized Strings
cites work: Position heaps: a simple and dynamic text indexing data structure
cites work: Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
cites work: pBWT: Achieving Succinct Data Structures for Parameterized Pattern Matching and Related Problems
cites work: Lightweight Parameterized Suffix Array Construction
cites work: Linear work suffix array construction
cites work: Q4547749
cites work: Constructing suffix arrays in linear time
cites work: Space efficient linear time construction of suffix arrays
cites work: Q4252748
cites work: Generalization of a suffix tree for RNA structural pattern matching
description: scientific article; zbMATH DE number 7834825