Abstract
We present a new and more rigorous analysis of the two algorithms for two-dimensional approximate pattern matching due to Kärkkäinen and Ukkonen. We also present modifications of these algorithms that use less space while keeping the same expected time.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have