May 18, 2021 · We formulate a non-convex but analytically tractable optimization problem called OTTER. This problem can be interpreted as relaxed graph matching.
We formulate a non-convex but analytically tractable optimization problem called OTTER. This problem can be interpreted as relaxed graph matching.
Jun 24, 2020 · As we show, simple relaxed graph matching techniques outperform established GRN inference methods, which are detailed in the experiment section ...
Oct 22, 2024 · This problem can be interpreted as relaxed graph matching between the two projections of the bipartite network. OTTER's solutions can be derived ...
The regulation of genes, including under which conditions and to what degree they are expressed, defines a cell's to respond to environmental stimulus, helps ...
Here, we present a theoretical framework for PANDA, an established method for gene regulatory network inference. PANDA is based on iterative message passing ...
AbstractGene regulatory network inference is instrumental to the discovery of genetic mechanisms driving diverse diseases, including cancer.
People also ask
What is gene regulatory network inference?
What is the difference between a gene regulatory network and a gene coexpression network?
What is gene regulatory network analysis?
What is the gene regulatory network theory?
Gene Regulatory Network Inference as Relaxed Graph Matching. D. Weighill, M. Guebila, C. Lopes-Ramos, K. Glass, J. Quackenbush, J. Platig, and R. Burkholz.
Gene Regulatory Network Inference as Relaxed Graph Matching. Proceedings of the AAAI Conference on Artificial Intelligence, 35(11), 10263-10272. https://doi ...
A database for computationally-inferred, context-specific gene regulatory network models that can be compared between biological states.