Bit-Parallel Algorithm for the Block Variant of the Merged Longest Common Subsequence Problem

被引：2
|
作者：
Danek, Agnieszka [1 ]
Deorowicz, Sebastian [1 ]
机构：
[1] Silesian Tech Univ, Inst Informat, PL-44100 Gliwice, Poland
来源：
MAN-MACHINE INTERACTIONS 3 | 2014年 / 242卷
关键词：
sequence comparison; genome; longest common subsequence;
D O I：
10.1007/978-3-319-02309-0_18
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
The problem of comparison of genomic sequences is of great importance. There are various measures of similarity of sequences. One of the most popular is the length of the longest common subsequence (LCS). We propose the first bit-parallel algorithm for the variant of the LCS problem, block merged LCS, which was recently formulated in the studies on the whole genome duplication hypothesis. Practical experiments show that our proposal is from 10 to over 100 times faster than existing algorithms.
引用
收藏
页码：173 / 181
页数：9
相关论文
共 50 条
  • [31] Quantum algorithm for longest common subsequence
    Xu, Wen-Xu
    Liao, Ming-Hong
    Tien Tzu Hsueh Pao/Acta Electronica Sinica, 2007, 36 (SUPPL. 2): : 99 - 103
  • [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] Efficient merged longest common subsequence algorithms for similar sequences
    Tseng, Kuo-Tsung
    Chan, De-Sheng
    Yang, Chang-Biau
    Lo, Shou-Fu
    THEORETICAL COMPUTER SCIENCE, 2018, 708 : 75 - 90
  • [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] 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
  • [39] PARALLEL COMPUTATION OF LONGEST-COMMON-SUBSEQUENCE
    LU, M
    LECTURE NOTES IN COMPUTER SCIENCE, 1990, 468 : 383 - 394
  • [40] A coarse-grained multicomputer parallel algorithm for the sequential substring constrained longest common subsequence problem
    Tchendji, Vianney Kengne
    Tepiele, Hermann Bogning
    Onabid, Mathias Akong
    Myoupo, Jean Frederic
    Zeutouo, Jerry Lacmou
    PARALLEL COMPUTING, 2022, 111
12345