Sciweavers

1099 search results - page 110 / 220
» On the Complexity of Computing Evolutionary Trees
Sort
View
FPL
2010
Springer
188views Hardware» more  FPL 2010»
14 years 8 months ago
SeqHive: A Reconfigurable Computer Cluster for Genome Re-sequencing
We demonstrate how Field Programmable Gate Arrays (FPGAs) may be used to address the computing challenges associated with assembling genome sequences from recent ultra-high-through...
Kristian Stevens, Henry Chen, Terry Filiba, Peter ...
BMCBI
2010
142views more  BMCBI 2010»
14 years 10 months ago
pplacer: linear time maximum-likelihood and Bayesian phylogenetic placement of sequences onto a fixed reference tree
Background: Likelihood-based phylogenetic inference is generally considered to be the most reliable classification method for unknown sequences. However, traditional likelihood-ba...
Frederick A. Matsen III, Robin B. Kodner, E. Virgi...
KDD
2006
ACM
113views Data Mining» more  KDD 2006»
15 years 10 months ago
A new efficient probabilistic model for mining labeled ordered trees
Mining frequent patterns is a general and important issue in data mining. Complex and unstructured (or semi-structured) datasets have appeared in major data mining applications, i...
Kosuke Hashimoto, Kiyoko F. Aoki-Kinoshita, Nobuhi...
EPS
1995
Springer
15 years 1 months ago
Interactive Evolution of Images
Systems of selection and variation by recombination and/or mutation can be used to evolve images for computer graphics and animation. Interactive evolution can be used to direct t...
Jeanine Graf, Wolfgang Banzhaf
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
15 years 10 months ago
Finding low-entropy sets and trees from binary data
The discovery of subsets with special properties from binary data has been one of the key themes in pattern discovery. Pattern classes such as frequent itemsets stress the co-occu...
Eino Hinkkanen, Hannes Heikinheimo, Heikki Mannila...