Add to ORKGWe investigate the variance of the optimal alignment score of two independent iid binary, with parameter 1=2, sequences of length n. The scoring function is such that one letter has a somewhat larger score than the other letter. In this setting, we prove that the variance is of order n, and this conrms Waterman's conjecture in this case.
This thesis has been motivated by the problem of assessing the statistical significance of the outco...
A heuristic approximation to the score distribution of gapped alignments in the logarithmic domain i...
Alignment algorithms are powerful tools for searching for homologous proteins in databases, providin...
Consider finite sequences X[1,n] = X1,...,Xn and Y[1,n] = Y1,...,Yn of length n, consisting of i.i.d...
The problem of determining the correct order of fluctuation of the optimal alignment score of two ra...
The problem of determining the correct order of fluctuation of the optimal alignment score of two ra...
AbstractThis paper analyzes the computational complexity of computing the optimal alignment of a set...
We looked at various alignment algorithms with different scoring schemes. We argued that the score o...
Considering optimal alignments of two i.i.d. random sequences of length n, we show that for Lebesgue...
Abstract. A “semi-probabilistic ” alignment algorithm which combines ideas from Smith-Waterman and p...
We present a new machine learning approach to the inverse parametric sequence alignment problem: giv...
The aim of this thesis is to generalize the results from the article [LMT] for the score of mismatch...
We examine the distribution of the global maximum of an independent superadditive process with negat...
In this paper we consider the problem of sequence alignment with quality scores. DNA sequences produ...
AbstractWe consider the problem of computing a global alignment between two or more sequences subjec...
This thesis has been motivated by the problem of assessing the statistical significance of the outco...
A heuristic approximation to the score distribution of gapped alignments in the logarithmic domain i...
Alignment algorithms are powerful tools for searching for homologous proteins in databases, providin...
Consider finite sequences X[1,n] = X1,...,Xn and Y[1,n] = Y1,...,Yn of length n, consisting of i.i.d...
The problem of determining the correct order of fluctuation of the optimal alignment score of two ra...
The problem of determining the correct order of fluctuation of the optimal alignment score of two ra...
AbstractThis paper analyzes the computational complexity of computing the optimal alignment of a set...
We looked at various alignment algorithms with different scoring schemes. We argued that the score o...
Considering optimal alignments of two i.i.d. random sequences of length n, we show that for Lebesgue...
Abstract. A “semi-probabilistic ” alignment algorithm which combines ideas from Smith-Waterman and p...
We present a new machine learning approach to the inverse parametric sequence alignment problem: giv...
The aim of this thesis is to generalize the results from the article [LMT] for the score of mismatch...
We examine the distribution of the global maximum of an independent superadditive process with negat...
In this paper we consider the problem of sequence alignment with quality scores. DNA sequences produ...
AbstractWe consider the problem of computing a global alignment between two or more sequences subjec...
This thesis has been motivated by the problem of assessing the statistical significance of the outco...
A heuristic approximation to the score distribution of gapped alignments in the logarithmic domain i...
Alignment algorithms are powerful tools for searching for homologous proteins in databases, providin...