Sampled Longest Common Prefix Array

被引：0
|
作者：
Siren, Jouni [1 ]
机构：
[1] Univ Helsinki, Dept Comp Sci, FIN-00014 Helsinki, Finland
来源：
COMBINATORIAL PATTERN MATCHING, PROCEEDINGS | 2010年 / 6129卷
关键词：
COMPRESSED SUFFIX ARRAYS; TREES; DICTIONARIES;
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
When augmented with the longest common prefix (LCP) array and some other structures, the suffix array can solve many string processing problems in optimal time and space. A compressed representation of the LCP array is also one of the main building blocks in many compressed suffix tree proposals. In this paper, we describe a new compressed LCP representation: the sampled LCP array. We show that when used with a compressed suffix array (CSA), the sampled LCP array often offers better time/space trade-offs than the existing alternatives. We also show how to construct the compressed representations of the LCP array directly from a CSA.
引用
收藏
页码：227 / 237
页数：11
相关论文
共 50 条
  • [21] Parallel Suffix Array and Least Common Prefix for the GPU
    Deo, Mrinal
    Keely, Sean
    ACM SIGPLAN NOTICES, 2013, 48 (08) : 197 - 205
  • [22] New processor array architectures for the longest common subsequence problem
    Michailidis, PD
    Margaritis, KG
    JOURNAL OF SUPERCOMPUTING, 2005, 32 (01): : 51 - 69
  • [23] Extracting corpus-specific strings by using suffix arrays enhanced with longest common prefix
    Yoshida, Minoru, 1600, Springer Verlag (8870):
  • [24] Speeding up tandem mass spectrometry-based database searching by longest common prefix
    Zhou, Chen
    Chi, Hao
    Wang, Le-Heng
    Li, You
    Wu, Yan-Jie
    Fu, Yan
    Sun, Rui-Xiang
    He, Si-Min
    BMC BIOINFORMATICS, 2010, 11
  • [25] New Processor Array Architectures for the Longest Common Subsequence Problem
    Panagiotis D. Michailidis
    Konstantinos G. Margaritis
    The Journal of Supercomputing, 2005, 32 : 51 - 69
  • [26] Extracting Corpus-Specific Strings by Using Suffix Arrays Enhanced with Longest Common Prefix
    Yoshida, Minoru
    Matsumoto, Kazuyuki
    Xiao, Qingmei
    Keranmu, Xielifuguli
    Kita, Kenji
    Nakagawa, Hiroshi
    INFORMATION RETRIEVAL TECHNOLOGY, AIRS 2014, 2014, 8870 : 360 - 370
  • [27] Speeding up tandem mass spectrometry-based database searching by longest common prefix
    Chen Zhou
    Hao Chi
    Le-Heng Wang
    You Li
    Yan-Jie Wu
    Yan Fu
    Rui-Xiang Sun
    Si-Min He
    BMC Bioinformatics, 11
  • [28] Longest prefix matching using bloom filters
    Dharmapurikar, S
    Krishnamurthy, P
    Taylor, DE
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2006, 14 (02) : 397 - 409
  • [29] An Enhanced Bloom Filter for Longest Prefix Matching
    Park, Gahyun
    Kwon, Minseok
    2013 IEEE/ACM 21ST INTERNATIONAL SYMPOSIUM ON QUALITY OF SERVICE (IWQOS), 2013, : 157 - 162
  • [30] Longest prefix matching using bloom filters
    Dharmapurikar, S
    Krishnamurthy, P
    Taylor, DE
    ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2003, 33 (04) : 201 - 212
12345