COCOA
2007
Springer
14 years 2 months ago
2007
Springer
COCOA
2007
Springer
14 years 2 months ago
2007
Springer
COCOA
2007
Springer
14 years 6 months ago
2007
Springer
The Two-Sided Crossing Minimization (TSCM) problem calls for minimizing the number of edge crossings of a bipartite graph where the two sets of vertices are drawn on two parallel l...
COCOA
2007
Springer
14 years 6 months ago
2007
Springer
COCOA
2007
Springer
14 years 6 months ago
2007
Springer
Abstract. Multiple sequence alignment (MSA) is one of the most basic and central tasks for many studies in modern biology. In this paper, we present a new progressive alignment alg...
COCOA
2007
Springer
14 years 6 months ago
2007
Springer
We consider the problem of connecting given vertex pairs over a stochastic metric graph, each vertex of which has a probability of presence independently of all other ver
COCOA
2007
Springer
14 years 6 months ago
2007
Springer
COCOA
2007
Springer
14 years 6 months ago
2007
Springer
COCOA
2007
Springer
14 years 6 months ago
2007
Springer
: We develop a new approach to combinatorial games (e.g., chess, Go, checkers, Chomp, Nim) that unveils connections between such games and nonlinear phenomena commonly seen in natu...
COCOA
2007
Springer
14 years 6 months ago
2007
Springer
We define a fundamental domain for a linear programming relaxation of a combinatorial integer program which is symmetric under a group action. We then describe a straightforward w...