18 search results - page 1 / 4 » Recursive reconstruction on periodic trees |
RSA
1998
13 years 5 months ago
1998
A periodic tree Tn consists of full n-level copies of a finite tree T. The tree Tn is labeled by random bits. The root label is chosen randomly, and the probability of two adjace...
ACPC
1999
Springer
13 years 10 months ago
1999
Springer
Multi-resolution methods are widely used in scientific visualization, image processing, and computer graphics. While many applications only require an one-time construction of the...
CSB
2004
IEEE
13 years 10 months ago
2004
IEEE
Phylogenetic trees are commonly reconstructed based on hard optimization problems such as maximum parsimony (MP) and maximum likelihood (ML). Conventional MP heuristics for produc...
WOB
2004
13 years 7 months ago
2004
ABSTRACT. The computationally challenging problem of reconstructing the phylogeny of a set of contemporary data, such as DNA sequences or morphological attributes, was treated by a...
WABI
2004
Springer
13 years 11 months ago
2004
Springer
Computational heuristics are the primary methods for reconstruction of phylogenetic trees on large datasets. Most large-scale phylogenetic analyses produce numerous trees that are ...