Longest common subsequences and the Bernoulli matching model: numerical work and analyses of the r-reach simplification

Details Longest common subsequences and the Bernoulli matching model: numerical work and analyses of the r-reach simplification Longest common subsequences and the Bernoulli matching model: numerical work and analyses of the r-reach simplification

2004-12-19

arxiv.org/abs/math/0412375v1

Mathematics

Probability

20 pages

Scientific paper

The expected length of longest common subsequences is a problem that has been in the literature for at least twenty five years. Determining the limiting constants \gamma_k appears to be quite difficult, and the current best bounds leave much room for improvement. Boutet de Monvel explores an independent version of the problem he calls the Bernoulli Matching model. He explores this problem and its relation to the longest common subsequence problem. This paper continues this pursuit by focusing on a simplification we term r-reach. For the string model, L_r(u,v) is the longest common subsequence of u and v given that each matched pair of letters is no more than r letters apart.

Affiliated with

Also associated with

No associations

Rating

Longest common subsequences and the Bernoulli matching model: numerical work and analyses of the r-reach simplification does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Longest common subsequences and the Bernoulli matching model: numerical work and analyses of the r-reach simplification, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Longest common subsequences and the Bernoulli matching model: numerical work and analyses of the r-reach simplification will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-16888