A sublinear algorithm for weakly approximating edit distance
暂无分享,去创建一个
Ronitt Rubinfeld | Joe Kilian | Funda Ergün | Sofya Raskhodnikova | Avner Magen | Tugkan Batu | Rahul Sami | J. Kilian | R. Sami | A. Magen | R. Rubinfeld | Sofya Raskhodnikova | Funda Ergün | Tugkan Batu | Rahul Sami
[1] Richard Cole,et al. Approximate string matching: a simpler faster algorithm , 2002, SODA '98.
[2] 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.
[3] Eugene W. Myers,et al. A sublinear algorithm for approximate keyword searching , 1994, Algorithmica.
[4] Uzi Vishkin,et al. Communication complexity of document exchange , 1999, SODA '00.
[5] Eugene L. Lawler,et al. Approximate string matching in sublinear expected time , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[6] Gad M. Landau,et al. Introducing efficient parallelism into approximate string matching and a new serial algorithm , 1986, STOC '86.
[7] Mike Paterson,et al. A Faster Algorithm Computing String Edit Distances , 1980, J. Comput. Syst. Sci..