A graph-theoretic model to solve the approximate string matching problem allowing for translocations |
| |
Affiliation: | McMaster University;Kalasalingam University |
| |
Abstract: | In this paper, we study the approximate string matching problem under a string distance whose edit operations are translocations of equal length factors. We extend a graph-theoretic approach proposed by Rahman and Illiopoulos (2008) to model our problem. In the sequel, we devise efficient algorithms based on this model to solve a number of variants of the string matching problem with translocations. |
| |
Keywords: | Algorithms Pattern matching Translocations Graphs Approximate string matching |
本文献已被 ScienceDirect 等数据库收录! |