Figure 2.
(a) By traversing the graph using a depth first search(DFS), we generate a sequence from the first visited start to end node path. (b) While traversing in DFS, when we encounter an outgoing edge that is already visited, only maintain a length L ā1 suffix. (c) While traversing in DFS, when we encounter an incoming edge that is already visited, only maintain a length Lā1 prefix. (d) For a pair of sequences(paths) with a prefix-suffix match, combine two sequences.