Weighted Ancestors in Suffix Trees Revisited

02/28/2021
by   Djamal Belazzougui, et al.
0

The weighted ancestor problem is a well-known generalization of the predecessor problem to trees. It is known to require Ω(loglog n) time for queries provided O(npolylog n) space is available and weights are from [0..n], where n is the number of tree nodes. However, when applied to suffix trees, the problem, surprisingly, admits an O(n)-space solution with constant query time, as was shown by Gawrychowski, Lewenstein, and Nicholson (Proc. ESA 2014). This variant of the problem can be reformulated as follows: given the suffix tree of a string s, we need a data structure that can locate in the tree any substring s[p..q] of s in O(1) time (as if one descended from the root reading s[p..q] along the way). Unfortunately, the data structure of Gawrychowski et al. has no efficient construction algorithm, limiting its wider usage as an algorithmic tool. In this paper we resolve this issue, describing a data structure for weighted ancestors in suffix trees with constant query time and a linear construction algorithm. Our solution is based on a novel approach using so-called irreducible LCP values.

READ FULL TEXT

page 1

page 3

page 5

page 7

page 8

page 9

page 11

page 13

research
02/02/2023

Optimal Heaviest Induced Ancestors

We revisit the Heaviest Induced Ancestors (HIA) problem that was introdu...
research
09/16/2022

Fast approximation of search trees on trees with centroid trees

Search trees on trees (STTs) generalize the fundamental binary search tr...
research
06/13/2022

KATKA: A KRAKEN-like tool with k given at query time

We describe a new tool, KATKA, that stores a phylogenetic tree T such th...
research
09/05/2018

Randomized Incremental Construction of Net-Trees

Net-trees are a general purpose data structure for metric data that have...
research
05/22/2020

Still Simpler Static Level Ancestors

A level-ancestor or LA query about a rooted tree T takes as arguments a ...
research
06/09/2015

Self Organizing Maps Whose Topologies Can Be Learned With Adaptive Binary Search Trees Using Conditional Rotations

Numerous variants of Self-Organizing Maps (SOMs) have been proposed in t...
research
06/18/2012

Approximate Principal Direction Trees

We introduce a new spatial data structure for high dimensional data call...

Please sign up or login with your details

Forgot password? Click here to reset