Average-Optimal Multiple Approximate String Matching
暂无分享,去创建一个
[1] Wojciech Rytter,et al. Text Algorithms , 1994 .
[2] Eugene W. Myers,et al. A fast bit-vector algorithm for approximate string matching based on dynamic programming , 1998, JACM.
[3] Peter H. Sellers,et al. The Theory and Computation of Evolutionary Distances: Pattern Recognition , 1980, J. Algorithms.
[4] Gonzalo Navarro,et al. New and faster filters for multiple approximate string matching , 2002, Random Struct. Algorithms.
[5] U. Manber,et al. APPROXIMATE MULTIPLE STRING SEARCH , 1996 .
[6] Gonzalo Navarro,et al. Multiple Approximate String Matching , 1997, WADS.
[7] Esko Ukkonen,et al. Finding Approximate Patterns in Strings , 1985, J. Algorithms.
[8] Andrew Chi-Chih Yao,et al. The Complexity of Pattern Matching for a Random String , 1977, SIAM J. Comput..
[9] Thomas G. Marr,et al. Approximate String Matching and Local Similarity , 1994, CPM.
[10] Erkki Sutinen,et al. Indexing text with approximate q-grams , 2000, J. Discrete Algorithms.
[11] Gonzalo Navarro,et al. Faster Bit-Parallel Approximate String Matching , 2002, CPM.
[12] NavarroGonzalo. A guided tour to approximate string matching , 2001 .
[13] Udi Manber,et al. Approximate Multiple Strings Search , 1996, CPM.
[14] Erkki Sutinen,et al. Filtration with q-Samples in Approximate String Matching , 1996, CPM.
[15] Gonzalo Navarro,et al. A guided tour to approximate string matching , 2001, CSUR.