730 search results - page 112 / 146 » Combinatorics of Monotone Computations |
155
click to vote
COCOON
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. The original definition of P-systems calls for rules to be applied in a maximally parallel fashion. However, in some cases a sequential model may be a more reasonable as...
131
click to vote
COCOON
2005
Springer
15 years 10 months ago
2005
Springer
In computational biology, gene order data is often modelled as signed permutations. A classical problem in genome comparison is to detect conserved segments in a permutation, that ...
107
click to vote
CPM
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. We address in this paper a new computational biology problem that aims at understanding a mechanism that could potentially be used to genetically manipulate natural insec...
135
Voted
GECCO
2009
Springer
15 years 9 months ago
2009
Springer
Given a collection of terminals, each with a demand, a collection of concentrators, each with a capacity, and costs of connecting the terminals to the concentrators, the terminal ...
136
click to vote
GECCO
2009
Springer
15 years 9 months ago
2009
Springer
Given a set of strings S of equal lengths over an alphabet Σ, the closest string problem seeks a string over Σ whose maximum Hamming distance to any of the given strings is as s...