Abstract

In this paper, we visit the problem of approximate string matching allowing for translocations. We study the graph theoretic model proposed by [5] and extending the model, devise an efficient algorithm to solve the approximate string matching allowing for translocations. The resulting algorithm is an adaptation of the classic shift-and algorithm. For patterns having length similar to the word-size of the target machine, the algorithm runs in O(n + mk 2) time for fixed length translocation where n, m and k are the length of the text, pattern and the translocation respectively.

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 call

Disclaimer: 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.