Suffix vector: A space-efficient suffix tree representation

DOI10.1007/3-540-45678-3_60MaRDI QIDQ4474136zbMATH OpenFDO

Authors Krisztián Monostori, A. Zaslavsky, István Vajk

Publication date 4 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2223/22230707.htm

Mathematics Subject Classification ID

Data structures (68P05) Protein sequences, DNA sequences (92D20)

Recommendations

• From Suffix Trees to Suffix Vectors
• scientific article; zbMATH DE number 871936
• Fully compressed suffix trees
• Space efficient suffix trees
• Replacing suffix trees with enhanced suffix arrays

Cited in

(4)

• Space-efficient representation of truncated suffix trees, with applications to Markov order estimation
• From Suffix Trees to Suffix Vectors
• scientific article; zbMATH DE number 871936 (Why is no real title available?)
• On-line construction of compact suffix vectors and maximal repeats

This page was built for publication: Suffix vector: A space-efficient suffix tree representation

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