A novel randomized iterative strategy for aligning multiple protein sequences

Explore this paper's citation graph

Summary

This work randomly divides a group of unaligned sequences into two subgroups, between which an optimal alignment is obtained by a Needleman-Wunsch style of algorithm, which modifies the intensive computer storage and time requirements of dynamic programming.

Type
article
Published
1991-10-01
Cited by
119
References
17

Keywords

Pairwise comparison, Computer science, Dynamic programming, Multiple sequence alignment, Programming style

References

Cited by

Related papers