1421 search results - page 38 / 285 » Algorithms for subsequence combinatorics |
154
Voted
COCOON
2005
Springer
15 years 9 months ago
2005
Springer
For a bounded integer , we wish to color all edges of a graph G so that any two edges within distance have different colors. Such a coloring is called a distance-edge-coloring or ...
134
Voted
COCOON
2005
Springer
15 years 9 months ago
2005
Springer
The Reverse Greedy algorithm (RGREEDY) for the k-median problem works as follows. It starts by placing facilities on all nodes. At each step, it removes a facility to minimize the...
125
Voted
COCOON
2005
Springer
15 years 9 months ago
2005
Springer
The terminal Steiner tree problem (TST) consists of finding a minimum cost Steiner tree where each terminal is a leaf. We describe a factor 2ρ−ρ/(3ρ−2) approximation algor...
112
click to vote
CPM
2003
Springer
15 years 9 months ago
2003
Springer
Given n fragments from k > 2 genomes, we will show how to find an optimal chain of colinear non-overlapping fragments in time O(n logk−2 n log log n) and space O(n logk−2 n...
78
Voted
COCOON
2007
Springer
15 years 10 months ago
2007
Springer
Tandem repeated regions are closely related to some genetic diseases in human beings. Once a region containing pseudo-periodic repeats is found, it is interesting to study the his...