Sequence comparison and statistical significance in molecular biology
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.