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.
Cite
CITATION STYLE
Waterman, M. S. (1993). Sequence comparison and statistical significance in molecular biology. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 726 LNCS, p. 396). Springer Verlag. https://doi.org/10.1007/3-540-57273-2_74
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
