Abstract
Sequence comparison problems in molecular biology are briefly reviewed. Sequences are optimally aligned allowing for substitutions, insertions, and deletions. Dynamic programming algorithms solving these problems will be presented. So-called local algorithms finding best matching intervals between two sequences are best suited for database searches. A Poisson approximation method for rapid and accurate assignment of statistical significance will be presented.
This is a preview of subscription content, log in via an institution to check access.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Waterman, M.S. (1993). Sequence comparison and statistical significance in molecular biology. In: Lengauer, T. (eds) Algorithms—ESA '93. ESA 1993. Lecture Notes in Computer Science, vol 726. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57273-2_74
Download citation
DOI: https://doi.org/10.1007/3-540-57273-2_74
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57273-2
Online ISBN: 978-3-540-48032-7
eBook Packages: Springer Book Archive