Critical phenomena in sequence matching
From MaRDI portal
Publication:1064665
DOI10.1214/aop/1176992808zbMath0576.60058OpenAlexW2075823672WikidataQ104688468 ScholiaQ104688468MaRDI QIDQ1064665
Michael S. Waterman, Richard Arratia
Publication date: 1985
Published in: The Annals of Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aop/1176992808
Pattern recognition, speech recognition (68T10) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Measures of information, entropy (94A17)
Related Items (13)
A comparison of scores of two protein structures with foldings ⋮ A nonlinear measure of subalignment similarity and its significance levels ⋮ Weak runs in sequences of binary trials ⋮ Significance levels for biological sequence comparison using non-linear similarity functions ⋮ Runs, scans and urn model distributions: A unified Markov chain approach ⋮ A Probabilistic Analysis of a String Editing Problem and its Variations ⋮ Probabilistic Divide-and-Conquer: A New Exact Simulation Method, With Integer Partitions as an Example ⋮ On the shortest distance between orbits and the longest common substring problem ⋮ A phase transition for the minimum free energy of secondary structures of a random RNA ⋮ Path reversal, islands, and the gapped alignment of random sequences ⋮ Non-parametric change-point estimation using string matching algorithms ⋮ A Phase Transition for the Distribution of Matching Blocks ⋮ Longest common substring for random subshifts of finite type
This page was built for publication: Critical phenomena in sequence matching
