Sciweavers

347 search results - page 50 / 70
» Visualising phylogenetic trees
Sort
View
JCB
2002
108views more  JCB 2002»
15 years 1 months ago
Fast and Accurate Phylogeny Reconstruction Algorithms Based on the Minimum-Evolution Principle
This paper investigates the standard ordinary least-squares version 24 and the balanced version 20 of the minimum evolution principle. For the standard version, we provide a greedy...
Richard Desper, Olivier Gascuel
ICML
2007
IEEE
16 years 2 months ago
Hierarchical Gaussian process latent variable models
The Gaussian process latent variable model (GP-LVM) is a powerful approach for probabilistic modelling of high dimensional data through dimensional reduction. In this paper we ext...
Neil D. Lawrence, Andrew J. Moore
STOC
1996
ACM
92views Algorithms» more  STOC 1996»
15 years 6 months ago
Constructing Evolutionary Trees in the Presence of Polymorphic Characters
Abstract. Most phylogenetics literature and construction methods based upon characters presume monomorphism (one state per character per species), yet polymorphism (multiple states...
Maria Luisa Bonet, Cynthia A. Phillips, Tandy Warn...
136
Voted
WEA
2010
Springer
330views Algorithms» more  WEA 2010»
15 years 8 months ago
Exact Bipartite Crossing Minimization under Tree Constraints
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
Frank Baumann, Christoph Buchheim, Frauke Liers
IPPS
2009
IEEE
15 years 8 months ago
Parallel reconstruction of neighbor-joining trees for large multiple sequence alignments using CUDA
Computing large multiple protein sequence alignments using progressive alignment tools such as ClustalW requires several hours on state-of-the-art workstations. ClustalW uses a th...
Yongchao Liu, Bertil Schmidt, Douglas L. Maskell