An extension of Ukkonen's enhanced dynamic programming ASM algorithm.
We describe an improvement on Ukkonen's Enhanced Dynamic Programming (EHD) approximate string-matching algorithm for unit-penalty four-edit comparisons. The new algorithm has an asymptotic complexity similar to that of Ukkonen's but is significantly faster due to a decrease in the number o...
| Izdano u: | ACM transactions on information systems. 14, 1 (1996). |
|---|---|
| Glavni autor: | |
| Daljnji autori: | |
| Format: | Članak |
| Jezik: | engleski |
| Teme: |