Long Common Subsequences and the Proximity of Two Random Strings

DOI10.1137/0142051MaRDI QIDQ3966873zbMATH OpenOpenAlexFDO

Authors J. Michael Steele

Publication date 1982

Published in SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://repository.upenn.edu/cgi/viewcontent.cgi?article=1050&context=oid_papers

zbMATH Keywords

common subsequencesEfron- Stein inequalitylong moleculessubadditive ergodic theory

Mathematics Subject Classification ID

Combinatorial probability (60C05) Stochastic processes (60G99) Statistical mechanics of polymers (82D60)

Cited in

(8)

• Cross-monotone subsequences
• Stanislaw M. Ulam's contributions to theoretical biology
• Asymptotic results on weakly increasing subsequences in random words
• Theoretical lower bound for border length minimization problem
• On an alternative sequence comparison statistic of Steele
• On the rate of convergence for the length of the longest common subsequences in hidden Markov models
• Matching probability between two aligned Markov dependent nucleic acid sequences while allowing d mutations. In honour of Joseph Glaz for his distinguished career and profound contributions to the field of applied probability and statistics
• Distribution of the length of the longest common subsequence of two multi-state biological sequences

This page was built for publication: Long Common Subsequences and the Proximity of Two Random Strings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3966873)