Fig. 1From: Exact transcript quantification over splice graphsAn example construction of the Prefix Graph. The source and sink of the prefix graph are [S] and [T], respectively. The set of phasing paths \({\mathcal {P}}\) is shown in blue in the left panel, and we do not include the singleton paths for simplicity. We draw the trie and the fail edges for the a–c automaton as it reduces cluttering (dictionary suffix link can be derived from both edge sets). The colored nodes in prefix graph are the vertices (states) in AS(35) and AS(24)Back to article page