A lower-variance randomized algorithm for approximate string matching
暂无分享,去创建一个
[1] Ricardo A. Baeza-Yates,et al. Fast and Practical Approximate String Matching , 1996, Inf. Process. Lett..
[2] Gad M. Landau,et al. Efficient String Matching with k Mismatches , 2018, Theor. Comput. Sci..
[3] Mikhail J. Atallah,et al. A Randomized Algorithm for Approximate String Matching , 2001, Algorithmica.
[4] Philippe Jacquet,et al. Pattern Matching with Mismatches: A Simple Randomized Algorithm and its Analysis , 1992 .
[5] Karl R. Abrahamson. Generalized String Matching , 1987, SIAM J. Comput..
[6] Howard J. Karloff. Fast Algorithms for Approximately Counting Mismatches , 1993, Inf. Process. Lett..
[7] Philippe Jacquet,et al. Pattern Matching With Mismatches: A Probabilistic Analysis and a Randomized Algorithm (Extended Abstract) , 1992, CPM.
[8] Gaston H. Gonnet,et al. A new approach to text searching , 1992, CACM.
[9] M. Fischer,et al. STRING-MATCHING AND OTHER PRODUCTS , 1974 .
[10] Tor Schoenmeyr,et al. FFT-based algorithms for the string matching with mismatches problem , 2005, J. Algorithms.
[11] Ayumi Shinohara,et al. A Note on Randomized Algorithm for String Matching with Mismatches , 2002, Nord. J. Comput..