Online Suffix Tree Construction for Streaming Sequences

DOI10.1007/978-3-540-89985-3_9MaRDI QIDQ3628498zbMATH OpenOpenAlexFDO

Authors Giyasettin Ozcan, Adil Alpkocak

Publication date 20 May 2009

Published in Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-89985-3_9

zbMATH Keywords

poor memory localitysequence databasessuffix treestime series indexing

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25)

Recommendations

• On-line construction of suffix trees
• On-line suffix tree construction with reduced branching
• Fully-online Construction of Suffix Trees for Multiple Texts.
• On-line construction of parameterized suffix trees for large alphabets
• On-line construction of two-dimensional suffix trees
• On-line construction of two-dimensional suffix trees
• On-Line Linear-Time Construction of Word Suffix Trees

Cites work

• A Space-Economical Suffix Tree Construction Algorithm
• Algorithms on Strings, Trees and Sequences
• Distributed and paged suffix trees for large genetic databases
• From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction
• Introduction to algorithms.
• On updating suffix tree labels
• On-line construction of suffix trees
• Replacing suffix trees with enhanced suffix arrays
• Space efficient suffix trees
• Suffix Arrays: A New Method for On-Line String Searches

Cited in

(2)

• Fully-online suffix tree and directed acyclic word graph construction for multiple texts
• Fully-online Construction of Suffix Trees for Multiple Texts.

This page was built for publication: Online Suffix Tree Construction for Streaming Sequences

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