Sciweavers

132 search results - page 26 / 27
» Research Questions Guiding Selection of an Appropriate Resea...
Sort
View
BMCBI
2008
104views more  BMCBI 2008»
14 years 9 months ago
Evolutionary Pareto-optimization of stably folding peptides
Background: As a rule, peptides are more flexible and unstructured than proteins with their substantial stabilizing hydrophobic cores. Nevertheless, a few stably folding peptides ...
Wolfram Gronwald, Tim Hohm, Daniel Hoffmann
JACM
2006
99views more  JACM 2006»
14 years 9 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller
93
Voted
CVPR
2007
IEEE
15 years 11 months ago
Sparse Kernels for Bayes Optimal Discriminant Analysis
Discriminant Analysis (DA) methods have demonstrated their utility in countless applications in computer vision and other areas of research ? especially in the C class classificat...
Aleix M. Martínez, Onur C. Hamsici
94
Voted
BMCBI
2006
101views more  BMCBI 2006»
14 years 9 months ago
SynTReN: a generator of synthetic gene expression data for design and analysis of structure learning algorithms
Background: The development of algorithms to infer the structure of gene regulatory networks based on expression data is an important subject in bioinformatics research. Validatio...
Tim Van den Bulcke, Koen Van Leemput, Bart Naudts,...
PRL
2006
96views more  PRL 2006»
14 years 9 months ago
Fast codebook search algorithms based on tree-structured vector quantization
Tree-Structured Vector Quantization (TSVQ) is a highly efficient technique for locating an appropriate codeword for each input vector. The algorithm does not guarantee that the sel...
Chin-Chen Chang, Yu-Chiang Li, Jun-Bin Yeh