Algorithms for the longest common subsequence problem for multiple strings based on geometric maxima

被引：0
|
作者：
Hakata, Koji [1 ]
Imai, Hiroshi [1 ]
机构：
[1] Department of Information Science, University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo 113-0033, Japan
来源：
Optimization Methods and Software | / 10卷 / 02期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
30
引用
收藏
页码：233 / 260
相关论文
共 50 条
  • [31] On the constrained longest common subsequence problem
    Gorbenko, A. (gorbenko.aa@gmail.com), 1600, International Association of Engineers (40):
  • [32] On the Longest Common Rigid Subsequence Problem
    Nikhil Bansal
    Moshe Lewenstein
    Bin Ma
    Kaizhong Zhang
    Algorithmica, 2010, 56 : 270 - 280
  • [33] On the longest common rigid subsequence problem
    Ma, B
    Zhang, KZ
    COMBINATORIAL PATTERN MATCHING, PROCEEDINGS, 2005, 3537 : 11 - 20
  • [34] The constrained longest common subsequence problem
    Tsai, YT
    INFORMATION PROCESSING LETTERS, 2003, 88 (04) : 173 - 176
  • [35] On the Longest Common Rigid Subsequence Problem
    Bansal, Nikhil
    Lewenstein, Moshe
    Ma, Bin
    Zhang, Kaizhong
    ALGORITHMICA, 2010, 56 (02) : 270 - 280
  • [36] The Longest Common Exemplar Subsequence Problem
    Zhang, Shu
    Wang, Ruizhi
    Zhu, Daming
    Jiang, Haitao
    Feng, Haodi
    Guo, Jiong
    Liu, Xiaowen
    PROCEEDINGS 2018 IEEE INTERNATIONAL CONFERENCE ON BIOINFORMATICS AND BIOMEDICINE (BIBM), 2018, : 92 - 95
  • [37] The longest common increasing subsequence problem
    Bai, YS
    Weems, BP
    Proceedings of the 8th Joint Conference on Information Sciences, Vols 1-3, 2005, : 362 - 366
  • [38] Efficient CGM-based parallel algorithms for the longest common subsequence problem with multiple substring-exclusion constraints
    Tchendji, Vianney Kengne
    Ngomade, Armel Nkonjoh
    Zeutouo, Jerry Lacmou
    Myoupo, Jean Frederic
    PARALLEL COMPUTING, 2020, 91
  • [39] Algorithms for the constrained longest common subsequence problems
    Arslan, AN
    Egecioglu, Ö
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2005, 16 (06) : 1099 - 1109
  • [40] Algorithms for computing the longest parameterized common subsequence
    Iliopoulos, Costas S.
    Kubica, Marcin
    Rahman, M. Sohel
    Walen, Tomasz
    COMBINATORIAL PATTERN MATCHING, PROCEEDINGS, 2007, 4580 : 265 - +
12345