Multiple sequence alignment with hierarchical clustering (original) (raw)

Journal Article

Laboratoire de Génétique Cellulaire, INRA Toulouse

BP 27, 31326 Castanet Tolosan, France

Search for other works by this author on:

Revision received:

14 October 1988

Accepted:

14 October 1988

Published:

25 November 1988

• PDF
• Split View
• • Article contents
  • Figures & tables
  • Video
  • Audio
  • Supplementary Data

Navbar Search Filter Mobile Enter search term Search

Abstract

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.

This content is only available as a PDF.

© IRL Press Ltd

I agree to the terms and conditions. You must accept the terms and conditions.

Submit a comment

Name

Affiliations

Comment title

Comment

You have entered an invalid code

Thank you for submitting a comment on this article. Your comment will be reviewed and published at the journal's discretion. Please check for further notifications by email.

Citations

Views

Altmetric

Metrics

Total Views 3,036

943 Pageviews

2,093 PDF Downloads

Since 1/1/2017

×

Email alerts

Citing articles via

• Latest

• Most Read

• Most Cited

More from Oxford Academic