87 search results - page 7 / 18 » Combinatorial Complexity of Convex Sequences |
RECOMB
2010
Springer
13 years 5 months ago
2010
Springer
In comparative genomics, various combinatorial models can be used to specify gene clusters — groups of genes that are co-located in a set of genomes. Several approaches have been...
IDEAL
2010
Springer
13 years 6 months ago
2010
Springer
Automated Planning is a very active area of research within Artificial Intelligence. Broadly this discipline deals with the methods by which an agent can independently determine t...
CPM
2005
Springer
14 years 1 months ago
2005
Springer
Gene structure prediction is one of the most important problems in computational molecular biology. It involves two steps: the first is finding the evidence (e.g. predicting spl...
FUN
2010
Springer
14 years 8 days ago
2010
Springer
We study the complexity of the popular one player combinatorial game known as Flood-It. In this game the player is given an n×n board of tiles where each tile is allocated one of ...
EOR
2008
13 years 7 months ago
2008
We consider the separable nonlinear and strictly convex single-commodity network flow problem (SSCNFP). We develop a computational scheme for generating a primal feasible solution...