Succinct data structures for nearest colored node in a tree

被引：0
|
作者：
Tsur, Dekel [1 ]
机构：
[1] Ben Gurion Univ Negev, Dept Comp Sci, Beer Sheva, Israel
来源：
INFORMATION PROCESSING LETTERS | 2018年 / 132卷
关键词：
Succinct data structures; Labeled trees; Colored trees;
D O I：
10.1016/j.ipl.2017.10.001
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We give succinct data structures that store a tree with colors on the nodes. Given a node x and a color alpha, the structures find the nearest node to x with color alpha. Our results improve the O(n log n)-bits structure of Gawrychowski et al. (2016) [12]. (C) 2017 Elsevier B.V. All rights reserved.
引用
收藏
页码：6 / 10
页数：5
相关论文
共 50 条
  • [21] Application-Oriented Succinct Data Structures for Big Data
    Tetsuo Shibuya
    [J]. The Review of Socionetwork Strategies, 2019, 13 : 227 - 236
  • [22] Succinct colored de Bruijn graphs
    Muggli, Martin D.
    Bowe, Alexander
    Noyes, Noelle R.
    Morley, Paul S.
    Belk, Keith E.
    Raymond, Robert
    Gagie, Travis
    Puglisi, Simon J.
    Boucher, Christina
    [J]. BIOINFORMATICS, 2017, 33 (20) : 3181 - 3187
  • [23] A comparison study of succinct data structures for use in GWAS
    Putnam, Patrick P.
    Zhang, Ge
    Wilsey, Philip A.
    [J]. BMC BIOINFORMATICS, 2013, 14
  • [24] Succinct Data Structures in Information Retrieval: Theory and Practice
    Gog, Simon
    Venturini, Rossano
    [J]. SIGIR'16: PROCEEDINGS OF THE 39TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL, 2016, : 1231 - 1233
  • [25] Representation of Recipe Flow Graphs in Succinct Data Structures
    Namiki, Takuya
    Ozaki, Tomonobu
    [J]. CEA'19: PROCEEDINGS OF THE 11TH WORKSHOP ON MULTIMEDIA FOR COOKING AND EATING ACTIVITIES, 2019, : 29 - 32
  • [26] Cell Probe Lower Bounds For Succinct Data Structures
    Golynski, Alexander
    [J]. PROCEEDINGS OF THE TWENTIETH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2009, : 625 - 634
  • [27] Succinct data structures for approximating convex functions with applications
    Bose, P
    Devroye, L
    Morin, P
    [J]. DISCRETE AND COMPUTATIONAL GEOMETRY, 2002, 2866 : 97 - 107
  • [28] Hashing and Indexing: Succinct Data Structures and Smoothed Analysis
    Policriti, Alberto
    Prezza, Nicola
    [J]. ALGORITHMS AND COMPUTATION, ISAAC 2014, 2014, 8889 : 157 - 168
  • [29] Formal Verification of the rank Algorithm for Succinct Data Structures
    Tanaka, Akira
    Affeldt, Reynald
    Garrigue, Jacques
    [J]. FORMAL METHODS AND SOFTWARE ENGINEERING, ICFEM 2016, 2016, 10009 : 243 - 260
  • [30] A comparison study of succinct data structures for use in GWAS
    Patrick P Putnam
    Ge Zhang
    Philip A Wilsey
    [J]. BMC Bioinformatics, 14
12345