Sciweavers

101 search results - page 10 / 21
» Fast Comparison of Evolutionary Trees
Sort
View
AAAI
2006
13 years 9 months ago
Anytime Induction of Decision Trees: An Iterative Improvement Approach
Most existing decision tree inducers are very fast due to their greedy approach. In many real-life applications, however, we are willing to allocate more time to get better decisi...
Saher Esmeir, Shaul Markovitch
BMCBI
2010
135views more  BMCBI 2010»
13 years 7 months ago
GIGA: a simple, efficient algorithm for gene tree inference in the genomic age
Background: Phylogenetic relationships between genes are not only of theoretical interest: they enable us to learn about human genes through the experimental work on their relativ...
Paul D. Thomas
JCC
2002
81views more  JCC 2002»
13 years 7 months ago
Multiple grid methods for classical molecular dynamics
: Presented in the context of classical molecular mechanics and dynamics are multilevel summation methods for the fast calculation of energies/forces for pairwise interactions, whi...
Robert D. Skeel, Ismail Tezcan, David J. Hardy
ALGORITHMICA
2005
108views more  ALGORITHMICA 2005»
13 years 7 months ago
Key-Independent Optimality
A new form of optimality for comparison based static dictionaries is introduced. This type of optimality, keyindependent optimality, is motivated by applications that assign key v...
John Iacono
BIBE
2007
IEEE
145views Bioinformatics» more  BIBE 2007»
14 years 1 months ago
Homomorphisms of Multisource Trees into Networks with Applications to Metabolic Pathways
Network mapping is a convenient tool for comparing and exploring biological networks; it can be used for predicting unknown pathways, fast and meaningful searching of databases, a...
Qiong Cheng, Robert W. Harrison, Alexander Zelikov...