Open AccessThe minimum evolution problem is hard: a link between tree inference and graph clustering problems
Author(s) -
Sarah Bastkowski,
Vincent Moulton,
Andreas Spillner,
Taoyang Wu
Publication year - 2015
Publication title -
bioinformatics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 3.599
H-Index - 390
eISSN - 1367-4811
pISSN - 1367-4803
DOI - 10.1093/bioinformatics/btv623
Subject(s) - cluster analysis , phylogenetic tree , inference , combinatorics , computer science , graph , link (geometry) , mathematics , theoretical computer science , artificial intelligence , biology , gene , biochemistry
Distance methods are well suited for constructing massive phylogenetic trees. However, the computational complexity for Rzhetsky and Nei's minimum evolution (ME) approach, one of the earliest methods for constructing a phylogenetic tree from a distance matrix, remains open.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom