A heuristic approximation to the score distribution of gapped alignments in the logarithmic domain is presented. The method applies to comparisons between random, unrelated protein sequences, using standard score matrices and arbitrary gap penalties. It is shown that gapped alignment behavior is essentially governed by a single parameter, alpha, depending on the penalty scheme and sequence composition. This treatment also predicts the position of the transition point between logarithmic and linear behavior. The approximation is tested by simulation and shown to be accurate over a range of commonly used substitution matrices and gap-penalties
The problem of determining the correct order of fluctuation of the optimal alignment score of two ra...
For as long as biologists have been computing alignments of sequences, the question of what values t...
The problem of determining the correct order of fluctuation of the optimal alignment score of two ra...
A heuristic approximation to the score distribution of gapped alignments in the logarithmic domain i...
A simple general approximation for the distribution of gapped local alignment scores is presented, s...
A simple general approximation for the distribution of gapped local alignment scores is presented, s...
Motivation: Although pairwise sequence alignment is essential in comparative genomic sequence analys...
International audienceAlignment algorithms usually rely on simplified models of gaps for computation...
International audienceWe propose a new method to approximate the signi cativity of gapped local sequ...
Given a set of homologous protein/DNA/RNA sequences, finding their multiple alignment means arrangin...
The search for similarity between two biological sequences lies at the core of many applications in ...
Rigorous computation methods are needed to unleash the power hidden in the DNA and protein sequences...
Assume that two sequences from a finite alphabet are optimally aligned according to a scoring system...
Summary: Sequences of proteins evolve by accumulating substitutions together with insertions and del...
The statistical properties of local alignment algorithms with gaps are analyzed theoretically for uu...
The problem of determining the correct order of fluctuation of the optimal alignment score of two ra...
For as long as biologists have been computing alignments of sequences, the question of what values t...
The problem of determining the correct order of fluctuation of the optimal alignment score of two ra...
A heuristic approximation to the score distribution of gapped alignments in the logarithmic domain i...
A simple general approximation for the distribution of gapped local alignment scores is presented, s...
A simple general approximation for the distribution of gapped local alignment scores is presented, s...
Motivation: Although pairwise sequence alignment is essential in comparative genomic sequence analys...
International audienceAlignment algorithms usually rely on simplified models of gaps for computation...
International audienceWe propose a new method to approximate the signi cativity of gapped local sequ...
Given a set of homologous protein/DNA/RNA sequences, finding their multiple alignment means arrangin...
The search for similarity between two biological sequences lies at the core of many applications in ...
Rigorous computation methods are needed to unleash the power hidden in the DNA and protein sequences...
Assume that two sequences from a finite alphabet are optimally aligned according to a scoring system...
Summary: Sequences of proteins evolve by accumulating substitutions together with insertions and del...
The statistical properties of local alignment algorithms with gaps are analyzed theoretically for uu...
The problem of determining the correct order of fluctuation of the optimal alignment score of two ra...
For as long as biologists have been computing alignments of sequences, the question of what values t...
The problem of determining the correct order of fluctuation of the optimal alignment score of two ra...