Compressed indexes for string searching in labeled graphs

被引：0
|
作者：
Dipartimento di Informatica, University of Pisa, Italy [1 ]
机构：
来源：
Proc. Int. Conf. World Wide Web, WWW | / 322-332期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Indexing (of information)
引用
收藏
相关论文
共 50 条
  • [41] Fast edge searching and fast searching on graphs
    Yang, Boting
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (12-14) : 1208 - 1219
  • [42] Significant discrepancies were found in pooled estimates of searching with Chinese indexes versus searching with English indexes
    Xue, Jing
    Chen, Wenhang
    Chen, Lizhang
    Gaudet, Laura
    Moher, David
    Walker, Mark
    Wen, Shi Wu
    JOURNAL OF CLINICAL EPIDEMIOLOGY, 2016, 70 : 246 - 253
  • [43] STRING GRAPHS .2. RECOGNIZING STRING GRAPHS IS NP-HARD
    KRATOCHVIL, J
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1991, 52 (01) : 67 - 78
  • [44] Compressed text indexes with fast locate
    Gonzalez, Rodrigo
    Navarro, Gonzalo
    COMBINATORIAL PATTERN MATCHING, PROCEEDINGS, 2007, 4580 : 216 - +
  • [45] Compressed Indexes for Approximate Library Management
    Hon, Wing-Kai
    Wu, Winson
    Yang, Ting-Shuo
    2010 DATA COMPRESSION CONFERENCE (DCC 2010), 2010, : 534 - 534
  • [46] Compressed indexes for fast search in sequences
    Grossi, R
    Vitter, JS
    PROCEEDINGS OF THE 6TH JOINT CONFERENCE ON INFORMATION SCIENCES, 2002, : 44 - 47
  • [47] Compressed Indexes for Aligned Pattern Matching
    Thankachan, Sharma V.
    STRING PROCESSING AND INFORMATION RETRIEVAL, 2011, 7024 : 410 - 419
  • [48] Compressed Indexes for Dynamic Text Collections
    Chan, Ho-Leung
    Hon, Wing-Kai
    Lam, Tak-Wah
    Sadakane, Kunihiko
    ACM TRANSACTIONS ON ALGORITHMS, 2007, 3 (02)
  • [49] Compressed full-text indexes
    Navarro, Gonzalo
    Makinen, Veli
    ACM COMPUTING SURVEYS, 2007, 39 (01)
  • [50] Searching dynamic communities with personal indexes
    Löser, A
    Tempich, C
    Quilitz, B
    Balke, WT
    Staab, S
    Nejdl, W
    SEMANTIC WEB - ISWC 2005, PROCEEDINGS, 2005, 3729 : 491 - 505
12345