Sciweavers

30 search results - page 1 / 6
» A 3-approximation algorithm for the subtree distance between...
Sort
View
JDA
2008
60views more  JDA 2008»
13 years 4 months ago
A 3-approximation algorithm for the subtree distance between phylogenies
Magnus Bordewich, Catherine McCartin, Charles Semp...
JCB
2006
82views more  JCB 2006»
13 years 4 months ago
Approximating Subtree Distances Between Phylogenies
Maria Luisa Bonet, Katherine St. John, Ruchi Mahin...
WABI
2001
Springer
13 years 9 months ago
A Chemical-Distance-Based Test for Positive Darwinian Selection
There are very few instances in which positive Darwinian selection has been convincingly demonstrated at the molecular level. In this study, we present a novel test for detecting p...
Tal Pupko, Roded Sharan, Masami Hasegawa, Ron Sham...
JCB
2007
92views more  JCB 2007»
13 years 4 months ago
Neighbor Joining Algorithms for Inferring Phylogenies via LCA Distances
Reconstructing phylogenetic trees efficiently and accurately from distance estimates is an ongoing challenge in computational biology from both practical and theoretical consider...
Ilan Gronau, Shlomo Moran
CPM
2000
Springer
136views Combinatorics» more  CPM 2000»
13 years 9 months ago
Approximating the Maximum Isomorphic Agreement Subtree Is Hard
The Maximum Isomorphic Agreement Subtree (MIT) problem is one of the simplest versions of the Maximum Interval Weight Agreement Subtree method (MIWT) which is used to compare phyl...
Paola Bonizzoni, Gianluca Della Vedova, Giancarlo ...