Graph explorer

Relative Select

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.

7 nodes6 linksoverview previewRelative Select
7 nodes6 links
Relative Select7 visible / 7 total nodes / 16 links
Co-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipAuthorshipAuthorshipAuthorshipAuthorshipTopic signalAuthorshipWRelative Selectpreprint / 2015AChristina BoucherResearcherAAlexander BoweResearcherATravis GagieResearcherAGiovanni ManziniResearcherTData Structures and Alg...3564 worksAJouni SirénResearcher
PaperSignal 106 links

Relative Select

preprint / 2015

Open