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 条
  • [41] A hybrid genetic algorithm for the repetition free longest common subsequence problem
    Castelli, Mauro
    Beretta, Stefano
    Vanneschi, Leonardo
    OPERATIONS RESEARCH LETTERS, 2013, 41 (06) : 644 - 649
  • [42] A new practical linear space algorithm for the longest common subsequence problem
    Goeman, H
    Clausen, M
    KYBERNETIKA, 2002, 38 (01) : 45 - 66
  • [43] A diagonal-based algorithm for the longest common increasing subsequence problem
    Lo, Shou-Fu
    Tseng, Kuo-Tsung
    Yang, Chang-Biau
    Huang, Kuo-Si
    THEORETICAL COMPUTER SCIENCE, 2020, 815 : 69 - 78
  • [44] A HYBRID ALGORITHM FOR THE LONGEST COMMON TRANSPOSITION-INVARIANT SUBSEQUENCE PROBLEM
    Deorowicz, Sebastian
    Grabowski, Szymon
    COMPUTING AND INFORMATICS, 2009, 28 (05) : 729 - 744
  • [45] Parallel Longest Common SubSequence Analysis In Chapel
    Vahidi, Soroush
    Schieber, Baruch
    Du, Zhihui
    Bader, David A.
    2023 IEEE HIGH PERFORMANCE EXTREME COMPUTING CONFERENCE, HPEC, 2023,
  • [46] A hardness result and new algorithm for the longest common palindromic subsequence problem
    Inenaga, Shunsuke
    Hyyro, Heikki
    INFORMATION PROCESSING LETTERS, 2018, 129 : 11 - 15
  • [47] A Sub-Quadratic Algorithm for the Longest Common Increasing Subsequence Problem
    Duraj, Lech
    37TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2020), 2020, 154
  • [48] A Coarse-Grained Multicomputer algorithm for the longest common subsequence problem
    Garcia, T
    Myoupo, JF
    Semé, D
    ELEVENTH EUROMICRO CONFERENCE ON PARALLEL, DISTRIBUTED AND NETWORK-BASED PROCESSING, PROCEEDINGS, 2003, : 349 - 356
  • [49] Fast parallel algorithms for the longest common subsequence problem using an optical bus
    Xu, XH
    Chen, L
    Pan, Y
    He, P
    COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2005, PT 3, 2005, 3482 : 338 - 348
  • [50] OpenMP Implementation of Parallel Longest Common Subsequence Algorithm for Mathematical Expression Retrieval
    Perepu, Pavan Kumar
    PARALLEL PROCESSING LETTERS, 2021, 31 (02)
12345