697 search results - page 13 / 140 » Improving EAs for Sequencing Problems |
ORL
2000
13 years 7 months ago
2000
We study four scheduling problems involving the maximum lateness criterion and an element of batching. For all the problems that we examine, algorithms appear in the literature th...
JCSS
2007
13 years 7 months ago
2007
Hidden Markov models (HMMs) are often used for biological sequence annotation. Each sequence feature is represented by a collection of states with the same label. In annotating a ...
CPM
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Detecting historical recombination is an important computational problem which has received great attention recently. Due to recombination, input sequences form a mosaic,...
JCSS
2008
13 years 7 months ago
2008
We study the problem of sorting binary sequences and permutations by length-weighted reversals. We consider a wide class of cost functions, namely f( ) = for all 0, where is the...
ISAAC
2005
Springer
14 years 1 months ago
2005
Springer
Given a sequence of n real numbers and an integer k, 1 k 1 2 n(n − 1), the k maximum-sum segments problem is to locate the k segments whose sums are the k largest among all poss...