Multiple sequence alignment with hierarchical clustering
Florence Corpet · Nucleic Acids Research · 1988
An algorithm is presented for the multiple alignment of sequences, either proteins or nucleic acids, that is both accurate and easy to use on microcomputers. The approach is based on the conventional dynamic-programming method of pairwise alignment. Initially, a hierarchical clustering of the sequences is performed using the matrix of the pairwise alignment scores. The closest sequences are aligned creating groups of aligned sequences. Then close groups are aligned until all sequences are aligned in one group. The pairwise alignments included in the multiple alignment form a new matrix that is used to produce a hierarchical clustering. If it is different from the first one, iteration of the process can be performed. The method is illustrated by an example: a global alignment of 39 sequences of cytochrome c.
Cited by 5,393 works. doi:10.1093/nar/16.22.10881
Authors
References
- A general method applicable to the search for similarities in the amino acid sequence of two proteins
- Rapid and Sensitive Protein Similarity Searches
- Progressive sequence alignment as a prerequisitetto correct phylogenetic trees
- Profile analysis: detection of distantly related proteins.
- A strategy for the rapid multiple alignment of protein sequences
- Simultaneous comparison of three protein sequences.
- A multiple sequence alignment program
- Multiple sequence alignment by a pairwise algorithm
- Frequency of insertion-deletion, transversion, and transition in the evolution of 5S ribosomal RNA
- Multiple sequence alignment