Dissemin is shutting down on January 1st, 2025

Published in

F1000Research, F1000Research, (7), p. 195, 2018

DOI: 10.12688/f1000research.13925.3

F1000Research, F1000Research, (7), p. 195, 2018

DOI: 10.12688/f1000research.13925.2

F1000Research, F1000Research, (7), p. 195

DOI: 10.12688/f1000research.13925.1

Links

Tools

Export citation

Search in Google Scholar

BED: a Biological Entity Dictionary based on a graph data model

Journal article published in 2018 by Patrice Godard ORCID, Jonathan van Eyll ORCID
This paper is made freely available by the publisher.
This paper is made freely available by the publisher.

Full text: Download

Red circle
Preprint: archiving forbidden
Red circle
Postprint: archiving forbidden
Green circle
Published version: archiving allowed
Data provided by SHERPA/RoMEO

Abstract

The understanding of molecular processes involved in a specific biological system can be significantly improved by combining and comparing different data sets and knowledge resources. However, these information sources often use different identification systems and an identifier conversion step is required before any integration effort. Mapping between identifiers is often provided by the reference information resources and several tools have been implemented to simplify their use. However, most of these tools do not combine the information provided by individual resources to increase the completeness of the mapping process. Also, deprecated identifiers from former versions of databases are not taken into account. Finally, finding automatically the most relevant path to map identifiers from one scope to the other is often not trivial. The Biological Entity Dictionary (BED) addresses these three challenges by relying on a graph data model describing possible relationships between entities and their identifiers. This model has been implemented using Neo4j and an R package provides functions to query the graph but also to create and feed a custom instance of the database. This design combined with a local installation of the graph database and a cache system make BED very efficient to convert large lists of identifiers.