Sciweavers

1175 search results - page 113 / 235
» A scalable method for the generation of small test sets
Sort
View
BMCBI
2005
106views more  BMCBI 2005»
13 years 9 months ago
Thesaurus-based disambiguation of gene symbols
Background: Massive text mining of the biological literature holds great promise of relating disparate information and discovering new knowledge. However, disambiguation of gene s...
Bob J. A. Schijvenaars, Barend Mons, Marc Weeber, ...
BMCBI
2006
169views more  BMCBI 2006»
13 years 9 months ago
Comparative analysis of haplotype association mapping algorithms
Background: Finding the genetic causes of quantitative traits is a complex and difficult task. Classical methods for mapping quantitative trail loci (QTL) in miceuse an F2 cross b...
Phillip McClurg, Mathew T. Pletcher, Tim Wiltshire...
INFORMS
1998
100views more  INFORMS 1998»
13 years 9 months ago
Feature Selection via Mathematical Programming
The problem of discriminating between two nite point sets in n-dimensional feature space by a separating plane that utilizes as few of the features as possible, is formulated as a...
Paul S. Bradley, Olvi L. Mangasarian, W. Nick Stre...
TOG
2002
107views more  TOG 2002»
13 years 8 months ago
Ordered and quantum treemaps: Making effective use of 2D space to display hierarchies
Treemaps, a space-filling method of visualizing large hierarchical data sets, are receiving increasing attention. Several algorithms have been proposed to create more useful displ...
Benjamin B. Bederson, Ben Shneiderman, Martin Watt...
ICCS
2003
Springer
14 years 2 months ago
Counting Polyominoes: A Parallel Implementation for Cluster Computing
The exact enumeration of most interesting combinatorial problems has exponential computational complexity. The finite-lattice method reduces this complexity for most two-dimension...
Iwan Jensen