Computer Science – Data Structures and Algorithms
Scientific paper
2011-04-19
Computer Science
Data Structures and Algorithms
Scientific paper
A compressed full-text self-index occupies space close to that of the compressed text and simultaneously allows fast pattern matching and random access to the underlying text. Among the best compressed self-indexes, in theory and in practice, are several members of the FM-index family. In this paper, we describe new FM-index variants that combine nice theoretical properties, simple implementation and improved practical performance. Our main result is a new technique called fixed block compression boosting, which is a simpler and faster alternative to optimal compression boosting and implicit compression boosting used in previous FM-indexes.
Kärkkäinen Juha
Puglisi Simon J.
No associations
LandOfFree
Fixed Block Compression Boosting in FM-Indexes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Fixed Block Compression Boosting in FM-Indexes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fixed Block Compression Boosting in FM-Indexes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-183712