A sublinear algorithm for weakly approximating edit distance
Authors:
Open Access
- 9 June 2003
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 316-324
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Approximate string matching in sublinear expected time2002
- A sublinear algorithm for approximate keyword searchingAlgorithmica, 1994
- Introducing efficient parallelism into approximate string matching and a new serial algorithm1986
- A faster algorithm computing string edit distancesJournal of Computer and System Sciences, 1980