431 search results - page 35 / 87 » Drawing Phylogenetic Trees |
IPPS
2006
IEEE
15 years 8 months ago
2006
IEEE
Inference of phylogenetic trees using the maximum likelihood (ML) method is NP-hard. Furthermore, the computation of the likelihood function for huge trees of more than 1,000 orga...
104
click to vote
IPPS
2006
IEEE
15 years 8 months ago
2006
IEEE
This paper describes a parallel implementation of our recently developed algorithm for phylogenetic analysis on the IBM BlueGene/L cluster [15]. This algorithm constructs evolutio...
102
Voted
BIBE
2003
IEEE
15 years 7 months ago
2003
IEEE
Abstract— We analyze the performance of likelihoodbased approaches used to reconstruct phylogenetic trees. Unlike other techniques such as Neighbor-Joining (NJ) and Maximum Parsi...
123
click to vote
GD
1998
Springer
15 years 6 months ago
1998
Springer
We describe a new approach for cluster-based drawing of very large graphs, which obtains clusters by using binary space partition (BSP) trees. We also introduce a novel BSP-type de...
CORR
2010
Springer
15 years 2 months ago
2010
Springer
We study methods for drawing trees with perfect angular resolution, i.e., with angles at each vertex, v, equal to 2/d(v). We show: