The Minimum Evolution Problem Is Hard: A Link Between Tree Inference and Graph Clustering Problems

Bioinformatics - United Kingdom
doi 10.1093/bioinformatics/btv623
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Oxford University Press (OUP)

Related search

Dynamic Graph Clustering Using Minimum-Cut Trees

Journal of Graph Algorithms and Applications
GeometryComputer Science ApplicationsComputer ScienceMathematicsComputational TheoryTheoretical Computer ScienceTopology
2012English

Uncertain Quadratic Minimum Spanning Tree Problem

Journal of Communications
Electronic EngineeringElectrical
2014English

CciMST: A Clustering Algorithm Based on Minimum Spanning Tree and Cluster Centers

Mathematical Problems in Engineering
MathematicsEngineering
2018English

Single-Valued Neutrosophic Minimum Spanning Tree and Its Clustering Method

Journal of Intelligent Systems
Information SystemsArtificial IntelligenceSoftware
2014English

The Minimum Steiner Tree Problem Based on Genetic Algorithm

DEStech Transactions on Computer Science and Engineering
2018English

Heuristic Search for the Generalized Minimum Spanning Tree Problem

INFORMS Journal on Computing
Management ScienceComputer Science ApplicationsInformation SystemsOperations ResearchSoftware
2005English

Directed Steiner Tree Problem on a Graph: Models, Relaxations, and Algorithms

1988English

Automatically Produced Algorithms for the Generalized Minimum Spanning Tree Problem

Scientific Programming
Computer Science ApplicationsSoftware
2016English

Offline Algorithms for Dynamic Minimum Spanning Tree Problems

Journal of Algorithms
1994English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy