Figure 2.
Principle of CoVennTree. (A) The algorithm starts with transforming the input path file into a rooted tree structure and computes weighted Venn diagrams for all leaves. (B) In a second step the parent weighted Venn diagram is computed by summing up all leaf weighted Venn diagrams. (C) In a final step all computed values for leaf diagrams are added up to the parent node until the root node is reached and the algorithm terminates.