An Improved Query Time for Succinct Dynamic Dictionary Matching
暂无分享,去创建一个
[1] Sergio Rajsbaum,et al. LATIN 2002: Theoretical Informatics , 2002, Lecture Notes in Computer Science.
[2] Wing-Kai Hon,et al. Faster Compressed Dictionary Matching , 2010, SPIRE.
[3] Wojciech Rytter,et al. On maximal suffixes, constant-space linear-time versions of KMP algorithm , 2003, Theor. Comput. Sci..
[4] Roberto Grossi,et al. Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract) , 2000, STOC '00.
[5] Uzi Vishkin,et al. Efficient approximate and dynamic matching of patterns using a labeling paradigm , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[6] Wojciech Rytter,et al. Extracting Powers and Periods in a String from Its Runs Structure , 2010, SPIRE.
[7] Djamal Belazzougui. Succinct Dictionary Matching with No Slowdown , 2010, CPM.
[8] Wing-Kai Hon,et al. Compressed Index for Dictionary Matching , 2008, Data Compression Conference (dcc 2008).
[9] Alfred V. Aho,et al. Efficient string matching , 1975, Commun. ACM.
[10] Giovanni Manzini,et al. Indexing compressed text , 2005, JACM.
[11] Wojciech Rytter. On Maximal Suffices and Constant-Space Linear-Time Versions of KMP Algorithm , 2002, LATIN.
[12] Wing-Kai Hon,et al. Dynamic dictionary matching and compressed suffix trees , 2005, SODA '05.
[13] Wing-Kai Hon,et al. Succinct Index for Dynamic Dictionary Matching , 2009, ISAAC.
[14] Gonzalo Navarro,et al. Fully-functional succinct trees , 2010, SODA '10.
[15] Raffaele Giancarlo,et al. Dynamic Dictionary Matching , 1994, J. Comput. Syst. Sci..
[16] Arnold L. Rosenberg,et al. Rapid identification of repeated patterns in strings, trees and arrays , 1972, STOC.
[17] Alejandro A. Schäffer,et al. Improved dynamic dictionary matching , 1995, SODA '93.
[18] Edward M. McCreight,et al. A Space-Economical Suffix Tree Construction Algorithm , 1976, JACM.