Obtain a consens tree from bootstrapped data
1 2 3 4 |
BootPG |
list of ElPiGraph structures containing the bootstrapped data |
Mode |
string, the mode to use |
CollapseRadius |
numeric, the distance to use in order to compute the multiplicity of the nodes. If NULL, it will be inferred from the data |
FilterEdges.Min |
numeric, the minimal length of edges in the final graph. Shorter edges will be removed, unless the removal results in an increase of the components of the graph |
FilterEdges.Max |
numeric, the maximum length of edges in the final graph. Longer edges will be removed, unless the removal results in an increase of the components of the graph |
Clusters |
integer, the number of clusters inferred by the kmeans step |
MinEdgMult |
integer, minimal multiplicity of the edges of the consensus graph |
MinNodeMult |
integer, minimal multiplicity of the nodes of the consensus graph |
RemoveIsolatedNodes |
boolean, should the procedure remove graph nodes that are not connected to any other node? |
OnlyLCC |
boolean, should the procedure return only the largest connected component of the graph? |
PlotResult |
boolean, should debugging information be plotted? |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.