Approximation Algorithms for Bounded Degree Phylogenetic Roots
- 19 October 2007
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 51 (1) , 1-23
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Computing phylogenetic roots with bounded degrees and errors is NP-completeTheoretical Computer Science, 2006
- Computing bounded-degree phylogenetic roots of disconnected graphsJournal of Algorithms, 2006
- An improved approximation algorithm for the metric maximum clustering problem with given cluster sizesInformation Processing Letters, 2006
- Cluster graph modification problemsDiscrete Applied Mathematics, 2004
- Correlation ClusteringMachine Learning, 2004
- Clustering with qualitative information2004
- Computing Phylogenetic Roots with Bounded Degrees and ErrorsSIAM Journal on Computing, 2003
- Phylogenetic k-Root and Steiner k-Root2000
- An empirical comparison of heuristic methods for creating maximally diverse groupsJournal of the Operational Research Society, 1998
- On the Parallel Complexity of Hamiltonian Cycle and Matching Problem on Dense GraphsJournal of Algorithms, 1993