Classic alignment algorithms utilize scoring functions which maximize similarity or minimize edit distances. These scoring functions account for both insertion–deletion (indel) and substitution events. In contrast, alignments based on stochastic models aim to explicitly describe the evolutionary dynamics of sequences by inferring relevant probabilistic parameters from input sequences. Despite advances in stochastic modeling during the last two decades, scoring-based methods are still dominant, partially due to slow running times of probabilistic approaches. Alignment inference using stochastic models involves estimating the probability of events, such as the insertion or deletion of a specific number of characters. In this work, we present ...
Abstract Background Multiple sequence alignment is an important task in bioinformatics, and alignmen...
The Multiple Sequence Alignment (MSA) is a computational abstraction that represents a partial summa...
Sequences having low information content cause problems for standard algorithms, e.g. causing false-...
Classic alignment algorithms utilize scoring functions which maximize similarity or minimize edit di...
Motivation: The topic of this paper is the estimation of alignments and mutation rates based on stoc...
The statistical approach to molecular sequence evolution involves the stochastic modeling of the sub...
We present a new probabilistic model of sequence evolution, allowing indels of arbitrary length, and...
International audienceAlignment algorithms usually rely on simplified models of gaps for computation...
Comparison of sequences that have descended from a common ancestor based on an explicit stochastic m...
Abstract. A “semi-probabilistic ” alignment algorithm which combines ideas from Smith-Waterman and p...
The Multiple Sequence Alignment (MSA) is a computational abstraction that represents a partial summa...
The model of insertions and deletions in biological sequences, first formulated by Thorne, Kishino, ...
The Multiple Sequence Alignment (MSA) is a computational abstraction that represents a partial summa...
Summary: Sequences of proteins evolve by accumulating substitutions together with insertions and del...
<div><p>The Multiple Sequence Alignment (MSA) is a computational abstraction that represents a parti...
Abstract Background Multiple sequence alignment is an important task in bioinformatics, and alignmen...
The Multiple Sequence Alignment (MSA) is a computational abstraction that represents a partial summa...
Sequences having low information content cause problems for standard algorithms, e.g. causing false-...
Classic alignment algorithms utilize scoring functions which maximize similarity or minimize edit di...
Motivation: The topic of this paper is the estimation of alignments and mutation rates based on stoc...
The statistical approach to molecular sequence evolution involves the stochastic modeling of the sub...
We present a new probabilistic model of sequence evolution, allowing indels of arbitrary length, and...
International audienceAlignment algorithms usually rely on simplified models of gaps for computation...
Comparison of sequences that have descended from a common ancestor based on an explicit stochastic m...
Abstract. A “semi-probabilistic ” alignment algorithm which combines ideas from Smith-Waterman and p...
The Multiple Sequence Alignment (MSA) is a computational abstraction that represents a partial summa...
The model of insertions and deletions in biological sequences, first formulated by Thorne, Kishino, ...
The Multiple Sequence Alignment (MSA) is a computational abstraction that represents a partial summa...
Summary: Sequences of proteins evolve by accumulating substitutions together with insertions and del...
<div><p>The Multiple Sequence Alignment (MSA) is a computational abstraction that represents a parti...
Abstract Background Multiple sequence alignment is an important task in bioinformatics, and alignmen...
The Multiple Sequence Alignment (MSA) is a computational abstraction that represents a partial summa...
Sequences having low information content cause problems for standard algorithms, e.g. causing false-...