377 search results - page 4 / 76 » A Fast Heuristic Algorithm for a Probe Mapping Problem |
EVOW
2006
Springer
13 years 11 months ago
2006
Springer
This paper proposes an evolutionary algorithm (EA) that is applied to the traveling salesman problem (TSP). Existing approximation methods to address the TSP known to be state-of-t...
IFIP
2004
Springer
14 years 25 days ago
2004
Springer
In the STS-based mapping, we are requested to obtain the correct order of probes in a DNA sequence from a given set of fragments or equivalently a hybridization matrix A. It is wel...
EDBT
2010
ACM
14 years 2 months ago
2010
ACM
We study the performance issue of the “iterative” record linkage (RL) problem, where match and merge operations may occur together in iterations until convergence emerges. We ...
RECOMB
2000
Springer
13 years 11 months ago
2000
Springer
In physical mapping, one orders a set of genetic landmarks or a library of cloned fragments of DNA according to their position in the genome. Our approach to physical mapping divi...
TCBB
2011
13 years 2 months ago
2011
—We study the problem of merging genetic maps, when the individual genetic maps are given as directed acyclic graphs. The computational problem is to build a consensus map, which...