ArticleJournal of computational biology : a journal of computational molecular cell biology2016
MoCha: Molecular Characterization of Unknown Pathways.
Article in Journal of computational biology : a journal of computational molecular cell biology, 2016. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 7 papers.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
7 citing papers in PubMed.
- Computational Systems Biology of Morphogenesis.Methods in molecular biology (Clifton, N.J.) · 2022Article
- Formalizing Phenotypes of Regeneration.Methods in molecular biology (Clifton, N.J.) · 2022Article
- Inhibition of FGF and TGF-β Pathways in hESCs Identify STOX2 as a Novel SMAD2/4 Cofactor.Biology · 2020Article
- Fluxer: a web application to compute, analyze and visualize genome-scale metabolic flux networks.Nucleic acids research · 2020Article
- Planarian regeneration as a model of anatomical homeostasis: Recent progress in biophysical and computational approaches.Seminars in cell & developmental biology · 2019Review
- EDEn-Electroceutical Design Environment: Ion Channel Tissue Expression Database with Small Molecule Modulators.iScience · 2019Article
- PlanNET: homology-based predicted interactome for multiple planarian transcriptomes.Bioinformatics (Oxford, England) · 2018Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
3 authors.
Funding
Abstract
Automated methods for the reverse-engineering of complex regulatory networks are paving the way for the inference of mechanistic comprehensive models directly from experimental data. These novel methods can infer not only the relations and parameters of the known molecules defined in their input datasets, but also unknown components and pathways identified as necessary by the automated algorithms. Identifying the molecular nature of these unknown components is a crucial step for making testable predictions and experimentally validating the models, yet no specific and efficient tools exist to aid in this process. To this end, we present here MoCha (Molecular Characterization), a tool optimized for the search of unknown proteins and their pathways from a given set of known interacting proteins. MoCha uses the comprehensive dataset of protein-protein interactions provided by the STRING database, which currently includes more than a billion interactions from over 2,000 organisms. MoCha is highly optimized, performing typical searches within seconds. We demonstrate the use of MoCha with the characterization of unknown components from reverse-engineered models from the literature. MoCha is useful for working on network models by hand or as a downstream step of a model inference engine workflow and represents a valuable and efficient tool for the characterization of unknown pathways using known data from thousands of organisms. MoCha and its source code are freely available online under the GPLv3 license.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.