A Concise Necessary and Sufficient Condition for the Existence of a Galled-Tree

Authors:
Yun S. Song
Affiliations:
-
Venue:
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Year:
2006

Citing 6
Cited 2

Reconstructing reticulate evolution in species: theory and practice

RECOMB '04 Proceedings of the eighth annual international conference on Resaerch in computational molecular biology
The Number of Recombination Events in a Sample History: Conflict Graph and Lower Bounds

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination

Journal of Computer and System Sciences - Special issue on bioinformatics II
An efficiently computed lower bound on the number of recombinations in phylogenetic networks: Theory and empirical study

Discrete Applied Mathematics
The Fine Structure of Galls in Phylogenetic Networks

INFORMS Journal on Computing
Constructing a smallest refining galled phylogenetic network

RECOMB'05 Proceedings of the 9th Annual international conference on Research in Computational Molecular Biology

Haplotype Inferring Via Galled-Tree Networks Is NP-Complete

COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Haplotype inferring via galled-tree networks using a hypergraph covering problem for special genotype matrices

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Galled-trees are a special class of graphical representation of evolutionary history that has proven amenable to efficient, polynomial-time algorithms. The goal of this paper is to construct a concise necessary and sufficient condition for the existence of a galled-tree for M, a set of binary sequences that purportedly have evolved in the presence of recombination. Both root-known and root-unknown cases are considered here.