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 条
  • [1] BIT-PARALLEL ALGORITHMS FOR THE MERGED LONGEST COMMON SUBSEQUENCE PROBLEM
    Deorowicz, Sebastian
    Danek, Agnieszka
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2013, 24 (08) : 1281 - 1298
  • [2] Bit-Parallel Algorithm for the Constrained Longest Common Subsequence Problem
    Deorowicz, Sebastian
    FUNDAMENTA INFORMATICAE, 2010, 99 (04) : 409 - 433
  • [3] The Merged Longest Common Increasing Subsequence Problem
    Lee, Chien-Ting
    Yang, Chang-Biau
    Huang, Kuo-Si
    RECENT CHALLENGES IN INTELLIGENT INFORMATION AND DATABASE SYSTEMS, ACIIDS 2024, PT I, 2024, 2144 : 202 - 212
  • [4] An Efficient Parallel Algorithm for Longest Common Subsequence Problem on GPUs
    Yang, Jiaoyun
    Xu, Yun
    Shang, Yi
    WORLD CONGRESS ON ENGINEERING, WCE 2010, VOL I, 2010, : 499 - 504
  • [5] Parallel algorithms for the longest common subsequence problem
    Babu, KN
    Saxena, S
    FOURTH INTERNATIONAL CONFERENCE ON HIGH-PERFORMANCE COMPUTING, PROCEEDINGS, 1997, : 120 - 125
  • [6] PARALLEL ALGORITHMS FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM
    LU, M
    LIN, H
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1994, 5 (08) : 835 - 848
  • [7] A fast and practical bit-vector algorithm for the Longest Common Subsequence problem
    Crochemore, M
    Iliopoulos, CS
    Pinzon, YJ
    Reid, JF
    INFORMATION PROCESSING LETTERS, 2001, 80 (06) : 279 - 285
  • [8] A new algorithm for the longest common subsequence problem
    Xiang, Xuyu
    Zhang, Dafang
    Qin, Jiaohua
    CIS WORKSHOPS 2007: INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY WORKSHOPS, 2007, : 112 - 115
  • [9] A genetic algorithm for the longest common subsequence problem
    Hinkemeyer, Brenda
    Julstrorn, Bryant A.
    GECCO 2006: GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, VOL 1 AND 2, 2006, : 609 - +
  • [10] An improved algorithm for the longest common subsequence problem
    Mousavi, Sayyed Rasoul
    Tabataba, Farzaneh
    COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (03) : 512 - 520
12345