PC Algorithm with the Principle of Mendelian Randomization
Adjust the columns of the input matrix same as in the reference matrix
Adjusted structural hamming distance (aSHD)
Comparison of inference accuracy using the same data but with differen...
Comparison of inference accuracy of different methods on data with and...
Cut a numeric variable into intervals
Perform edge orientation under the MRPC algorithm
Check empty matrix
Identifyprincipal components (PCs) that are significantly associated w...
Infer a graph skeleton (undirected graph)
Calculate the inverse matrix
Infer a causal network using the MRPC algorithm
Class of MRPC algorithm results
Plot a dendrogram and display node groups in colored modules
Plot a graph with nodes in modules indicated by colors
Calculate recall and precision for two graphs
Calculate robust correlation matrix
Deviation between two graphs represented by two sequences
Sequential FDR
Simulate data under certain graphs
Simulate data for a node with one parent
Simulate data for a node with two parents
Simulate data for a node with three parents
Simulate data for a node with no parent
A PC Algorithm with the Principle of Mendelian Randomization. This package implements the MRPC (PC with the principle of Mendelian randomization) algorithm to infer causal graphs. It also contains functions to simulate data under a certain topology, to visualize a graph in different ways, and to compare graphs and quantify the differences. See Badsha and Fu (2019) <doi:10.3389/fgene.2019.00460>,Badsha, Martin and Fu (2021) <doi:10.3389/fgene.2021.651812>.