Considering optimal alignments of two i.i.d. random sequences of length n, we show that for Lebesgue-almost all scoring functions, almost surely the empirical distribution of aligned letter pairs in all optimal alignments converges to a unique limiting distribution as n tends to infinity. This result helps understanding the microscopic path structure of a special type of last-passage percolation problem with correlated weights, an area of long-standing open problems. Characterizing the microscopic path structure also yields robust alternatives to the use of optimal alignment scores alone for testing the homology of genetic sequences
We present a new stochastic method for finding the optimal alignment of DNA sequences. The method wo...
AbstractThe problem of sequence comparison via optimal alignments occurs naturally in many areas of ...
We study the problem of similarity detection by sequence alignment with gaps, using a recently estab...
Considering optimal alignments of two i.i.d. random sequences of length n, we show that for Lebesgue...
We investigate the behavior of optimal alignment paths for related and non-related random sequences....
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...
We propose a generating functional method--random path analysis (RPA)--that generalizes the classica...
4 pages Revtex, 2 .eps figures includedFinding analytically the statistics of the longest common sub...
The statistical properties of local alignment algorithms with gaps are analyzed theoretically for uu...
One of the oustanding open problems at the heart of gapped sequence alignment is the longest common ...
We study the problem of similarity detection by sequence alignment with gaps, using a recently estab...
The study and comparison of sequences of characters from a finite alphabet is relevant to various ar...
Lember J, Matzinger H, Vollmer A-L. Optimal alignments of longest common subsequences and their path...
We present a new stochastic method for finding the optimal alignment of DNA sequences. The method wo...
AbstractThe problem of sequence comparison via optimal alignments occurs naturally in many areas of ...
We study the problem of similarity detection by sequence alignment with gaps, using a recently estab...
Considering optimal alignments of two i.i.d. random sequences of length n, we show that for Lebesgue...
We investigate the behavior of optimal alignment paths for related and non-related random sequences....
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...
We propose a generating functional method--random path analysis (RPA)--that generalizes the classica...
4 pages Revtex, 2 .eps figures includedFinding analytically the statistics of the longest common sub...
The statistical properties of local alignment algorithms with gaps are analyzed theoretically for uu...
One of the oustanding open problems at the heart of gapped sequence alignment is the longest common ...
We study the problem of similarity detection by sequence alignment with gaps, using a recently estab...
The study and comparison of sequences of characters from a finite alphabet is relevant to various ar...
Lember J, Matzinger H, Vollmer A-L. Optimal alignments of longest common subsequences and their path...
We present a new stochastic method for finding the optimal alignment of DNA sequences. The method wo...
AbstractThe problem of sequence comparison via optimal alignments occurs naturally in many areas of ...
We study the problem of similarity detection by sequence alignment with gaps, using a recently estab...