Fast Algorithms for Local Similarity Queries Two Sequences

被引：0
|
作者：
Arslan, Abdullah N. [1 ]
机构：
[1] Texas A&M Univ, Dept Comp Sci & Informat Syst, Commerce, TX 75428 USA
来源：
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE | 2015年 / 26卷 / 05期
关键词：
String algorithm; string edit distance; longest common subsequence; dynamic programming; longest common extension; suffix tree; lowest common ancestor; suffix array; COMMON SUBSEQUENCE ALGORITHM; LONGEST; SEARCH; LCA;
D O I：
10.1142/S0129054115500355
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In sequence comparison, finding local similarities in given strings is a very important well-known problem. In this work we introduce two local sequence similarity query problems, and present algorithms for them. Our algorithms use a data structure that supports constant time longest common extension queries. This data structure is created only once, and in time linear in the size of the input strings. After this step all subsequent local similarity queries can be answered very fast. Existing algorithms take significantly more time in answering these queries.
引用
收藏
页码：625 / 642
页数：18
相关论文
共 50 条
  • [1] Fast indexes and algorithms for set similarity selection queries
    Hadjieleftheriou, Marios
    Chandel, Amit
    Koudas, Nick
    Srivastava, Divesh
    2008 IEEE 24TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING, VOLS 1-3, 2008, : 267 - +
  • [2] ALGORITHMS TO PROCESS DISTRIBUTED QUERIES IN FAST LOCAL NETWORKS
    YU, CT
    GUH, KC
    ZHANG, WN
    TEMPLETON, M
    BRILL, D
    CHEN, ALP
    IEEE TRANSACTIONS ON COMPUTERS, 1987, 36 (10) : 1153 - 1164
  • [3] Genetic algorithms for approximate similarity queries
    Bueno, Renato
    Traina, Agma J. M.
    Traina, Caetano, Jr.
    DATA & KNOWLEDGE ENGINEERING, 2007, 62 (03) : 459 - 482
  • [4] A new approach for similarity queries of biological sequences in databases
    Ng, Hoong Kee
    Ning, Kang
    Leong, Hon Wai
    ADVANCES IN KNOWLEDGE DISCOVERY AND DATA MINING, PROCEEDINGS, 2007, 4426 : 728 - +
  • [5] Algorithms for local forest similarity
    Peng, ZS
    ALGORITHMS AND COMPUTATION, 2005, 3827 : 704 - 713
  • [6] Fast algorithms for a class of temporal range queries
    Shi, QM
    Jaja, J
    ALGORITHMS AND DATA STRUCTURES, PROCEEDINGS, 2003, 2748 : 91 - 102
  • [7] Fast Similarity Retrieval of Vector Images Using Representative Queries
    Hayashi, Takahiro
    Sato, Akihiko
    2013 IEEE INTERNATIONAL SYMPOSIUM ON MULTIMEDIA (ISM), 2013, : 498 - 499
  • [8] Algorithms for local similarity between forests
    Zhewei Liang
    Kaizhong Zhang
    Journal of Combinatorial Optimization, 2014, 27 : 14 - 31
  • [9] Algorithms for local similarity between forests
    Liang, Zhewei
    Zhang, Kaizhong
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2014, 27 (01) : 14 - 31
  • [10] BTS: a fast approach for similarity search in sequences
    Jin, Bi
    Rong, Gang
    WCICA 2006: SIXTH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION, VOLS 1-12, CONFERENCE PROCEEDINGS, 2006, : 5933 - +
12345