Thermodynamical Approach to the Longest Common Subsequence Problem

被引:0
作者
Saba Amsalu
Heinrich Matzinger
Marina Vachkovskaia
机构
[1] University of Bielefeld,School of Mathematics
[2] Georgia Institute of Technology,Instituto de Matemática, Estatística e Computação Científica
[3] Universidade de Campinas,undefined
来源
Journal of Statistical Physics | 2008年 / 131卷
关键词
Longest common subsequence; Interacting particle systems; Optimal sequence alignment;
D O I
暂无
中图分类号
学科分类号
摘要
We introduce an interacting particle model in a random media and show that this particle process is equivalent to the Longest Common Subsequence (LCS) problem of two binary sequences. We derive a differential equation which links the mean LCS-curve to the average speed of the particles given their density and prove that the average speed of the particles and density converges uniformly on every scale which is somewhat larger than  \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\sqrt{n}$\end{document} .
引用
收藏
页码:1103 / 1120
页数:17
相关论文
共 37 条
[1]  
Aldous D.(1995)Hammersley’s interacting particle process and longest increasing subsequences Probab. Theory Relat. Fields 103 199-213
[2]  
Diaconis P.(1994)The rate of convergence of the mean length of the longest common subsequence Ann. Appl. Probab. 4 1074-1082
[3]  
Alexander K.S.(2007)Lower bounds for the probability of macroscopical non-unique alignments ESAIM Probab. Stat. 11 281-300
[4]  
Amsalu S.(1994)A phase transition for the score in matching random sequences allowing deletions Ann. Appl. Probab. 4 200-225
[5]  
Matzinger H.(1999)Bounding the expected length of longest common subsequences and forests Theory Comput. Syst. 32 435-452
[6]  
Popov S.(1975)Longest common subsequences of two random sequences J. Appl. Probab. 12 306-315
[7]  
Arratia R.(1995)Upper bounds for the expected length of a longest common subsequence of two binary sequences Random Struct. Algorithms 6 449-458
[8]  
Waterman M.S.(1979)Some limit results for longest common subsequences Discrete Math. 26 17-31
[9]  
Baeza-Yates R.A.(2008)Approximation to the mean curve in the LCS problem Stoch. Process. Their Appl. 118 629-648
[10]  
Gavaldà R.(2006)Large deviation based upper bounds for the lcs-problem Adv. Appl. Probab. 38 827-852