A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
I/O-Efficient Compressed Text Indexes: From Theory to Practice
2010
2010 Data Compression Conference
Pattern matching on text data has been a fundamental field of Computer Science for nearly 40 years. Databases supporting full-text indexing functionality on text data are now widely used by biologists. In the theoretical literature, the most popular internal-memory index structures are the suffix trees and the suffix arrays, and the most popular external-memory index structure is the string B-tree. However, the practical applicability of these indexes has been limited mainly because of their
doi:10.1109/dcc.2010.45
dblp:conf/dcc/ChiuHSV10
fatcat:xwg4nqpehrbfbjcsv44fe7sbru