Computing the Hybridization Number of Two Phylogenetic Trees Is Fixed-Parameter Tractable

IEEE/ACM Transactions on Computational Biology and Bioinformatics - United States
doi 10.1109/tcbb.2007.1019
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Related search

Hitting Topological Minor Models in Planar Graphs Is Fixed Parameter Tractable

2020English

An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2002English

Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs

SIAM Journal on Discrete Mathematics
Mathematics
2018English

Approximation Algorithms for the Fixed-Topology Phylogenetic Number Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1997English

Computing the Minimum Number of Hybridization Events for a Consistent Evolutionary History

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2007English

Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

On the Ancestral Compatibility of Two Phylogenetic Trees With Nested Taxa

Journal of Mathematical Biology
AgriculturalApplied MathematicsSimulationModelingBiological Sciences
2006English

Experiments With the Fixed-Parameter Approach for Two-Layer Planarization

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Figure 3: Box Plots With Number of Lineages for Reduced Phylogenetic Trees.

English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy