The rate of the convergence of the mean score in random sequence comparison

preprint2010arXivOpen access

Abstract

We consider a general class of super-additive scores measuring the similarity of two independent sequences of nn i.i.d. letters from a finite alphabet. Our object of interest is the mean score by letter lnl_n. By the subadditivity lnl_n is nondecreasing and converges to a limit ll. We give a simple method of bounding the difference l−lnl-l_n and obtaining the rate of convergence. Our result generalizes a previous result of Alexander, where only the special case of the longest common subsequence is considered.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.