697 search results - page 54 / 140 » Improving EAs for Sequencing Problems |
CCECE
2006
IEEE
14 years 3 months ago
2006
IEEE
Phylogenetic trees are commonly reconstructed based on hard optimization problems such as Maximum parsimony (MP) and Maximum likelihood (ML). Conventional MP heuristics for produc...
CIBCB
2006
IEEE
14 years 3 months ago
2006
IEEE
— DNA sequence basecalling is commonly regarded as a solved problem, despite significant error rates being reflected in inaccuracies in databases and genome annotations. These er...
CPAIOR
2010
Springer
14 years 2 months ago
2010
Springer
This paper introduces the Increasing Nvalue constraint, which restricts the number of distinct values assigned to a sequence of variables so that each variable in the sequence is l...
CORR
2007
Springer
13 years 9 months ago
2007
Springer
Assembling a gene from candidate exons is an important problem in computational biology. Among the most successful approaches to this problem is spliced alignment, proposed by Gelf...
CEC
2009
IEEE
14 years 1 months ago
2009
IEEE
— The protein structure prediction (PSP) problem is one of the most important problems in computational biology. This paper proposes a novel Estimation of Distribution Algorithms...