Obtaining Provably Good Performance from Suffix Trees in Secondary Storage

DOI10.1007/11780441_8MaRDI QIDQ5307494zbMATH OpenOpenAlexFDO

Authors P. 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)

Recommendations

• scientific article; zbMATH DE number 871936
• scientific article; zbMATH DE number 5499319
• The string B-tree
• A data structure for a sequence of string accesses in external memory
• scientific article; zbMATH DE number 871935

Cited in

(9)

• Database indexing for large DNA and protein sequence collections
• I/O efficient dynamic data structures for longest prefix queries
• Counter based suffix tree for DNA pattern repeats
• On the weak prefix-search problem
• The string B-tree
• On the weak prefix-search problem
• scientific article; zbMATH DE number 1263248 (Why is no real title available?)
• scientific article; zbMATH DE number 871935 (Why is no real title available?)
• scientific article; zbMATH DE number 871936 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5307494)