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
来源
关键词
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
相关论文
共 50 条
  • [41] An Efficient Systolic Algorithm for the Longest Common Subsequence Problem
    Yen-Chun Lin
    Jyh-Chian Chen
    The Journal of Supercomputing, 1998, 12 : 373 - 385
  • [42] An A* search algorithm for the constrained longest common subsequence problem
    Djukanovic, Marko
    Berger, Christoph
    Raidl, Gunther R.
    Blum, Christian
    INFORMATION PROCESSING LETTERS, 2021, 166
  • [43] FAST ALGORITHM FOR THE LONGEST-COMMON-SUBSEQUENCE PROBLEM
    MUKHOPADHYAY, A
    INFORMATION SCIENCES, 1980, 20 (01) : 69 - 82
  • [44] Probabilistic beam search for the longest common subsequence problem
    Blum, Christian
    Blesa, Maria J.
    ENGINEERING STOCHASTIC LOCAL SEARCH ALGORITHMS: DESIGNING, IMPLEMENTING AND ANALYZING EFFECTIVE HEURISTICS, 2007, 4638 : 150 - +
  • [45] Anytime algorithms for the longest common palindromic subsequence problem
    Djukanovic, Marko
    Raidl, Guenther R.
    Blum, Christian
    COMPUTERS & OPERATIONS RESEARCH, 2020, 114
  • [46] Lower bounds and parameterized approach for longest common subsequence
    Huang, Xiuzhen
    COMPUTING AND COMBINATORICS, PROCEEDINGS, 2006, 4112 : 136 - 145
  • [47] Cyclic longest common subsequence
    Naiman, Aaron E.
    Farber, Eliav
    Stein, Yossi
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2023, 15 (04)
  • [48] The longest common subsequence problem for arc-annotated sequences
    Jiang, T
    Lin, GH
    Ma, B
    Zhang, KZ
    COMBINATORIAL PATTERN MATCHING, 2000, 1848 : 154 - 165
  • [49] Another efficient systolic algorithm for the longest common subsequence problem
    Lin, YC
    Chen, JC
    JOURNAL OF THE CHINESE INSTITUTE OF ENGINEERS, 2000, 23 (05) : 607 - 613
  • [50] Formal Derivation of the Longest Common Subsequence Problem with PAR Method
    Sun, Lingyu
    Leng, Ming
    2009 INTERNATIONAL CONFERENCE ON INFORMATION MANAGEMENT, INNOVATION MANAGEMENT AND INDUSTRIAL ENGINEERING, VOL 1, PROCEEDINGS, 2009, : 123 - 125