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
CITATION STYLE
Allali, J., Chauve, C., & Bourgeade, L. (2015). Chaining fragments in sequences: To sweep or not. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9309, pp. 116–123). Springer Verlag. https://doi.org/10.1007/978-3-319-23826-5_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
