A comparison of imperative and purely functional suffix tree constructions

DOI10.1016/0167-6423(95)00003-8zbMATH Open0853.68100OpenAlexW2029135821MaRDI QIDQ1916355FDOQ1916355

Authors: Robert Giegerich, Stefan Kurtz 

Publication date: 12 December 1996

Published in: Science of Computer Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6423(95)00003-8

Recommendations

• From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction
• On-line construction of suffix trees
• On-line suffix tree construction with reduced branching
• Engineering a compressed suffix tree implementation

zbMATH Keywords

suffix treedesign space

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Theory of software (68N99)

Cited In (2)

• Full-text indexes for high-throughput sequencing
• Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays

This page was built for publication: A comparison of imperative and purely functional suffix tree constructions

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