Supplementary methods (sections SM-1 through SM-9), Tables S1 through S4, and Figures S1 through S11. The sections of Supplementary methods describe methodological details on the (analytical and algorithmic) computations of local alignment probabilities (SM-1,2,3,4,5,9) and on the simulation analyses for validating the algorithm (SM-6,7,8). Tables S1-S4 show the results of some analyses. Figures S1, S2, S3 and S11 illustrate some important concepts. Figures S4 and S10 show the results of some analyses. Figures S5, S6, S7 and S8 explain the algorithm implemented in LOLIPOG. Figure S9 shows the phylogenetic trees used for the simulations. (PDF 12355Â kb
BackgroundDespite the long-anticipated possibility of putting sequence alignment on the same footing...
Sequence alignment is one of the most intensely studied problems in bioinformatics, and is an import...
Classic alignment algorithms utilize scoring functions which maximize similarity or minimize edit di...
Classic alignment algorithms utilize scoring functions which maximize similarity or minimize edit di...
The statistical approach to molecular sequence evolution involves the stochastic modeling of the sub...
Table S1. Comparison of mean sensitivity and mean specificity between HmmCleaner presets and PREQUAL...
Motivation: The topic of this paper is the estimation of alignments and mutation rates based on stoc...
Model selection of chromosome 1 alignment. Figure shows the time series plots of conservation level ...
We present a new probabilistic model of sequence evolution, allowing indels of arbitrary length, and...
Sequence analysis has during the last decade experience an increased emphasis on statistics. Unfortu...
The 10-taxon tree used in simulation 1c that was obtained by dividing each terminal taxon of the 5-t...
Molecular evolutionary biology allows us to look into the past by analyzing sequences of amino acids...
The Multiple Sequence Alignment (MSA) is a computational abstraction that represents a partial summa...
Background: A number of software packages are available to generate DNA multiple sequence alignments...
A fundamental task in sequence analysis is to calculate the probability of a multiple alignment give...
BackgroundDespite the long-anticipated possibility of putting sequence alignment on the same footing...
Sequence alignment is one of the most intensely studied problems in bioinformatics, and is an import...
Classic alignment algorithms utilize scoring functions which maximize similarity or minimize edit di...
Classic alignment algorithms utilize scoring functions which maximize similarity or minimize edit di...
The statistical approach to molecular sequence evolution involves the stochastic modeling of the sub...
Table S1. Comparison of mean sensitivity and mean specificity between HmmCleaner presets and PREQUAL...
Motivation: The topic of this paper is the estimation of alignments and mutation rates based on stoc...
Model selection of chromosome 1 alignment. Figure shows the time series plots of conservation level ...
We present a new probabilistic model of sequence evolution, allowing indels of arbitrary length, and...
Sequence analysis has during the last decade experience an increased emphasis on statistics. Unfortu...
The 10-taxon tree used in simulation 1c that was obtained by dividing each terminal taxon of the 5-t...
Molecular evolutionary biology allows us to look into the past by analyzing sequences of amino acids...
The Multiple Sequence Alignment (MSA) is a computational abstraction that represents a partial summa...
Background: A number of software packages are available to generate DNA multiple sequence alignments...
A fundamental task in sequence analysis is to calculate the probability of a multiple alignment give...
BackgroundDespite the long-anticipated possibility of putting sequence alignment on the same footing...
Sequence alignment is one of the most intensely studied problems in bioinformatics, and is an import...
Classic alignment algorithms utilize scoring functions which maximize similarity or minimize edit di...