Report

### Approximation to the mean curve in the LCS problem

Abstract:

The problem of sequence comparison via optimal alignments occurs naturally in many areas of applications. The simplest such technique is based on evaluating a score given by the length of a longest common subsequence divided by the average length of the original sequences. In this paper we investigate the expected value of this score when the input sequences are random and their length tends to infinity. The corresponding limit exists but is not known precisely. We derive a large-deviation, c...

Files:
• (pdf, 3.1mb)

### Authors

Clement Durringer More by this author
Raphael Hauser More by this author
Heinrich Matzinger More by this author
Publication date:
2006-01-05
URN:
uuid:07b98b3f-6948-4014-9dc3-9552fd050896
Local pid:
oai:eprints.maths.ox.ac.uk:1123