Faster Compressed Suffix Trees for Repetitive Text Collections

被引：0
|
作者：
Navarro, Gonzalo [1 ]
Ordonez, Alberto [2 ]
机构：
[1] Univ Chile, Dept Comp Sci, Santiago, Chile
[2] Univ A Coruna, Lab Bases Datos, Coruna, Spain
来源：
EXPERIMENTAL ALGORITHMS, SEA 2014 | 2014年 / 8504卷
关键词：
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
Recent compressed suffix trees targeted to highly repetitive text collections reach excellent compression performance, but operation times in the order of milliseconds. We design a new suffix tree representation for this scenario that still achieves very low space usage, only slightly larger than the best previous one, but supports the operations within microseconds. This puts the data structure in the same performance level of compressed suffix trees designed for standard text collections, which on repetitive collections use many times more space than our new structure.
引用
收藏
页码：424 / 435
页数：12
相关论文
共 50 条
  • [31] Faster Approximate Pattern Matching in Compressed Repetitive Texts
    Gagie, Travis
    Gawrychowski, Pawel
    Puglisi, Simon J.
    ALGORITHMS AND COMPUTATION, 2011, 7074 : 653 - +
  • [32] Computing MEMs and Relatives on Repetitive Text Collections
    Navarro, Gonzalo
    ACM Transactions on Algorithms, 2024, 21 (01)
  • [33] Text Analysis with Enhanced Annotated Suffix Trees: Algorithms and Implementation
    Dubov, Mikhail
    ANALYSIS OF IMAGES, SOCIAL NETWORKS AND TEXTS, AIST 2015, 2015, 542 : 308 - 319
  • [34] On suffix extensions in suffix trees
    Breslauer, Dany
    Italiano, Giuseppe F.
    THEORETICAL COMPUTER SCIENCE, 2012, 457 : 27 - 34
  • [35] Faster approximate string matching over compressed text
    Navarro, G
    Kida, T
    Takeda, M
    Shinohara, A
    Arikawa, S
    DCC 2001: DATA COMPRESSION CONFERENCE, PROCEEDINGS, 2001, : 459 - 468
  • [36] On Suffix Extensions in Suffix Trees
    Breslauer, Dany
    Italiano, Giuseppe F.
    STRING PROCESSING AND INFORMATION RETRIEVAL, 2011, 7024 : 301 - +
  • [37] Faster suffix sorting
    Larsson, N. Jesper
    Sadakane, Kunihiko
    THEORETICAL COMPUTER SCIENCE, 2007, 387 (03) : 258 - 272
  • [38] Contracted Suffix Trees: A Simple and Dynamic Text Indexing Data Structure
    Ehrenfeucht, Andrzej
    McConnell, Ross M.
    Woo, Sung-Whan
    COMBINATORIAL PATTERN MATCHING, PROCEEDINGS, 2009, 5577 : 41 - +
  • [39] From suffix trees to suffix vectors
    Prieur, Elise
    Lecroq, Thierry
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2006, 17 (06) : 1385 - 1402
  • [40] Compressed by the suffix tree
    Senft, Martin
    DCC 2006: DATA COMPRESSION CONFERENCE, PROCEEDINGS, 2006, : 183 - 192
12345