An extreme value theory for sequence matching
From MaRDI portal
Recommendations
Cited in
(21)- Asymptotics for local maximal stack scores with general loop penalty function
- Critical phenomena in sequence matching
- A nonlinear measure of subalignment similarity and its significance levels
- A comparison of scores of two protein structures with foldings
- Approximate word matches between two random sequences
- On the tail probability of the longest well-matching run.
- scientific article; zbMATH DE number 3963627 (Why is no real title available?)
- General methods of sequence comparison
- A Probabilistic Analysis of a String Editing Problem and its Variations
- Longest common substring for random subshifts of finite type
- An Eulerian path approach to local multiple alignment for DNA sequences
- A probabilistic approach to antigen-antibody recognition
- An accurate approximation to the distribution of the length of the longest matching word between two random DNA sequences
- Extreme value theory in some statistical analysis of genomic sequences
- Matching of observations of dynamical systems, with applications to sequence matching
- Maximum-likelihood estimation of the statistical distribution of Smith- Waterman local sequence similarity scores
- Significance levels for biological sequence comparison using non-linear similarity functions
- On the shortest distance between orbits and the longest common substring problem
- Poisson, compound Poisson and process approximations for testing statistical significance in sequence comparisons
- A Phase Transition for the Distribution of Matching Blocks
- Pattern matching between two non-aligned random sequences
This page was built for publication: An extreme value theory for sequence matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1081998)