Sciweavers

12836 search results - page 2288 / 2568
» Generalization Methods in Bioinformatics
Sort
View
DM
2006
128views more  DM 2006»
15 years 4 months ago
Non-trivial t-designs without repeated blocks exist for all t
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...
Luc Teirlinck
BMCBI
2007
166views more  BMCBI 2007»
15 years 4 months ago
How to decide which are the most pertinent overly-represented features during gene set enrichment analysis
Background: The search for enriched features has become widely used to characterize a set of genes or proteins. A key aspect of this technique is its ability to identify correlati...
Roland Barriot, David J. Sherman, Isabelle Dutour
EOR
2006
107views more  EOR 2006»
15 years 4 months ago
Longest path analysis in networks of queues: Dynamic scheduling problems
In this paper, we develop an acyclic network of queues for the design of a dynamic flow shop, where each service station represents a machine. The orders arrive at the input stati...
Amir Azaron, Hideki Katagiri, Kosuke Kato, Masatos...
BMCBI
2007
153views more  BMCBI 2007»
15 years 4 months ago
Lower bounds on multiple sequence alignment using exact 3-way alignment
Background: Multiple sequence alignment is fundamental. Exponential growth in computation time appears to be inevitable when an optimal alignment is required for many sequences. E...
Charles J. Colbourn, Sudhir Kumar
131
Voted
BMCBI
2007
123views more  BMCBI 2007»
15 years 4 months ago
Normalization and experimental design for ChIP-chip data
Background: Chromatin immunoprecipitation on tiling arrays (ChIP-chip) has been widely used to investigate the DNA binding sites for a variety of proteins on a genome-wide scale. ...
Shouyong Peng, Artyom A. Alekseyenko, Erica Larsch...
« Prev « First page 2288 / 2568 Last » Next »