Compressed index for a dynamic collection of texts

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3109, Issue , 2004, Pages 445-456

  Chan, Ho Leung ^a   Hon, Wing Kai ^a   Lam, Tak Wah ^a  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

PATTERN MATCHING;

BOUNDED SIZE; OPTIMAL SPACE; TOTAL LENGTH;

INDEXING (OF INFORMATION);

EID: 35048868341     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27801-6_34     Document Type: Article

References (13)

1. M. Burrows and D. J. Wheeler. A Block-sorting Lossless Data Compression Algorithm. Technical Report 124, Digital Equipment Corporation, Paolo Alto, California, 1994.
2. P. Ferragina and G. Manzini. Opportunistic Data Structures with Applications. In Proceedings of Symposium on Foundations of Computer Science, pages 390-398, 2000.
3. The Google Homepage Search Engine. http://www.google.com/.
4. R. Grossi and J. S. Vitter. Compressed Suffix Arrays and Suffix Tree with Applications to Text Indexing and String Matching. In Proceedings of Symposium on Theory of Computing, pages 397-406, 2000.
5. W. K. Hon, T. W. Lam, W. K. Sung, W. L. Tse, C. K. Wong and S. M. Yiu. Practical Aspects of Compressed Suffix Arrays and FM-index in Searching DNA Sequences. To appear in Proceedings of Workshop on Algorithm Engineering and Experiments, 2004.
6. S. Kurtz. Reducing the Space Requirement of Suffix Trees. Software Practice and Experience, 29(13):1149-1171, 1999.
7. T. W. Lam, K. Sadakane, W. K. Sung, and S. M. Yiu. A Space and Time Efficient Algorithm for Constructing Compressed Suffix Array. In Proceedings of International Conference on Computing and Combinatorics, pages 401-410, 2002.
8. U. Manber and G. Myers. Suffix Arrays: A New Method for On-Line String Searches. SIAM Journal on Computing, 22(5):935-948, 1993.
9. E. M. McCreight. A Space-economical Suffix Tree Construction Algorithm. Journal of the ACM, 23(2):262-272, 1976.
10. H. W. Mewes and K. Heumann. Genome Analysis: Pattern Search in Biological Macromolecules. In Proceedings of Symposium on Combinatorial Pattern Matching, pages 261-285, 1995.
11. M. H. Overmars. The Design of Dynamic Data Structures. Lecture Notes in Computer Science 156, pages 34-35, 1983.
12. K. Sadakane. Compressed Text Databases with Efficient Query Algorithms based on Compressed Suffix Array. In Proceedings of International Symposium on Algorithms and Computation, pages 410-421, 2000.
13. P. Weiner. Linear Pattern Matching Algorithm. In Proceedings of Symposium on Switching and Automata Theory, pages 1-11, 1973.