AbstractWe give a characterization of the minimal obstruction sets for the existence of a perfect phylogeny for a set of three-state characters that can be inferred by testing each pair of characters. This leads to a O(m2n+p) time algorithm for outputting all p minimal obstruction sets for a set of m three-state characters over a set of n taxa
3siReconstructing the evolutionary history of a set of species is a central task in computational bi...
Abstract. The perfect phylogeny is one of the most used models in different areas of computational b...
The reconstruction of the evolutionary tree of a set of species based on qualitative attributes is a...
AbstractWe give a characterization of the minimal obstruction sets for the existence of a perfect ph...
Abstract In this paper, we study the problem of constructing perfect phylogenies for three-state cha...
This work is based on the paper ‘Incomplete perfect phylogeny ’ by Pe’er et al. (2000). The goal of ...
Perfect phylogenies are fundamental in the study of evolutionary trees because they capture the situ...
We present an algorithm for determining whether a set of species, described by the characters they e...
The Perfect Phylogeny Problem is a classical problem in computational evolutionary biology, in which...
We present a polynomial-time algorithm for determining whether a set of species, described by the ch...
We present a polynomial-time algorithm for determining whether a set of species, described by the ch...
We consider the problem of reconstructing near-perfect phylogenetic trees using binary character sta...
We consider the problem of reconstructing near-perfect phylogenetic trees using binary character sta...
Abstract. We consider the problem of reconstructing near-perfect phylogenetic trees using binary cha...
Reconstructing the evolutionary history of a set of species is a central task in computational biolo...
3siReconstructing the evolutionary history of a set of species is a central task in computational bi...
Abstract. The perfect phylogeny is one of the most used models in different areas of computational b...
The reconstruction of the evolutionary tree of a set of species based on qualitative attributes is a...
AbstractWe give a characterization of the minimal obstruction sets for the existence of a perfect ph...
Abstract In this paper, we study the problem of constructing perfect phylogenies for three-state cha...
This work is based on the paper ‘Incomplete perfect phylogeny ’ by Pe’er et al. (2000). The goal of ...
Perfect phylogenies are fundamental in the study of evolutionary trees because they capture the situ...
We present an algorithm for determining whether a set of species, described by the characters they e...
The Perfect Phylogeny Problem is a classical problem in computational evolutionary biology, in which...
We present a polynomial-time algorithm for determining whether a set of species, described by the ch...
We present a polynomial-time algorithm for determining whether a set of species, described by the ch...
We consider the problem of reconstructing near-perfect phylogenetic trees using binary character sta...
We consider the problem of reconstructing near-perfect phylogenetic trees using binary character sta...
Abstract. We consider the problem of reconstructing near-perfect phylogenetic trees using binary cha...
Reconstructing the evolutionary history of a set of species is a central task in computational biolo...
3siReconstructing the evolutionary history of a set of species is a central task in computational bi...
Abstract. The perfect phylogeny is one of the most used models in different areas of computational b...
The reconstruction of the evolutionary tree of a set of species based on qualitative attributes is a...
DOI
Add to ORKG