Relative Select
Christina Boucher, Alexander Bowe, Travis Gagie, Giovanni Manzini and, Jouni Sir\'en

TL;DR
This paper presents a method to efficiently perform select queries on related strings by leveraging existing support on one string and adding minimal extra information, aiding in the storage of coloured de Bruijn graphs.
Contribution
It introduces a technique to extend select query support from a single string to similar strings with minimal additional storage, improving data structure efficiency.
Findings
Supports fast select queries on related strings with minimal extra info
Enables efficient storage of coloured de Bruijn graphs
Reduces complexity of select operations on multiple strings
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · Genome Rearrangement Algorithms · Advanced Graph Theory Research
