From The Cover: An algorithm for progressive multiple alignment of sequences with

Explore this paper's citation graph

Summary

This work describes a modification of the traditional alignment algorithm that can distinguish insertion from deletion and avoid repeated penalization of insertions and illustrates this method with a pair hidden Markov model that uses an evolutionary scoring function.

Type
article
Published
2005-07-06
Cited by
919
References
0
Access
Open access

Keywords

Pairwise comparison, Dynamic programming, Algorithm, Multiple sequence alignment, Computer science

References

Cited by

Related papers