Hide navigation sidebar
Hide table of contents sidebar
Skip to content
Back to top
View this page
Toggle table of contents sidebar

# References

[Hyyro03]

Heikki Hyyrö. A bit-vector algorithm for computing levenshtein and damerau edit distances. Nordic J. of Computing, 10(1):29–39, mar 2003.

[Hyy04]

Heikki Hyyro. Bit-parallel lcs-length computation revisited. Proc. 15th Australasian Workshop on Combinatorial Algorithms (AWOCA 2004), pages, 08 2004.

[WF74]

Robert A. Wagner and Michael J. Fischer. The string-to-string correction problem. J. ACM, 21(1):168–173, jan 1974. URL: https://doi.org/10.1145/321796.321811, doi:10.1145/321796.321811.