An Improved Algorithm For Approximate String Matching

Zvi Galil; Kunsoo Park

doi:10.1137/0219067

journal article Open Access Dec 01, 1990

An Improved Algorithm For Approximate String Matching

Zvi Galil Kunsoo Park

SIAM Journal on Computing Vol. 19 No. 6 pp. 989-999 · Society for Industrial & Applied Mathematics (SIAM)

View at Publisher Save 10.1137/0219067

Topics

No keywords indexed for this article. Browse by subject →

References

9

[1]

10.1145/8307.8309

[2]

Data structures and algorithms for approximate string matching

Z Galil, R Giancarlo

Journal of Complexity 10.1016/0885-064x(88)90008-8

[3]

10.1137/0206024

[4]

10.1016/0022-0000(88)90045-1

[5]

10.1016/0196-6774(89)90010-2

[6]

10.1145/321879.321880

[7]

10.1016/0196-6774(84)90021-x

[8]

10.1016/s0019-9958(85)80046-2

[9]

The String-to-String Correction Problem

Robert A. Wagner, Michael J. Fischer

Journal of the ACM 10.1145/321796.321811

Cited By

103

A fast bit-vector algorithm for approximate string matching based on dynamic programming

GENE MYERS · 1999

Journal of the ACM

Sublinear approximate string matching and biological applications

W. I. Chang, E. L. Lawler · 1994

Algorithmica

Image analysis and computer vision: 1990

Azriel Rosenfeld · 1991

CVGIP: Image Understanding

Metrics

103

Citations

9

References

Details

Published: Dec 01, 1990
Vol/Issue: 19(6)
Pages: 989-999

Authors

Cite This Article

Zvi Galil, Kunsoo Park (1990). An Improved Algorithm For Approximate String Matching. SIAM Journal on Computing, 19(6), 989-999. https://doi.org/10.1137/0219067

An Improved Algorithm For Approximate String Matching

You May Also Like