bioRxiv Science⌕ Search

Biology subjects

Dameron, O.

Publications and source records attributed to Dameron, O..

4 recordsLinked to original sources

Refining Protein Co-Membership in Reactome: A Weighted Scoring Approach Based on Hierarchy and Sequences of Patwhays

In network biology, analyzing pathways is critical to study mechanisms or sequences of biological events. The pathway co-membership approach aims to link proteins belonging to the same pathway inside a network that is a clique. Although this method is great for projecting pathway knowledge onto proteins, it remains unsuitable for some downstream applications relying on graph distances like random walks with restart. To address this limitation, we introduce a weighted pathway co-membership method that incorporates biological distances between proteins. We achieve this by developing an abstraction framework for Reactome pathways, which captures both their hierarchical organization and sequential relationships. By assigning weights to these abstractions, we define a scoring system for proteins within the pathway co-membership clique. We illustrate our approach using a Reactome pathway ("Signaling by TGF-beta receptor complex", R-HSA-170834), and explain how we generate the weighted co-membership cliques of the 29 Reactome top-level pathways. Next, we construct the entire weighted pathway co membership network of the Reactome knowledge base. Validation and evaluation of our method is performed using cancer hallmark gene sets and a random walk with restart experiment, comparing our approach to state-of-the-art methods. We show that our approach outperforms state-of-the-art methods for gene prioritization on cancer hallmarks.

bioinformatics↗

BioPAX-Explorer: a Python Object-Oriented framework for overcoming the complexity of querying biological networks

MotivationBiological Pathway Exchange (BioPAX) is a standard language, represented in OWL, that aims to enable the integration, exchange, visualization and analysis of biological pathway data. While public databanks increasingly provide datasets in BioPAX format, their use remains below potential. Users may encounter challenges in harnessing the data due to the BioPAX intricately detailed underlying model. Moreover, extracting data demands specific technical skills, posing a barrier for many potential users. ResultsTo address these obstacles, we developped BioPAX-Explorer. This toolis designed to facilitate the adoption and usage of BioPAX for extracting data or build algorithms and models, within the Python community. BioPAX-Explorer is a Python package that provides an object-oriented data model automatically generated from the BioPAX OWL specification. Moreover, it offers expressive query capabilities that shield users from BioPAX inner complexity. BioPAX-Explorer supports dataset building features, validation facilities and pre-build queries. It simplifies the extraction and processing of data from BioPAX sources by automatically generating SPARQL queries. BioPAX-Explorer also offers a user-friendly interface for Python users, allowing exhaustive exploration of large datasets through features such as memory-efficient query execution, entity-oriented queries without the need for SPARQL knowledge. It also allows to learn and reuse complex SPARQL queries for biological network analysis. Additionally, BioPAX-Explorer can accelerate the development of Python-based network analysis software, since it generates graph data structures from BioPAX queries and facilitates the creation of transparent, reproducible workflows based on the BioPAX OWL standard. Availability and implementationBioPAX-Explorer is freely available. We provide the source code, documentation, installation instructions and a Jupyter notebook with tutorial at https://fjrmoreews.github.io/biopax-explorer/

bioinformatics↗

Reproducibility and reusability limitations in Regulatory Circuits: analysis and solutions

The Regulatory Circuits project is among the most recent and the most complete attempts to identify cell-type specific regulatory networks in Human. It is one of the largest efforts of public genomics data integration, based on data from the major consortia FANTOM5, ENCODE and Roadmap Epigenomics. This project is a main provider of biological data, cited more than 224 times (Google Scholar) and its resulting networks were used in at least 42 other articles. For such a general resource, reproducibility of both the outputs (regulation networks) and methods (data integration pipeline) is a major issue, since biological data are updated regularly. In addition, users may want to introduce new data into the Regulatory Circuits framework to provide networks about previously uncharacterized cell types or to add information about specific regulators, which require to re-execute the whole pipeline on the new data. In this article, we analyze the various factors limiting reproducibility of the Regulatory Circuits data and methods. Starting from a factual description of our understanding of the methods used in Regulatory Circuits, our contribution is two-fold: we propose (1) a characterization of the different levels of reusability, reproducibility and conceptual issues in the original workflow and (2) a new implementation of the workflow ensuring its consistency with the published description and allowing for an easier reuse and reproduction of the published outputs. Both are applicable beyond the case of Regulatory Circuits.

bioinformatics↗

Regulus, a transcriptional regulatory networks inference tool based on Semantic Web technologies

MotivationTranscriptional regulation is performed by transcription factors (TF) binding to DNA in context-dependent regulatory regions and determines the activation or inhibition of gene expression. Current methods of transcriptional regulatory networks inference, based on one or all of TF, regions and genes activity measurements require a large number of samples for ranking the candidate TF-gene regulation relations and rarely predict whether they are activations or inhibitions. We hypothesize that transcriptional regulatory networks can be inferred from fewer samples by (1) fully integrating information on TF binding, gene expression and regulatory regions accessibility, (2) reducing data complexity and (3) using biology-based logical constraints to determine the global consistency of the candidate TF-gene relations and qualify them as activations or inhibitions. ResultsWe introduce Regulus, a method which computes TF-gene relations from gene expressions, regulatory region activities and TF binding sites data, together with the genomic locations of all entities. After aggregating gene expressions and region activities into patterns, data are integrated into a RDF endpoint. A dedicated SPARQL query retrieves all potential relations between expressed TF and genes involving active regulatory regions. These TF-region-gene relations are then filtered using a logical consistency check translated from biological knowledge, also allowing to qualify them as activation or inhibition. Regulus compares favorably to the closest network inference method, provides signed relations consistent with public databases and, when applied to biological data, identifies both known and potential new regulators. Altogether, Regulus is devoted to transcriptional network inference in settings where samples are scarce and cell populations are closely related. Regulus is available at https://gitlab.com/teamDyliss/regulus

bioinformatics↗