An improved scoring matrix for multiple sequence alignment (Q1954834): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Pairwise alignment of the DNA sequence using hypercomplex number representation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An improved collapsed Gibbs sampler for Dirichlet process mixing models / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fast multiple alignment of ungapped DNA sequences using information theory and a relaxation method / rank | |||
Normal rank | |||
Latest revision as of 12:55, 6 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An improved scoring matrix for multiple sequence alignment |
scientific article |
Statements
An improved scoring matrix for multiple sequence alignment (English)
0 references
11 June 2013
0 references
Summary: 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 multiple sequence alignment. Alignments with equal scores are iteratively rescored with the joint weight matrix of increasing level (nucleotide pairs, triplets, and so on) until one single best alignment is eventually found. This method for resolving ambiguity in multiple sequence alignment can be easily implemented by use of the improved scoring matrix.
0 references
