Sciweavers

704 search results - page 120 / 141
» Improved Learning of AC0 Functions
Sort
View
BMCBI
2011
12 years 11 months ago
Clustering gene expression data with a penalized graph-based metric
Background: The search for cluster structure in microarray datasets is a base problem for the so-called “-omic sciences”. A difficult problem in clustering is how to handle da...
Ariel E. Bayá, Pablo M. Granitto
AIPS
2008
13 years 10 months ago
Stochastic Enforced Hill-Climbing
Enforced hill-climbing is an effective deterministic hillclimbing technique that deals with local optima using breadth-first search (a process called "basin flooding"). ...
Jia-Hong Wu, Rajesh Kalyanam, Robert Givan
BMCBI
2007
141views more  BMCBI 2007»
13 years 7 months ago
Using structural motif descriptors for sequence-based binding site prediction
Background: Many protein sequences are still poorly annotated. Functional characterization of a protein is often improved by the identification of its interaction partners. Here, ...
Andreas Henschel, Christof Winter, Wan Kyu Kim, Mi...
BMCBI
2005
117views more  BMCBI 2005»
13 years 7 months ago
An SVM-based system for predicting protein subnuclear localizations
Background: The large gap between the number of protein sequences in databases and the number of functionally characterized proteins calls for the development of a fast computatio...
Zhengdeng Lei, Yang Dai
GECCO
2005
Springer
140views Optimization» more  GECCO 2005»
14 years 1 months ago
CGP visits the Santa Fe trail: effects of heuristics on GP
GP uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees, and GP searches t...
Cezary Z. Janikow, Christopher J. Mann