Skip to main content
. 2013 Jun 19;29(13):i71–i79. doi: 10.1093/bioinformatics/btt230

Fig. 4.

Fig. 4.

The bipartite graph for matching unbalanced vertices (Algorithm 2). On the top are the vertices with greater indegree, and on the bottom are the vertices with greater outdegree. Weights on the edges are the maximum overlap between the vertices’ sequences. Only the edges out of one vertex are drawn (the graph is a complete bipartite graph). Note that only unbalanced vertices corresponding to Inline graphic-long prefixes and suffixes of palindromes are included