Dynamic programming for sequence and structure comparison and searching
Keywords: manual

Next: Pairwise comparison Up: Methods Previous: Methods Contents Index

#
Dynamic programming for sequence and structure comparison and searching

In this section, the basic dynamic programming method for sequence alignment is described [Š ali & Blundell, 1990]. This method forms the core of the pairwise and multiple sequence and structure comparisons as well as of the sequence database searching.

Subsections

- Pairwise comparison
- Variable gap penalty
- Local versus global alignment
- Similarity versus distance scores
- Multiple comparisons