Skip to main content
. Author manuscript; available in PMC: 2015 Jan 3.
Published in final edited form as: J Proteome Res. 2013 Jul 17;13(1):21ā€“28. doi: 10.1021/pr400294c

Figure 2.

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.

HHS Vulnerability Disclosure