The Clustal Series of Programs for Multiple Sequence Alignment
- 2.2k Downloads
Sequence comparison or alignment is one of the fundamental tools in molecular biology. Alignments are used to search the sequence databases for homologous proteins, in the identification of conserved regions in a set of related sequences, for twodimensional (2-D)/3-D structure predictions, phylogenetic studies, and so on. The comparison of biological sequences began in the early seventies, with the first dynamic programming algorithm for the global (or full-length) alignment of two sequences (1). Dynamic programming is a rigorous mathematical technique that is guaranteed to find the maximal scoring alignment for any two sequences. The optimal local alignment between a pair of sequences, in which only the highest-scoring subsegments of the two sequences are aligned, involves a simple modification (2) to the Needleman-Wunsch method.
KeywordsMultiple Alignment Output File Dynamic Programming Algorithm Guide Tree Alignment Parameter
- 13.Page, R. D. (1996) TreeView: an application to display phylogenetic trees on personal computers. Comput. Appl. Biosci. 4, 357–358.Google Scholar