5699 search results - page 251 / 1140 » Alternating model trees |
221
click to vote
RECOMB
2005
Springer
16 years 7 months ago
2005
Springer
We describe a novel method for efficient reconstruction of phylogenetic trees, based on sequences of whole genomes or proteomes, whose lengths may greatly vary. The core of our me...
203
click to vote
WLP
1997
Springer
15 years 11 months ago
1997
Springer
eduction strategies for logic programs often use an abstraction operator to guarantee the niteness of the set of goals for which partial deductions are . Findingan abstraction ope...
228
click to vote
JCB
2006
15 years 7 months ago
2006
We describe a novel method for efficient reconstruction of phylogenetic trees, based on sequences of whole genomes or proteomes, whose lengths may greatly vary. The core of our me...
216
click to vote
BMCBI
2005
15 years 7 months ago
2005
Background: Multiple genome alignment is an important problem in bioinformatics. An important subproblem used by many multiple alignment approaches is that of aligning two multipl...
216
click to vote
SAC
2009
ACM
16 years 2 months ago
2009
ACM
Decision trees are widely disseminated as an effective solution for classification tasks. Decision tree induction algorithms have some limitations though, due to the typical strat...