A Space and Time Efficient Algorithm for Constructing Compressed Suffix Arrays
暂无分享,去创建一个
[1] Siu-Ming Yiu,et al. Practical aspects of Compressed Suffix Arrays and FM-Index in Searching DNA Sequences , 2004, ALENEX/ANALC.
[2] Giovanni Manzini,et al. An experimental study of an opportunistic index , 2001, SODA '01.
[3] Kunihiko Sadakane,et al. New text indexing functionalities of the compressed suffix arrays , 2003, J. Algorithms.
[4] Peter Elias,et al. Universal codeword sets and representations of the integers , 1975, IEEE Trans. Inf. Theory.
[5] Robert F. Rice,et al. Some practical universal noiseless coding techniques , 1979 .
[6] Malcolm P. Atkinson,et al. A Database Index to Large Biological Sequences , 2001, VLDB.
[7] Eugene W. Myers,et al. Suffix arrays: a new method for on-line string searches , 1993, SODA '90.
[8] Giovanni Manzini,et al. An analysis of the Burrows-Wheeler transform , 2001, SODA '99.
[9] D. J. Wheeler,et al. A Block-sorting Lossless Data Compression Algorithm , 1994 .
[10] Rajeev Raman,et al. Succinct indexable dictionaries with applications to encoding k-ary trees and multisets , 2002, SODA '02.
[11] Roberto Grossi,et al. Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract) , 2000, STOC '00.
[12] Stefan Kurtz,et al. Reducing the space requirement of suffix trees , 1999 .
[13] David R. Clark,et al. Efficient suffix trees on secondary storage , 1996, SODA '96.
[14] Roberto Grossi,et al. High-order entropy-compressed text indexes , 2003, SODA '03.
[15] Stefan Kurtz,et al. Reducing the space requirement of suffix trees , 1999, Softw. Pract. Exp..
[16] Edward M. McCreight,et al. A Space-Economical Suffix Tree Construction Algorithm , 1976, JACM.
[17] Kunihiko Sadakane,et al. Compressed Text Databases with Efficient Query Algorithms Based on the Compressed Suffix Array , 2000, ISAAC.
[18] Roberto Grossi,et al. When indexing equals compression: experiments with compressing suffix arrays and applications , 2004, SODA '04.
[19] Wing-Kai Hon,et al. Breaking a time-and-space barrier in constructing full-text indices , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[20] Tetsuo Shibuya,et al. Indexing huge genome sequences for solving various problems. , 2001, Genome informatics. International Conference on Genome Informatics.
[21] E. Myers,et al. Basic local alignment search tool. , 1990, Journal of molecular biology.
[22] Giovanni Manzini,et al. Opportunistic data structures with applications , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[23] Guy Jacobson,et al. Space-efficient static trees and graphs , 1989, 30th Annual Symposium on Foundations of Computer Science.