Exact characterizations and polynomial-time algorithms are given for realizing phylogenetic networks from required and forbidden LCA constraints under three variants of avoidance.
In: CSB ’03: Proceedings of the IEEE Computer Society Conference on Bioin- formatics, IEEE Computer Society, Washington DC, US, pp 363–374, DOI 10.1109/CSB.2003.1227337
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Global lca-DAGs are characterized via join semi-lattices and forbidden topological minors, with a polynomial-time recognition algorithm.
citing papers explorer
-
Inferring Phylogenetic Networks from Required and Forbidden LCA-Constraints
Exact characterizations and polynomial-time algorithms are given for realizing phylogenetic networks from required and forbidden LCA constraints under three variants of avoidance.
-
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.