131 search results - page 22 / 27 » combinatorics 2004 |
CPM
2004
Springer
14 years 1 months ago
2004
Springer
The problem of comparing two sequences A and B to determine their similarity is one of the fundamental problems in pattern matching. A challenging, basic variation of the sequence...
CPM
2004
Springer
14 years 1 months ago
2004
Springer
The problem of sorting a signed permutation by reversals is inspired by genome rearrangements in computational molecular biology. Given two genomes represented as two signed permut...
COCOON
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. An undirected graph G = (V, E) is the k-power of an undirected tree T = (V, E ) if (u, v) ∈ E iff u and v are connected by a path of length at most k in T. The tree T ...
COCOON
2004
Springer
14 years 3 months ago
2004
Springer
An octree is a recursive partition of the unit cube, such that in each step a cube is subdivided into eight smaller cubes. Those cubes that are not further subdivided are the leave...
CPM
2004
Springer
14 years 3 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...