Faster Compressed Suffix Trees for Repetitive Text Collections

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-319-07959-2_36
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer International Publishing

Related search

Fully Compressed Suffix Trees

ACM Transactions on Algorithms
Mathematics
2011English

Annotated Suffix Tree as a Way of Text Representation for Information Retrieval in Text Collections

Business Informatics
2015English

Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2008English

Faster Compressed Dictionary Matching

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Optimal Construction of Compressed Indexes for Highly Repetitive Texts

2019English

Alphabet-Independent Compressed Text Indexing

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Modified LZW Algorithm for Efficient Compressed Text Retrieval

2004English

Contextual Exploration of Text Collections

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Mining Web Access Patterns Using Root-Set of Suffix Trees

International Journal of Computer Applications
2014English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy