For a given clustering, walks the walktrap (of clusters) result tree to find a subtree with max(min(sens,spec)) for each cluster, where sens is sensitivity, spec is specificity
bestClusterTreeThresholds(res, leaf.factor, clusters, clmerges = NULL)
a list of $thresholds - per cluster optimal detectability values, and $node - internal node id (merge row) where the optimum was found
walktrap result object (igraph) where the nodes were clusters
a named factor describing cell assignments to the leaf nodes (in the same order as res$names)
cluster factor
integer matrix of cluster merges (default=NULL). If NULL, the function treeJaccard() performs calculation without it.