A clustering system C is the hardwired clustering system of a rooted level-k network if and only if μ(B) ≤ k for every non-trivial block B in the Hasse diagram H[C].
Genome Biol Evol 3:23–35, DOI 10.1093/gbe/evq077
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
representative citing papers
Introduces LCA-based i-regularization for DAGs that preserves LCAs of small leaf sets, produces regular graphs isomorphic to Hasse diagrams of lca-clusters, and characterizes its relation to normalization.
Global lca-DAGs are characterized via join semi-lattices and forbidden topological minors, with a polynomial-time recognition algorithm.
citing papers explorer
-
A Characterization of Level-k Realizability for Clustering Systems
A clustering system C is the hardwired clustering system of a rooted level-k network if and only if μ(B) ≤ k for every non-trivial block B in the Hasse diagram H[C].
-
Regularizing and Normalizing DAGs and Phylogenetic Networks
Introduces LCA-based i-regularization for DAGs that preserves LCAs of small leaf sets, produces regular graphs isomorphic to Hasse diagrams of lca-clusters, and characterizes its relation to normalization.
-
Global Least Common Ancestor (LCA) Networks
Global lca-DAGs are characterized via join semi-lattices and forbidden topological minors, with a polynomial-time recognition algorithm.