Online Suffix Tree Construction for Streaming Sequences

DOI10.1007/978-3-540-89985-3_9zbMath1183.68270OpenAlexW192080074MaRDI QIDQ3628498

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

suffix treespoor memory localitysequence databasestime series indexing

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Replacing suffix trees with enhanced suffix arrays
• On updating suffix tree labels
• From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction
• On-line construction of suffix trees
• Space Efficient Suffix Trees
• Suffix Arrays: A New Method for On-Line String Searches
• Distributed and Paged Suffix Trees for Large Genetic Databases
• A Space-Economical Suffix Tree Construction Algorithm
• Algorithms on Strings, Trees and Sequences

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