Reactome graph database: Efficient access to complex pathway data
Open accessThe DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Abstract
Reactome is a free, open-source, open-data, curated and peer-reviewed knowledgebase of biomolecular pathways. One of its main priorities is to provide easy and efficient access to its high quality curated data. At present, biological pathway databases typically store their contents in relational databases. This limits access efficiency because there are performance issues associated with queries traversing highly interconnected data. The same data in a graph database can be queried more efficiently. Here we present the rationale behind the adoption of a graph database (Neo4j) as well as the new ContentService (REST API) that provides access to these data. The Neo4j graph database and its query language, Cypher, provide efficient access to the complex Reactome data model, facilitating easy traversal and knowledge discovery. The adoption of this technology greatly improved query efficiency, reducing the average query time by 93%. The web service built on top of the graph database provides programmatic access to Reactome data by object oriented queries, but also supports more complex queries that take advantage of the new underlying graph-based data storage. By adopting graph database technology we are providing a high performance pathway data resource to the community. The Reactome graph database use case shows the power of NoSQL database engines for complex biological data types.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Reactome pathway Knowledgebase
Fabregat, A., Sidiropoulos, K., Garapati, P., Gillespie, M., Hausmann, K., Haw, R., Jassal, B., Jupe, S., Korninger, F., McKay, S., et al. (2016) · Nucleic Acids Research · doi:10.1093/nar/gkv1351 · Cited by 5,605
Self-citationReactome: a knowledge base of biologic pathways and processes
Vastrik, I., D'Eustachio, P., Schmidt, E., Joshi-Tope, G., Gopinath, G., Croft, D., de Bono, B., Gillespie, M., Jassal, B., Lewis, S., et al. (2007) · Genome Biology · doi:10.1186/gb-2007-8-3-r39 · Cited by 654
Self-citationRobinson, I., Webber, J., & Eifrém, E. (2013) · Cited by 479
The Mouse Genome Database (MGD): facilitating mouse as a model for human biology and disease
Eppig, J. T., Blake, J. A., Bult, C. J., Kadin, J. A., Richardson, J. E., & The Mouse Genome Database Group (2015) · Nucleic Acids Research · doi:10.1093/nar/gku967 · Cited by 357
A comparison of a graph database and a relational database: a data provenance perspective
Vicknair, C., Macias, M., Zhao, Z., Nan, X., Chen, Y., & Wilkins, D. (2010) · Proceedings of the 48th Annual Southeast Regional Conference · doi:10.1145/1900008.1900067 · Cited by 353
Birney, E. (2004) · Nucleic Acids Research · doi:10.1093/nar/gkh038 · Cited by 143
Representing and querying disease networks using graph databases
Lysenko, A., Roznovăţ, I. A., Saqi, M., Mazein, A., Rawlings, C. J., & Auffray, C. (2016) · BioData Mining · doi:10.1186/s13040-016-0102-8 · Cited by 103
Are graph databases ready for bioinformatics?
Have, C. T., & Jensen, L. J. (2013) · Bioinformatics · doi:10.1093/bioinformatics/btt549 · Cited by 94
Combining computational models, semantic annotations and simulation experiments in a graph database
Henkel, R., Wolkenhauer, O., & Waltemath, D. (2015) · Database · doi:10.1093/database/bau130 · Cited by 53
biochem4j: Integrated and extensible biochemical knowledge through graph databases
Swainston, N., Batista-Navarro, R., Carbonell, P., Dobson, P. D., Dunstan, M. S., Jervis, A. J., Vinaixa, M., Williams, A. R., Ananiadou, S., Faulon, J., et al. (2017) · PLoS ONE · doi:10.1371/journal.pone.0179130 · Cited by 51
Cited by
Non-coding RNA regulatory networks
Panni, S., Lovering, R. C., Porras, P., & Orchard, S. (2020) · Biochimica et Biophysica Acta (BBA) - Gene Regulatory Mechanisms · doi:10.1016/j.bbagrm.2019.194417 · Cited by 479
A knowledge graph to interpret clinical proteomics data
Santos, A., Colaço, A. R., Nielsen, A. B., Niu, L., Strauss, M., Geyer, P. E., Coscia, F., Albrechtsen, N. J. W., Mundt, F., Jensen, L. J., et al. (2022) · Nature Biotechnology · doi:10.1038/s41587-021-01145-6 · Cited by 295
Withnell, E., Zhang, X., Sun, K., & Guo, Y. (2021) · Briefings in Bioinformatics · doi:10.1093/bib/bbab315 · Cited by 106
Formatting biological big data for modern machine learning in drug discovery
Duran‐Frigola, M., Fernández‐Torras, A., Bertoni, M., & Aloy, P. (2019) · WIREs Computational Molecular Science · doi:10.1002/wcms.1408 · Cited by 25
miR-181a-5p is a potential candidate epigenetic biomarker in multiple sclerosis
Edgünlü, T. G., Yılmaz, Ş. G., Emre, U., Taşdelen, B., Kuru, O., Kutlu, G., & Erdal, M. E. (2022) · Genome · doi:10.1139/gen-2022-0040 · Cited by 14
(2024) · doi:10.1093/database/baae031 · Cited by 4
Metadata
- Authors
- Fabregat, A., Korninger, F., Viteri, G., Sidiropoulos, K., Marin-Garcia, P., Ping, P., Wu, G., Stein, L., D’Eustachio, P., & Hermjakob, H.
- Venue
- PLOS Computational Biology
- Publisher
- Public Library of Science (PLoS)
- Published
- 2018-01-29
- Volume
- 14
- Issue
- 1
- Pages
- e1005968
- ISSN
- 1553-734X (ISSN-L)
- 1553-7358
- OpenAlex
- W2786122698
- Cited by
- 283
- References
- 12
- FWCI
- 7.85
- Type
- journal article
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.