1421 search results - page 45 / 285 » Algorithms for subsequence combinatorics |
104
Voted
GECCO
2006
Springer
15 years 6 months ago
2006
Springer
When an evolutionary algorithm addresses a sequence of instances of the same problem, it can seed its population with solutions that it found for previous instances. This techniqu...
114
Voted
ECCC
1998
15 years 2 months ago
1998
In this paper we approach the problem of computing the characteristic polynomial of a matrix from the combinatorial viewpoint. We present several combinatorial characterizations of...
115
Voted
COCOON
2005
Springer
15 years 8 months ago
2005
Springer
The complexity, approximation and algorithmic issues of several clustering problems are studied. These non-traditional clustering problems arise from recent studies in microarray ...
116
Voted
CPM
2005
Springer
15 years 8 months ago
2005
Springer
A square is the concatenation of two identical non-empty strings. Let S be the input string which is given character by character. Let m be the (unknown) smallest integer such that...
118
click to vote
CPM
2004
Springer
15 years 8 months ago
2004
Springer
For a set of rooted, unordered, distinctly leaf-labeled trees, the NP-hard maximum agreement subtree problem (MAST) asks for a tree contained (up to isomorphism or homeomorphism) i...