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 条
  • [21] A Coarse-Grained Parallel Algorithm for the All-Substrings Longest Common Subsequence Problem
    Carlos E.R. Alves
    Edson N. Caceres
    Siang Wun Song
    Algorithmica, 2006, 45 : 301 - 335
  • [22] A Polynomial Time Algorithm for a Generalized Longest Common Subsequence Problem
    Wang, Xiaodong
    Wu, Yingjie
    Zhu, Daxin
    GREEN, PERVASIVE, AND CLOUD COMPUTING, 2016, 9663 : 18 - 29
  • [23] A PGAS-based algorithm for the longest common subsequence problem
    Bakhouya, M.
    Serres, O.
    El-Ghazawi, T.
    EURO-PAR 2008 PARALLEL PROCESSING, PROCEEDINGS, 2008, 5168 : 654 - 664
  • [24] A scalable and efficient systolic algorithm for the longest common subsequence problem
    Lin, YC
    Yeh, JW
    JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, 2002, 18 (04) : 519 - 532
  • [25] A coarse-grained parallel algorithm for the all-substrings longest common subsequence problem
    Alves, Carlos E. R.
    Caceres, Edson N.
    Song, Siang Wun
    ALGORITHMICA, 2006, 45 (03) : 301 - 335
  • [26] ALGORITHMS FOR LONGEST COMMON SUBSEQUENCE PROBLEM
    HIRSCHBERG, DS
    JOURNAL OF THE ACM, 1977, 24 (04) : 664 - 675
  • [27] THE LONGEST COMMON SUBSEQUENCE PROBLEM REVISITED
    APOSTOLICO, A
    GUERRA, C
    ALGORITHMICA, 1987, 2 (03) : 315 - 336
  • [28] On the constrained longest common subsequence problem
    Gorbenko, A. (gorbenko.aa@gmail.com), 1600, International Association of Engineers (40):
  • [29] An exact bit-parallel algorithm for the maximum clique problem
    San Segundo, Pablo
    Rodriguez-Losada, Diego
    Jimenez, Agustin
    COMPUTERS & OPERATIONS RESEARCH, 2011, 38 (02) : 571 - 581
  • [30] A fast parallel longest common subsequence algorithm based on pruning rules
    Liu, Wei
    Chen, Yixin
    Chen, Ling
    Qin, Ling
    FIRST INTERNATIONAL MULTI-SYMPOSIUMS ON COMPUTER AND COMPUTATIONAL SCIENCES (IMSCCS 2006), PROCEEDINGS, VOL 1, 2006, : 27 - +
12345