77 search results - page 4 / 16 » Optimal leaf ordering of complete binary trees |
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
Abstract. We study the problem of maintaining a dynamic tree succinctly, in 2n + o(n) bits, under updates of the following form: insertion or deletion of a leaf, insertion of a nod...
KDD
2007
ACM
14 years 8 months ago
2007
ACM
Most decision tree algorithms base their splitting decisions on a piecewise constant model. Often these splitting algorithms are extrapolated to trees with non-constant models at ...
GECCO
2004
Springer
14 years 26 days ago
2004
Springer
We are interested in schema disruption behavior when chromosomes are structured as binary trees. We give the definition of the disruption probability dp(H) of a schema H, and also...
WEA
2010
Springer
14 years 2 months ago
2010
Springer
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...
BMCBI
2011
13 years 2 months ago
2011
Background: As one of the most widely used parsimony methods for ancestral reconstruction, the Fitch method minimizes the total number of hypothetical substitutions along all bran...