A new efficient indexing algorithm for one-dimensional real scaled patterns
暂无分享,去创建一个
[1] Amihood Amir,et al. Alphabet-Independent and Scaled Dictionary Matching , 2000, J. Algorithms.
[2] Michael A. Bender,et al. The LCA Problem Revisited , 2000, LATIN.
[3] Biing-Feng Wang,et al. Efficient algorithms for the scaled indexing problem , 2004, J. Algorithms.
[4] Dong Kyue Kim,et al. Constructing suffix arrays in linear time , 2005, J. Discrete Algorithms.
[5] Edward M. McCreight,et al. A Space-Economical Suffix Tree Construction Algorithm , 1976, JACM.
[6] Raphaël Clifford,et al. Simple deterministic wildcard matching , 2007, Inf. Process. Lett..
[7] M. Crochemore,et al. On-line construction of suffix trees , 2002 .
[8] Enno Ohlebusch,et al. Optimal Exact Strring Matching Based on Suffix Arrays , 2002, SPIRE.
[9] Eugene W. Myers,et al. Suffix arrays: a new method for on-line string searches , 1993, SODA '90.
[10] Moshe Lewenstein,et al. Efficient one-dimensional real scaled matching , 2007, J. Discrete Algorithms.
[11] S. Muthukrishnan,et al. Efficient algorithms for document retrieval problems , 2002, SODA '02.
[12] Gad M. Landau,et al. Efficient pattern matching with scaling , 1990, SODA '90.
[13] S. Muthukrishnan,et al. On the sorting-complexity of suffix tree construction , 2000, JACM.
[14] Moshe Lewenstein,et al. Real scaled matching , 2000, SODA '00.
[15] Peter Weiner,et al. Linear Pattern Matching Algorithms , 1973, SWAT.
[16] Robert S. Boyer,et al. A fast string searching algorithm , 1977, CACM.
[17] Srinivas Aluru,et al. Space efficient linear time construction of suffix arrays , 2005, J. Discrete Algorithms.
[18] Moshe Lewenstein,et al. Real Two Dimensional Scaled Matching , 2007, Algorithmica.
[19] Donald E. Knuth,et al. Fast Pattern Matching in Strings , 1977, SIAM J. Comput..
[20] Moshe Lewenstein,et al. Faster algorithms for string matching with k mismatches , 2000, SODA '00.