264 search results - page 1 / 53 » On the Complexity of Positional Sequencing by Hybridization |
CPM
1999
Springer
13 years 9 months ago
1999
Springer
In sequencing by hybridization (SBH), one has to reconstruct a sequence from its l-long substrings. SBH was proposed as an alternative to gel-based DNA sequencing approaches, but ...
DAM
2006
13 years 4 months ago
2006
In the paper, the computational complexity of several variants of the problem of isothermic DNA sequencing by hybridization, is analyzed. The isothermic sequencing is a recent met...
GECCO
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. This paper describes a genetic algorithm for the DNA sequencing problem. The algorithm allows the input spectrum to contain both positive and negative errors as could be ...
HEURISTICS
2002
13 years 4 months ago
2002
In the paper, a new hybrid genetic algorithm solving the DNA sequencing problem with negative and positive errors is presented. The algorithm has as its input a set of oligonucleo...
COLT
2001
Springer
13 years 9 months ago
2001
Springer
Intrinsic complexity is used to measure the complexity of learning areas limited by broken-straight lines (called open semi-hulls) and intersections of such areas. Any strategy le...