Daou Posted November 23, 2019 Posted November 23, 2019 For the string correction problem, we are given 2 strings X and Y with a parameter k and asked whether X can be turned into Y by at most k edit operations. Assume that allowed operations are (i) deleting a simple character and (ii) swapping 2 consecutive characters. Give an algorithm that solve the problem in O(2^k n ) where n is the length of X.(java)
Recommended Posts
Create an account or sign in to comment
You need to be a member in order to leave a comment
Create an account
Sign up for a new account in our community. It's easy!
Register a new accountSign in
Already have an account? Sign in here.
Sign In Now