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...
| 发表在: | ACM transactions on information systems. 14, 1 (1996). |
|---|---|
| 主要作者: | |
| 其他作者: | |
| 格式: | 文件 |
| 语言: | English |
| 主题: |