Suffix Tree Based Data Compression

Martin Senft

doi:10.1007/978-3-540-30577-4_38

ScienceGate Book Chapters

BOOK-CHAPTER

Suffix Tree Based Data Compression

Martin Senft

Year: 2005 Lecture notes in computer science Pages: 350-359 Publisher: Springer Science+Business Media

DOI: 10.1007/978-3-540-30577-4_38

Get Full-Text PDF Get Analytical Report

Keywords:

Computer science Suffix tree Lossless compression Generalized suffix tree Suffix Compressed suffix array Fractal tree index Data compression String (physics) Tree (set theory) Data structure String searching algorithm Compression (physics) Theoretical computer science Tree structure Algorithm Pattern matching Interval tree Artificial intelligence Mathematics Programming language

Metrics

Cited By

0.26

FWCI (Field Weighted Citation Impact)

Refs

0.51

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Algorithms and Data Compression

Physical Sciences → Computer Science → Artificial Intelligence

Network Packet Processing and Optimization

Physical Sciences → Computer Science → Hardware and Architecture

Advanced Data Compression Techniques

Physical Sciences → Computer Science → Computer Vision and Pattern Recognition

Suffix Tree Based Data Compression

Metrics

Citation History

Topics

Related Documents

Antisequential Suffix Sorting for BWT-Based Data Compression

Data compression with truncated suffix trees

Suffix Tree Data Structures for Matrices

Suffix Tree Construction based Mapreduce

Suffix Tree