The Mathematical Institute, University of Oxford, Eprints Archive

Large deviation based upper bounds for the LCS-problem

Hauser, Raphael and Martinez, Servet and Matzinger, Heinrich (2003) Large deviation based upper bounds for the LCS-problem. Technical Report. Unspecified. (Submitted)

[img]
Preview
PDF
378Kb

Abstract

We analyse and apply a large deviation and Montecarlo simulation based method for the computation of improved upper bounds on the Chvatal-Sankoff constant for i.i.d. random sequences over a finite alphabet. Our theoretical results show that this method converges to the exact value of when a control parameter converges to infinity. We also give upper bounds on the complexity for numerically computing the Chvatal-Sankoff constant to any given precision via this method. Our numerical experiments confirm the theory and allow us to give new upper bounds that are correct to two digits.

Item Type:Technical Report (Technical Report)
Subjects:O - Z > Statistics
A - C > Biology and other natural sciences
A - C > Combinatorics
H - N > Numerical analysis
Research Groups:Numerical Analysis Group
ID Code:1195
Deposited By:Lotti Ekert
Deposited On:18 May 2011 08:12
Last Modified:18 May 2011 08:12

Repository Staff Only: item control page