Lightweight Parameterized Suffix Array Construction
From MaRDI portal
Publication:3651558
DOI10.1007/978-3-642-10217-2_31zbMath1267.68330OpenAlexW1832350368MaRDI QIDQ3651558
Satoshi Deguchi, Itagaki Tomohiro, Masayuki Takeda, Shunsuke Inenaga, Hideo Bannai
Publication date: 11 December 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-10217-2_31
Related Items (11)
The structural border array ⋮ Variations of the parameterized longest previous factor ⋮ \(p\)-suffix sorting as arithmetic coding ⋮ Parameterized DAWGs: efficient constructions and bidirectional pattern searches ⋮ Compressed parameterized pattern matching ⋮ Computing the parameterized Burrows-Wheeler transform online ⋮ Parameterized longest previous factor ⋮ Verifying and enumerating parameterized border arrays ⋮ Efficient pattern matching for RNA secondary structures ⋮ A prefix array for parameterized strings ⋮ A brief history of parameterized matching problems
This page was built for publication: Lightweight Parameterized Suffix Array Construction