Obtaining Provably Good Performance from Suffix Trees in Secondary Storage

DOI10.1007/11780441_8zbMath1196.68063OpenAlexW1590204465MaRDI QIDQ5307494

Pang Ko, Srinivas Aluru

Publication date: 14 September 2007

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11780441_8

Mathematics Subject Classification ID

Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items (4)

On the weak prefix-search problem ⋮ I/O efficient dynamic data structures for longest prefix queries ⋮ On the Weak Prefix-Search Problem ⋮ Counter based suffix tree for DNA pattern repeats

This page was built for publication: Obtaining Provably Good Performance from Suffix Trees in Secondary Storage