Fully Compressed Suffix Trees

ACM Transactions on Algorithms- United States

doi 10.1145/2000807.2000821

Full Text

Abstract

Available in

Categories

Mathematics

Date

Authors

Publisher

Association for Computing Machinery (ACM)

Related search

Faster Compressed Suffix Trees for Repetitive Text Collections

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Mining Web Access Patterns Using Root-Set of Suffix Trees

International Journal of Computer Applications
2014English

Random Access to Grammar-Compressed Strings and Trees

SIAM Journal on Computing
MathematicsComputer Science
2015English

A Fully Compressed Pattern Matching Algorithm for Simple Collage Systems

International Journal of Foundations of Computer Science
Computer Science
2005English

Suffix Ordering and Morphological Processing

Language
LinguisticsLanguage
2009English

Points From Letters: Errant Suffix

BMJ
1978English

Semantics of Possibility Suffix “(Rar)e”

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Simultaneous Removal of Prefix and Suffix

Vietnam Journal of Computer Science
2020English

Better External Memory Suffix Array Construction

Journal of Experimental Algorithmics
Theoretical Computer Science
2008English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy