Abstract
We consider a general class of super-additive scores measuring the similarity of two independent sequences of i.i.d. letters from a finite alphabet. Our object of interest is the mean score by letter . By the subadditivity is nondecreasing and converges to a limit . We give a simple method of bounding the difference 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.
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.