scientific article
From MaRDI portal
Publication:3412988
zbMath1105.62021arXivmath/0410404MaRDI QIDQ3412988
Heinrich III Matzinger, Federico Bonetto
Publication date: 3 January 2007
Full work available at URL: https://arxiv.org/abs/math/0410404
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
longest common subsequencefirst passage problemsgraphs with correlated weightsLCS, fluctuationsrandom string matching
Point estimation (62F10) Combinatorics in computer science (68R05) Stochastic processes (60G99) Asymptotic enumeration (05A16) Statistical distribution theory (62E99)
Related Items (9)
On the variance of the optimal alignments score for binary random words and an asymmetric scoring function ⋮ Lower bounds on the generalized central moments of the optimal alignments score of random sequences ⋮ Non-normal limiting distribution for optimal alignment scores of strings in binary alphabets ⋮ Optimal alignments of longest common subsequences and their path properties ⋮ A central limit theorem for the length of the longest common subsequences in random words ⋮ Letter change bias and local uniqueness in optimal sequence alignments ⋮ Lower bounds for moments of global scores of pairwise Markov chains ⋮ Standard deviation of the longest common subsequence ⋮ Length of the Longest Common Subsequence between Overlapping Words
This page was built for publication:
