Sciweavers

16430 search results - page 76 / 3286
» On Computable Tree Functions
Sort
View
RECOMB
2007
Springer
16 years 2 months ago
Beyond Galled Trees - Decomposition and Computation of Galled Networks
Reticulate networks are a type of phylogenetic network that are used to represent reticulate evolution involving hybridization, horizontal gene transfer or recombination. The simpl...
Daniel H. Huson, Tobias H. Klöpper
137
Voted
ISBRA
2010
Springer
15 years 9 months ago
Fast Computation of the Exact Hybridization Number of Two Phylogenetic Trees
Abstract. Hybridization is a reticulate evolutionary process. An established problem on hybridization is computing the minimum number of hybridization events, called the hybridizat...
Yufeng Wu, Jiayin Wang
DLT
2008
15 years 3 months ago
Derivation Tree Analysis for Accelerated Fixed-Point Computation
We show that for several classes of idempotent semirings the least fixed-point of a polynomial system of equations X = f(X) is equal to the least fixed-point of a linear system obt...
Javier Esparza, Stefan Kiefer, Michael Luttenberge...
DCC
2005
IEEE
16 years 2 months ago
Coding the Wavelet Spatial Orientation Tree with Low Computational Complexity
ct A very fast, low complexity algorithm for resolution scalable and random access decoding is presented. The algorithm is based on AGP (Alphabet and Group Partitioning) [1], where...
Yushin Cho, Amir Said, William A. Pearlman
EDBT
2010
ACM
180views Database» more  EDBT 2010»
15 years 9 months ago
BSkyTree: scalable skyline computation using a balanced pivot selection
Skyline queries have gained a lot of attention for multicriteria analysis in large-scale datasets. While existing skyline algorithms have focused mostly on exploiting data dominan...
Jongwuk Lee, Seung-won Hwang