Optimality regions and fluctuations for Bernoulli last passage models
From MaRDI portal
(Redirected from Publication:1664580)
Abstract: We study the sequence alignment problem and its independent version, the discrete Hammersley process with an exploration penalty. We obtain rigorous upper bounds for the number of optimality regions in both models near the soft edge. At zero penalty the independent model becomes an exactly solvable model and we identify cases for which the law of the last passage time converges to a Tracy-Widom law.
Recommendations
- Macroscopic non-uniqueness and transversal fluctuation in optimal random sequence alignment
- Proportion of Gaps and Fluctuations of the Optimal Score in Random Sequence Comparison
- Publication:4731046
- Microscopic path structure of optimally aligned random sequences
- On the local fluctuations of last-passage percolation models
Cites work
- scientific article; zbMATH DE number 807194 (Why is no real title available?)
- scientific article; zbMATH DE number 3373691 (Why is no real title available?)
- scientific article; zbMATH DE number 2241899 (Why is no real title available?)
- A faster algorithm computing string edit distances
- A linear space algorithm for computing maximal common subsequences
- A scaling limit for queues in series
- A universality property for last-passage percolation paths close to the axis
- Algebraic Statistics for Computational Biology
- An approximation of partial sums of independent RV's, and the sample DF. II
- Bioinformatics and the Cell
- Bounds for parametric sequence comparison
- Brownian analogues of Burke's theorem.
- Closeness to the diagonal for longest common subsequences in random words
- Departures from many queues in series
- Discrete Hammersley's lines with sources and sinks
- Expected length of the longest common subsequence for large alphabets
- GUEs and queues
- Geodesics and the competition interface for the corner growth model
- Increasing sequences of independent points on the planar lattice
- Level-spacing distributions and the Airy kernel
- Limiting shape for directed percolation models
- Longest common subsequences of two random sequences
- Lower bounds for optimal alignments of binary sequences
- Optimal alignments of longest common subsequences and their path properties
- Parametric analysis of RNA branching configurations
- Parametric analysis of alignment and phylogenetic uncertainty
- Parametric inference for biological sequence analysis
- Parametric optimization of sequence alignment
- Soft edge results for longest increasing paths on the planar lattice
- Standard deviation of the longest common subsequence
- Stationary cocycles and Busemann functions for the corner growth model
- The Complexity of Some Problems on Subsequences and Supersequences
- Thermodynamical approach to the longest common subsequence problem
- Variational formulas and cocycle solutions for directed polymer and percolation models
Cited in
(4)
This page was built for publication: Optimality regions and fluctuations for Bernoulli last passage models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1664580)
