Lecture notes in computer science: Multiple DNA sequence alignment using joint weight matrix

1Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The way for performing multiple sequence alignment is based on the criterion of the maximum scored information content computed from a weight matrix, but it is possible to have two or more alignments to have the same highest score leading to ambiguities in selecting the best alignment. This paper addresses this issue by introducing the concept of joint weight matrix to eliminate the randomness in selecting the best alignment of multiple sequences. Alignments with equal scores are iteratively re-scored with joint weight matrix of increasing level (nucleotide pairs, triplets and so on) until one single best alignment is eventually found. This method can be easily implemented to algorithms using weight matrix for scoring such as those based on the widely used Gibbs sampling method. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Shu, J. J., Yong, K. Y., & Chan, W. K. (2011). Lecture notes in computer science: Multiple DNA sequence alignment using joint weight matrix. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6784 LNCS, pp. 668–675). https://doi.org/10.1007/978-3-642-21931-3_51

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free