Optimizing combinatorial library construction via split synthesis

Authors:
Barry Cohen;Steven Skiena
Affiliations:
Department of Computer Science, State University of New York at Stony Brook Stony Brook, NY;Department of Computer Science, State University of New York at Stony Brook Stony Brook, NY
Venue:
RECOMB '99 Proceedings of the third annual international conference on Computational molecular biology
Year:
1999

Fabricating arrays of strings

RECOMB '97 Proceedings of the first annual international conference on Computational molecular biology
Covering a graph by complete bipartite graphs

Discrete Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

A Notion of Cross-Perfect Bipartite Graphs

COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
A notion of cross-perfect bipartite graphs

Information Processing Letters
Sequencing by hybridization with isothermic oligonucleotide libraries

Discrete Applied Mathematics - The fourth international colloquium on graphs and optimisation (GO-IV)
Jump number of two-directional orthogonal ray graphs

IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization

Hi-index	0.00