Sciweavers

1243 search results - page 244 / 249
» Complexity reduction of C-Algorithm
Sort
View
BMCBI
2010
178views more  BMCBI 2010»
14 years 9 months ago
Selecting high-dimensional mixed graphical models using minimal AIC or BIC forests
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
David Edwards, Gabriel C. G. de Abreu, Rodrigo Lab...
BMCBI
2008
117views more  BMCBI 2008»
14 years 9 months ago
An iterative block-shifting approach to retention time alignment that preserves the shape and area of gas chromatography-mass sp
Background: Metabolomics, petroleum and biodiesel chemistry, biomarker discovery, and other fields which rely on high-resolution profiling of complex chemical mixtures generate da...
Minho Chae, Robert J. Shmookler Reis, John J. Thad...
CGF
2010
189views more  CGF 2010»
14 years 9 months ago
Space-in-Time and Time-in-Space Self-Organizing Maps for Exploring Spatiotemporal Patterns
Spatiotemporal data pose serious challenges to analysts in geographic and other domains. Owing to the complexity of the geospatial and temporal components, this kind of data canno...
Gennady L. Andrienko, Natalia V. Andrienko, Sebast...
AI
2006
Springer
14 years 9 months ago
Backward-chaining evolutionary algorithms
Starting from some simple observations on a popular selection method in Evolutionary Algorithms (EAs)--tournament selection--we highlight a previously-unknown source of inefficien...
Riccardo Poli, William B. Langdon
BMCBI
2006
154views more  BMCBI 2006»
14 years 9 months ago
Analysis with respect to instrumental variables for the exploration of microarray data structures
Background: Evaluating the importance of the different sources of variations is essential in microarray data experiments. Complex experimental designs generally include various fa...
Florent Baty, Michaël Facompré, Jan Wi...