About this example
This is the small named-list demonstration published in UpSetR’s Basic Usage vignette, converted to one binary membership row per element. It is a method demonstration, not a biological experiment. The three sets contain 9, 5 and 9 elements and have a union of 13.
A column with active dots in one and three but not two contains four elements. Those elements are counted only in that exact pattern. All three sets share two elements; the side bars count full set membership, so their totals overlap rather than adding to the union.
Sources: UpSetR Basic Usage — list and expression example
The data
| ID | one | two | three |
|---|---|---|---|
| 1 | 1 | 1 | 1 |
| 2 | 1 | 1 | 0 |
| 3 | 1 | 0 | 0 |
| 4 | 0 | 1 | 0 |
| 5 | 1 | 1 | 1 |
| 6 | 0 | 0 | 1 |
| 7 | 1 | 0 | 1 |
| 8 | 1 | 0 | 1 |
| 9 | 0 | 0 | 1 |
| 10 | 0 | 1 | 1 |
| 11 | 1 | 0 | 0 |
| 12 | 1 | 0 | 1 |
| 13 | 1 | 0 | 1 |
One unique element per row. Exact intersection counts use all membership flags; filters change only the visible columns. Open the example, replace the data with your own, and export the figure as SVG, PDF, PNG or TIFF.