Sciweavers

7259 search results - page 55 / 1452
» From Fields to Trees
Sort
View
RECOMB
2006
Springer
14 years 8 months ago
Maximal Accurate Forests from Distance Matrices
Abstract. We present a fast converging method for distance-based phylogenetic inference, which is novel in two respects. First, it is the only method (to our knowledge) to guarante...
Constantinos Daskalakis, Cameron Hill, Alexander J...
INFOVIS
2002
IEEE
14 years 1 months ago
Case Study: Visualizing Sets of Evolutionary Trees
We describe a visualization tool which allows a biologist to explore a large set of hypothetical evolutionary trees. Interacting with such a dataset allows the biologist to identi...
Nina Amenta, Jeff Klingner
ESA
1999
Springer
89views Algorithms» more  ESA 1999»
14 years 11 days ago
On the Informational Asymmetry between Upper and Lower Bounds for Ultrametric Evolutionary Trees
Abstract. This paper addresses the informational asymmetry for constructing an ultrametric evolutionary tree from upper and lower bounds on pairwise distances between n given speci...
Ting Chen, Ming-Yang Kao
COMBINATORICS
2006
129views more  COMBINATORICS 2006»
13 years 8 months ago
Descendants in Increasing Trees
Simple families of increasing trees can be constructed from simply generated tree families, if one considers for every tree of size n all its increasing labellings, i. e. labellin...
Markus Kuba, Alois Panholzer
SIAMCOMP
1998
114views more  SIAMCOMP 1998»
13 years 7 months ago
Universal Limit Laws for Depths in Random Trees
Random binary search trees, b-ary search trees, median-of-(2k+1) trees, quadtrees, simplex trees, tries, and digital search trees are special cases of random split trees. For these...
Luc Devroye