A comparison of imperative and purely functional suffix tree constructions

DOI10.1016/0167-6423(95)00003-8zbMath0853.68100OpenAlexW2029135821MaRDI QIDQ1916355

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

zbMATH Keywords

suffix treedesign space

Mathematics Subject Classification ID

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

Related Items

Full-Text Indexes for High-Throughput Sequencing, Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays