Abstract
Given a source and a target string, their swap–delete–edit distance is the minimum number of interchange-consecutive-symbols and delete operations applied to the source string to make it equal the target string. We show that the swap–delete–edit distance of strings over alphabets of bounded size can be computed in polynomial time.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
