2373 search results - page 414 / 475 » Complexities for generalized models of self-assembly |
151
click to vote
BMCBI
2010
15 years 4 months ago
2010
Background: Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly probl...
122
click to vote
BMCBI
2008
15 years 4 months ago
2008
Background: Reliable prediction of antibody, or B-cell, epitopes remains challenging yet highly desirable for the design of vaccines and immunodiagnostics. A correlation between a...
166
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
Fitness functions based on test cases are very common in Genetic Programming (GP). This process can be assimilated to a learning task, with the inference of models from a limited n...
140
click to vote
SIGECOM
2008
ACM
15 years 4 months ago
2008
ACM
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
177
click to vote
COMGEO
1999
ACM
15 years 3 months ago
1999
ACM
The use of polygonal meshes for the representation of highly complex geometric objects has become the de facto standard in most computer graphics applications. Especially triangle...