Microscopic path structure of optimally aligned random sequences
From MaRDI portal
Publication:2278651
DOI10.3150/18-BEJ1053zbMath1464.60010MaRDI QIDQ2278651
Heinrich III Matzinger, Raphael Hauser
Publication date: 5 December 2019
Published in: Bernoulli (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.bj/1574758820
Convex programming (90C25) Strong limit theorems (60F15) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Combinatorial probability (60C05) Large deviations (60F10)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An Efron-Stein inequality for nonsymmetric statistics
- Kingman's subadditive ergodic theorem
- Subadditive ergodic theory
- The rate of convergence of the mean length of the longest common subsequence
- Probability on discrete structures
- Convex analysis and nonlinear optimization. Theory and examples
- Standard deviation of the longest common subsequence
- Microscopic path structure of optimally aligned random sequences
- An upper bound on the convergence rate of a second functional in optimal sequence alignment
- Letter change bias and local uniqueness in optimal sequence alignments
- Approximation to the mean curve in the LCS problem
- A Unifying Polyhedral Approximation Framework for Convex Optimization
- Methods for assessing the statistical significance of molecular sequence features by using general scoring schemes.
- Longest common subsequences of two random sequences
- A Monte Carlo Approach to the Fluctuation Problem in Optimal Alignments of Random Strings
- Large deviations-based upper bounds on the expected relative length of longest common subsequences
- On extreme points of regular convex sets
This page was built for publication: Microscopic path structure of optimally aligned random sequences
