These are preliminary reports that have not been peer-reviewed. They should not be regarded as conclusive, guide clinical practice/health-related behavior, or be reported in news media as established information. For more information, please see our FAQs.
manuscript_mstmap_daniel_probst_v7.pdf (2.08 MB)

Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees

submitted on 21.08.2019, 07:32 and posted on 21.08.2019, 18:38 by Daniel Probst, Jean-Louis Reymond
Here, we introduce a new data visualization and exploration method, TMAP (tree-map), which exploits locality sensitive hashing, Kruskal’s minimum-spanning-tree algorithm, and a multilevel multipole-based graph layout algorithm to represent large and high dimensional data sets as a tree structure, which is readily understandable and explorable. Compared to other data visualization methods such as t-SNE or UMAP, TMAP increases the size of data sets that can be visualized due to its significantly lower memory requirements and running time and should find broad applicability in the age of big data. We exemplify TMAP in the area of cheminformatics with interactive maps for 1.16 million drug-like molecules from ChEMBL, 10.1 million small molecule fragments from FDB17, and 131 thousand 3D-structures of biomolecules from the PDB Databank, and to visualize data from literature (GUTENBERG data set), cancer biology (PANSCAN data set) and particle physics (MiniBooNE data set). TMAP is available as a Python package. Installation, usage instructions and application examples can be found at


NCCR TransCure - From transport physiology to identification of therapeutic targets

Swiss National Science Foundation

Find out more...


Email Address of Submitting Author


University of Bern



ORCID For Submitting Author


Declaration of Conflict of Interest

The authors declare no conflict of interest.