New Heuristics for Rooted Triplet Consistency†
AbstractRooted triplets are becoming one of the most important types of input for reconstructing rooted phylogenies. A rooted triplet is a phylogenetic tree on three leaves and shows the evolutionary relationship of the corresponding three species. In this paper, we investigate the problem of inferring the maximum consensus evolutionary tree from a set of rooted triplets. This problem is known to be APX-hard. We present two new heuristic algorithms. For a given set of m triplets on n species, the FastTree algorithm runs in O(m + α(n)n2) time, where α(n) is the functional inverse of Ackermann’s function. This is faster than any other previously known algorithms, although the outcome is less satisfactory. The Best Pair Merge with Total Reconstruction (BPMTR) algorithm runs in O(mn3) time and, on average, performs better than any other previously known algorithms for this problem. View Full-Text
Scifeed alert for new publicationsNever miss any articles matching your research from any publisher
- Get alerts for new papers matching your research
- Find out the new papers from selected authors
- Updated daily for 49'000+ journals and 6000+ publishers
- Define your Scifeed now
Jahangiri, S., Tazehkand; Hashemi, S.N.; Poormohammadi, H. New Heuristics for Rooted Triplet Consistency. Algorithms 2013, 6, 396-406.
Jahangiri S, Tazehkand, Hashemi SN, Poormohammadi H. New Heuristics for Rooted Triplet Consistency. Algorithms. 2013; 6(3):396-406.Chicago/Turabian Style
Jahangiri, Soheil, Tazehkand; Hashemi, Seyed N.; Poormohammadi, Hadi. 2013. "New Heuristics for Rooted Triplet Consistency." Algorithms 6, no. 3: 396-406.