Approximate string-matching with a single gap for sequence alignment

Abstract

This paper deals with the approximate string-matching problem with Hamming distance and a single gap for sequence alignment. We consider an extension of the approximate string-matching problem with Hamming distance, by also allowing the existence of a single gap, either in the text, or in the pattern. This problem is strongly and directly motivated by the… (More)
DOI: 10.1145/2147805.2147879

Topics

3 Figures and Tables

Cite this paper

@inproceedings{Flouri2011ApproximateSW, title={Approximate string-matching with a single gap for sequence alignment}, author={Tom{\'a}s Flouri and Kunsoo Park and Kimon Frousios and Solon P. Pissis and Costas S. Iliopoulos and German Tischler}, booktitle={BCB}, year={2011} }