1421 search results - page 58 / 285 » Algorithms for subsequence combinatorics |
107
click to vote
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
The Cross Entropy algorithm is a new search method for combinatorial problem. However, it needs considerable computational time to achieve good solution quality. To make the Cross...
105
click to vote
COCOON
2005
Springer
15 years 8 months ago
2005
Springer
Rocchio’s similarity-based relevance feedback algorithm, one of the most important query reformation methods in information retrieval, is essentially an adaptive supervised lear...
154
click to vote
CPM
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. Approximate string matching is a fundamental and challenging problem in computer science, for which a fast algorithm is highly demanded in many applications including tex...
CPM
2007
Springer
15 years 9 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,...
140
click to vote
CPM
2004
Springer
15 years 8 months ago
2004
Springer
A popular approach in comparative genomics is to locate groups or clusters of orthologous genes in multiple genomes and to postulate functional association between the genes contai...