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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Chikalov, I., Hussain, S., Moshkov, M., Odat, E.: Sequential optimization of global sequence alignments relative to different cost functions. In: ACM International Conference on Convergence and Hybrid Information Technology, ICHIT 2010, Daejeon, Korea, August 26–28, 2010. ACM (2010)
Levenshtein, V.I.: Binary codes capable of correcting deletions, insertions and reversals. Soviet Phys. Dokl. 10, 707–710 (1966)
Needleman, S.G., Wunsch, C.D.: A general method applicable to the search for similarities in the amino acid sequence of two proteins. J. Mol. Biol. 48, 443–453 (1970)
Setubal, J., Meidanis, J.: Introduction to Computational Molecular Biology. PWS Publishing, Boston (1997)
Waterman, M.S.: Introduction to Computational Biology: Sequences, Maps, and Genomes. Chapman and Hall, London (1995)
Waterman, M.S., Smith, T.F.: Identification of common molecular subsequences. J. Mol. Biol. 147, 195–197 (1981)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2019 Springer International Publishing AG, part of Springer Nature
About this chapter
Cite this chapter
AbouEisha, H., Amin, T., Chikalov, I., Hussain, S., Moshkov, M. (2019). Global Sequence Alignment. In: Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining. Intelligent Systems Reference Library, vol 146. Springer, Cham. https://doi.org/10.1007/978-3-319-91839-6_18
Download citation
DOI: https://doi.org/10.1007/978-3-319-91839-6_18
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-91838-9
Online ISBN: 978-3-319-91839-6
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)