Related Experiment Videos
A simple method for aligning many protein sequences
1Department of Pure and Applied Chemistry, University of Strathclyde, Glasgow G1 1XL Scotland, United Kingdom. cbas25@strath.ac.uk
Journal of Chemical Information and Computer Sciences
|March 30, 2001
Summary
A modified Needleman-Wunsch algorithm efficiently generates large multiple-sequence alignments for similar proteins. This method is ideal for high-volume genomics research, improving sequence analysis and discovery.
Area of Science:
- Bioinformatics
- Computational Biology
- Genomics
Background:
- Multiple sequence alignment (MSA) is crucial for understanding protein evolution and function.
- Existing MSA methods can be computationally intensive for very large datasets.
Purpose of the Study:
- To present a computationally efficient extension of the Needleman-Wunsch algorithm for generating large-scale MSAs.
- To highlight the applicability of this technique in high-volume genomics projects.
Main Methods:
- A simple extension of the pairwise Needleman-Wunsch algorithm was developed.
- The algorithm was applied to generate multiple-sequence alignments of similar protein sequences.
Main Results:
- The extended algorithm enables the efficient generation of very large multiple-sequence alignments.
- The method is suitable for datasets where sequences exhibit similarity.
Conclusions:
- This extended Needleman-Wunsch approach offers an efficient solution for large-scale MSA generation.
- The technique has significant potential applications in high-throughput genomics research.