Add to ORKGPerfect phylogeny consisting of determining the compatibility of a set of characters is known to be NP-complete [5, 30]. We propose in this article a conjecture on the necessary and sufficient conditions of compatibility: Given a set C of r-states full characters, there exists a function f(r) such that C is compatible iff every set of f(r) characters of C is compatible. According t
We present an algorithm for determining whether a set of species, described by the characters they e...
In evolutionary biology, a character is a function χ from a set X of present-day species into a fini...
Perfect phylogenies are fundamental in the study of evolutionary trees because they capture the situ...
The reconstruction of the evolutionary tree of a set of species based on qualitative attributes is a...
Abstract.—A well-known approach to inferring phylogenies involves finding a phylogeny with the large...
Perfect phylogenies are fundamental in the study of evolutionary trees because they capture the situ...
Abstract In this paper, we study the problem of constructing perfect phylogenies for three-state cha...
Dress A, Moulton V, Steel M. Trees, Taxonomy, and Strongly Compatible Multi-state Characters. Advanc...
Given a set R of rooted phylogenetic trees on overlapping taxa, it takes polynomial time to decide w...
We present a polynomial-time algorithm for determining whether a set of species, described by the ch...
Using formal algebraic definitions of "cladistic character" and "character compatibility", the conce...
AbstractWe give a characterization of the minimal obstruction sets for the existence of a perfect ph...
We present a polynomial-time algorithm for determining whether a set of species, described by the ch...
AbstractGiven a family ofbinarycharacters defined on a setX, a problem arising in biological and lin...
This work is based on the paper ‘Incomplete perfect phylogeny ’ by Pe’er et al. (2000). The goal of ...
We present an algorithm for determining whether a set of species, described by the characters they e...
In evolutionary biology, a character is a function χ from a set X of present-day species into a fini...
Perfect phylogenies are fundamental in the study of evolutionary trees because they capture the situ...
The reconstruction of the evolutionary tree of a set of species based on qualitative attributes is a...
Abstract.—A well-known approach to inferring phylogenies involves finding a phylogeny with the large...
Perfect phylogenies are fundamental in the study of evolutionary trees because they capture the situ...
Abstract In this paper, we study the problem of constructing perfect phylogenies for three-state cha...
Dress A, Moulton V, Steel M. Trees, Taxonomy, and Strongly Compatible Multi-state Characters. Advanc...
Given a set R of rooted phylogenetic trees on overlapping taxa, it takes polynomial time to decide w...
We present a polynomial-time algorithm for determining whether a set of species, described by the ch...
Using formal algebraic definitions of "cladistic character" and "character compatibility", the conce...
AbstractWe give a characterization of the minimal obstruction sets for the existence of a perfect ph...
We present a polynomial-time algorithm for determining whether a set of species, described by the ch...
AbstractGiven a family ofbinarycharacters defined on a setX, a problem arising in biological and lin...
This work is based on the paper ‘Incomplete perfect phylogeny ’ by Pe’er et al. (2000). The goal of ...
We present an algorithm for determining whether a set of species, described by the characters they e...
In evolutionary biology, a character is a function χ from a set X of present-day species into a fini...
Perfect phylogenies are fundamental in the study of evolutionary trees because they capture the situ...