DisMaNET: A network-based tool to cross map disease vocabularies

Resumen

Background and Objectives The growing integration of healthcare sources is improving our understanding of diseases. Crossmapping resources such as UMLS play a very important role in this area, but their coverage is still incomplete. With the aim to facilitate the integration and interoperability of biological, clinical and literary sources in studies of diseases, we built DisMaNET, a system to cross-map terms from disease vocabularies by leveraging the power and intuitiveness of network analysis. Methods First, we collected and normalized data from 8 disease vocabularies and mapping sources to generate our datasets. Next, we built DisMaNET by integrating the generated datasets into a Neo4j graph database. Then we exploited the query mechanisms of Neo4j to cross-map disease terms of different vocabularies with a relevance score metric and contrasted the results with some state-of-the-art solutions. Finally, we made our system publicly available for its exploitation and evaluation both through a graphical user interface and REST APIs. Results DisMaNET contains almost half a million nodes and near nine hundred thousand edges, including hierarchical and mapping relationships. Its query capabilities enabled the detection of connections between disease vocabularies that are not present in major mapping sources such as UMLS and the Disease Ontology, even for rare diseases. Furthermore, DisMaNET was capable of obtaining more than 80% of the mappings with UMLS reported in MonDO and DisGeNET. Our tool was used successfully to complete the missing mappings in DISNET, a web-based system designed to extract knowledge from signs and symptoms retrieved from medical databases. Conclusions DisMaNET is a powerful, intuitive and publicly available system to cross-map terms from different disease vocabularies. Its completeness and the potential of network analysis make it a competitive alternative to existing mapping systems. Expansion with new sources, versioning and the improvement of the search and scoring algorithms are envisioned as future lines of work.