Become an expert in R — Interactive courses, Cheat Sheets, certificates and more!
Get Started for Free

msas

Identify minimal sufficient adjustment sets.


Description

Evaluates DAG adjustment sets identified by a dag.search (or brute.search) for minimal sufficiency by counting for each sufficient adjustment set A how many smaller sufficient ones that are contained in A exist.

Usage

msas(adjSets)

Arguments

adjSets

The searchRes component of a DAG (or the output of brute.search, which is used by dag.adjust to produce searchRes).

Value

A vector containing a -1 for each insufficient adjustment set, and for sufficient ones the number of smaller sufficient ones contained in it.

Author(s)

Lutz P Breitling <l.breitling@posteo.de>

References

Breitling LP (2010). dagR: a suite of R functions for directed acyclic graphs. Epidemiology 21(4):586-587.
Greenland S, Pearl J, Robins JM (1999). Causal diagrams for epidemiologic reserach. Epidemiology 10(1):37-48.
Kn\"uppel S, Stang A (2010). DAG Program: identifying minimal sufficient adjustment sets. Epidemiology 21(1):159.

See Also

Examples

d3<-demo.dag3();
d3s<-dag.search(d3);
msas(d3s$searchRes);
bs<-brute.search(d3);
msas(bs);

dagR

R Functions for Directed Acyclic Graphs

v1.2.0
GPL-2
Authors
Lutz P Breitling
Initial release
2021-04-17

We don't support your browser anymore

Please choose more modern alternatives, such as Google Chrome or Mozilla Firefox.