nVenn2: faster, simpler generalized quasi-proportional Venn diagrams

Motivation: Proportional Venn diagrams provide a compact representation of the relationships between sets. Each relationship is represented with a region whose area reflects the number of elements shared by a given combination of sets. This means that the number of regions grows exponentially with the number of sets, which is why proportional Venn diagrams with more than five sets are cumbersome to interpret and seldom used. However, Venn diagrams with a large number of sets may still be legible if enough regions are empty and do not need to be represented. Results: Here, we present nVenn2, the second version of the nVenn algorithm, to create quasi-proportional Venn diagrams. This new version uses a different, more flexible approach which includes steps to minimize the complexity of the diagram. Thus, computation time for nVenn2 mainly grows with the number of non-empty diagram regions, rather than with the number of sets. This property allows users to create interpretable quasi-proportional Venn diagrams with large numbers of sets. Availability and implementation: The nVenn2 algorithm is freely available as an executable program, as a web page, as an R package (nVennR2) and as a Python package (nVennPy). All interfaces allow users to edit the appearance of the resulting diagram.