Exploiting Genomic Relations in Big Data Repositories by Graph-Based Search Methods

2Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

We are living at a time that allows the generation of mass data in almost any field of science. For instance, in pharmacogenomics, there exist a number of big data repositories, e.g., the Library of Integrated Network-based Cellular Signatures (LINCS) that provide millions of measurements on the genomics level. However, to translate these data into meaningful information, the data need to be analyzable. The first step for such an analysis is the deliberate selection of subsets of raw data for studying dedicated research questions. Unfortunately, this is a non-trivial problem when millions of individual data files are available with an intricate connection structure induced by experimental dependencies. In this paper, we argue for the need to introduce such search capabilities for big genomics data repositories with a specific discussion about LINCS. Specifically, we suggest the introduction of smart interfaces allowing the exploitation of the connections among individual raw data files, giving raise to a network structure, by graph-based searches.

Cite

CITATION STYLE

APA

Musa, A., Dehmer, M., Yli-Harja, O., & Emmert-Streib, F. (2019). Exploiting Genomic Relations in Big Data Repositories by Graph-Based Search Methods. Machine Learning and Knowledge Extraction, 1(1), 205–210. https://doi.org/10.3390/make1010012

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free