Abstract
In this chapter, we study the global sequence alignment problem based on an extension of dynamic programming. We provide a method to model this problem using a directed acyclic graph which allows us to describe all optimal solutions specific to a certain cost function. Furthermore, we can optimize sequence alignments successively relative to different optimization criteria.
Cite
CITATION STYLE
APA
AbouEisha, H., Amin, T., Chikalov, I., Hussain, S., & Moshkov, M. (2019). Global sequence alignment. In Intelligent Systems Reference Library (Vol. 146, pp. 253–259). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-319-91839-6_18
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free