Sciweavers

5 search results - page 1 / 1
» Randomized Postoptimization of Covering Arrays
Sort
View
IWOCA
2009
Springer
149views Algorithms» more  IWOCA 2009»
13 years 11 months ago
Randomized Postoptimization of Covering Arrays
The construction of covering arrays with the fewest rows remains a challenging problem. Most computational and recursive constructions result in extensive repetition of coverage. W...
Peyman Nayeri, Charles J. Colbourn, Goran Konjevod
BMCBI
2005
79views more  BMCBI 2005»
13 years 4 months ago
Mathematical design of prokaryotic clone-based microarrays
Background: Clone-based microarrays, on which each spot represents a random genomic fragment, are a good alternative to open reading frame-based microarrays, especially for microo...
Bart Pieterse, Elisabeth J. Quirijns, Frank H. J. ...
ICSE
2011
IEEE-ACM
12 years 8 months ago
Inferring better contracts
Considerable progress has been made towards automatic support for one of the principal techniques available to enhance program reliability: equipping programs with extensive contr...
Yi Wei, Carlo A. Furia, Nikolay Kazmin, Bertrand M...
BMCBI
2008
128views more  BMCBI 2008»
13 years 4 months ago
Efficient computation of absent words in genomic sequences
Background: Analysis of sequence composition is a routine task in genome research. Organisms are characterized by their base composition, dinucleotide relative abundance, codon us...
Julia Herold, Stefan Kurtz, Robert Giegerich
IASTEDSE
2004
13 years 5 months ago
A deterministic density algorithm for pairwise interaction coverage
Pairwise coverage of factors affecting software has been proposed to screen for potential errors. Techniques to generate test suites for pairwise coverage are evaluated according ...
Charles J. Colbourn, Myra B. Cohen, Renée T...