Direct linear time construction of parameterized suffix and LCP arrays for constant alphabets
From MaRDI portal
Publication:6536267
DOI10.1007/978-3-030-32686-9_27zbMATH Open1539.68379MaRDI QIDQ6536267
Yuto Nakashima, Hideo Bannai, Masayuki Takeda, Shunsuke Inenaga, Noriki Fujisato
Publication date: 19 April 2024
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Position heaps: a simple and dynamic text indexing data structure
- Computing longest previous factor in linear time and applications
- Generalization of a suffix tree for RNA structural pattern matching
- Parameterized pattern matching: Algorithms and applications
- Variations of the parameterized longest previous factor
- \(p\)-suffix sorting as arithmetic coding
- Constructing suffix arrays in linear time
- Space efficient linear time construction of suffix arrays
- Linear work suffix array construction
- Lightweight Parameterized Suffix Array Construction
- Parameterized Duplication in Strings: Algorithms and an Application to Software Maintenance
- pBWT: Achieving Succinct Data Structures for Parameterized Pattern Matching and Related Problems
- Position Heaps for Parameterized Strings
- Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
This page was built for publication: Direct linear time construction of parameterized suffix and LCP arrays for constant alphabets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6536267)
