Chaining fragments in sequences: to sweep or not
Data Structures and Algorithms
2015-06-25 v1
Abstract
Computing an optimal chain of fragments is a classical problem in string algorithms, with important applications in computational biology. There exist two efficient dynamic programming algorithms solving this problem, based on different principles. In the present note, we show how it is possible to combine the principles of two of these algorithms in order to design a hybrid dynamic programming algorithm that combines the advantages of both algorithms.
Cite
@article{arxiv.1506.07458,
title = {Chaining fragments in sequences: to sweep or not},
author = {Julien Allali and Laetitia Bourgeade and Cedric Chauve},
journal= {arXiv preprint arXiv:1506.07458},
year = {2015}
}
Comments
13 pages, 2 figures Longer version of an extended abstract to appear in the proceedings of SPIRE (String Processing and Information REtrieval) 2015