pith. sign in

arxiv: 1506.03262 · v1 · pith:WD5KKAYTnew · submitted 2015-06-10 · 💻 cs.DS

Relative Select

classification 💻 cs.DS
keywords selectfastqueriesstringsupportalreadybruijncoloured
0
0 comments X
read the original abstract

Motivated by the problem of storing coloured de Bruijn graphs, we show how, if we can already support fast select queries on one string, then we can store a little extra information and support fairly fast select queries on a similar string.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.