299 search results - page 5 / 60 » DNA Computing for Complex Scheduling Problem |
BMCBI
2007
2007
Penalized likelihood for sparse contingency tables with an application to full-length cDNA libraries
14 years 9 months ago
Background: The joint analysis of several categorical variables is a common task in many areas of biology, and is becoming central to systems biology investigations whose goal is ...
SCHEDULING
2010
14 years 8 months ago
2010
This paper reconsiders the PERT scheduling problem when information about task duration is incomplete. We model uncertainty on task durations by intervals. With this problem formu...
108
click to vote
RECOMB
2002
Springer
15 years 9 months ago
2002
Springer
We present an original approach to identifying sequence variants in a mixed DNA population from sequence trace data. The heart of the method is based on parsimony: given a wildtyp...
COMPLIFE
2006
Springer
15 years 1 months ago
2006
Springer
The ability to locate promoters within a section of DNA is known to be a very difficult and very important task in DNA analysis. We document an approach that incorporates the conce...
62
Voted
AIPS
2008
14 years 12 months ago
2008
We present a complex scheduling problem where we want to plan meetings between customers and exhibitors at a trade event. One cause of the complexity of the problem is the general...