(Haskell based problem) Computational translations of Cartesian functions to pol
ID: 3863640 • Letter: #
Question
(Haskell based problem)
Computational translations of Cartesian functions to polar coordinates.
[32] Write a function r :: (Float -> Float) -> (Float -> Float) which accepts a function (call it y(x)), and translates it to a polar-coordinate function (call it r(t), where t is the angle theta). Since you only have access to t and y(x) in this function, you will have to use the Newton-Raphson method to find the particular x and y values corresponding to t [16]. Once you have these you can obtain a value for r [16]. Call this polar.hs.
Explanation / Answer
Reconstruction of gene regulatory networks (GRNs), which explicitly represent the causality of developmental or regulatory process, is of utmost interest and has become a challenging computational problem for understanding the complex regulatory mechanisms in cellular systems. However, all existing methods of inferring GRNs from gene expression profiles have their strengths and weaknesses. In particular, many properties of GRNs, such as topology sparseness and non-linear dependence, are generally in regulation mechanism but seldom are taken into account simultaneously in one computational method.
Results: In this work, we present a novel method for inferring GRNs from gene expression data considering the non-linear dependence and topological structure of GRNs by employing path consistency algorithm (PCA) based on conditional mutual information (CMI). In this algorithm, the conditional dependence between a pair of genes is represented by the CMI between them.
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.