r-indexing Wheeler graphs

01/29/2021

∙

by   Travis Gagie, et al.

∙

0

∙

share

Let G be a Wheeler graph and r be the number of runs in a Burrows-Wheeler Transform of G, and suppose G can be decomposed into υ edge-disjoint directed paths whose internal vertices each have in- and out-degree exactly 1. We show how to store G in O (r + υ) space such that later, given a pattern P, in O (|P| loglog |G|) time we can count the vertices of G reachable by directed paths labelled P, and then report those vertices in O (loglog |G|) time per vertex.