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 条
  • [21] PARALLEL ALGORITHMS FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM
    LU, M
    LIN, H
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1994, 5 (08) : 835 - 848
  • [22] An improved algorithm for the longest common subsequence problem
    Mousavi, Sayyed Rasoul
    Tabataba, Farzaneh
    COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (03) : 512 - 520
  • [23] A Hybrid Metaheuristic for the Longest Common Subsequence Problem
    Lozano, Manuel
    Blum, Christian
    HYBRID METAHEURISTICS, 2010, 6373 : 1 - +
  • [24] The constrained longest common subsequence problem for degenerate strings
    Iliopoulos, Costas
    Rahman, M. Sohel
    Voracek, Michal
    Vagner, Ladislav
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, 2007, 4783 : 309 - +
  • [25] Beam-ACO for the Longest Common Subsequence Problem
    Blum, Christian
    2010 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2010,
  • [26] Analysis of Evolutionary Algorithms for the Longest Common Subsequence Problem
    Jansen, Thomas
    Weyland, Dennis
    GECCO 2007: GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, VOL 1 AND 2, 2007, : 939 - +
  • [27] An efficient algorithm for the longest common palindromic subsequence problem
    Liang, Ting-Wei
    Yang, Chang-Biau
    Huang, Kuo-Si
    THEORETICAL COMPUTER SCIENCE, 2022, 922 : 475 - 485
  • [28] NEW SYSTOLIC ARRAYS FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM
    LIN, YC
    PARALLEL COMPUTING, 1994, 20 (09) : 1323 - 1334
  • [29] A new flexible algorithm for the longest common subsequence problem
    Rick, C
    COMBINATORIAL PATTERN MATCHING, 1995, 937 : 340 - 351
  • [30] High precision simulations of the longest common subsequence problem
    Bundschuh, R
    EUROPEAN PHYSICAL JOURNAL B, 2001, 22 (04): : 533 - 541