A graph-theoretic model to solve the approximate string matching problem allowing for translocations

DOI10.1016/j.jda.2013.08.004zbMath1334.68309MaRDI QIDQ396701

Pritom Ahmed, M. Sohel Rahman, A. S. M. Shohidull Islam

Publication date: 13 August 2014

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2013.08.004

zbMATH Keywords

algorithms; graphs; pattern matching; approximate string matching; translocations

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

68W25: Approximation algorithms

68W32: Algorithms on strings