3136 search results - page 71 / 628 » Comparison of Clique-Listing Algorithms |
184
click to vote
RECOMB
2000
Springer
15 years 9 months ago
2000
Springer
We present a lossless compression algorithm, GenCompress, for genetic sequences, based on searching for approximate repeats. Our algorithm achieves the best compression ratios for...
155
click to vote
METMBS
2004
15 years 7 months ago
2004
As more research centers embark on sequencing new genomes, the problem of DNA fragment assembly for shotgun sequencing is growing in importance and complexity. Accurate and fast a...
191
click to vote
COLT
1995
Springer
15 years 9 months ago
1995
Springer
We investigate the problem of estimating the proportion vector which maximizes the likelihood of a given sample for a mixture of given densities. We adapt a framework developed for...
173
click to vote
AISB
1994
Springer
15 years 10 months ago
1994
Springer
Selection methods in Evolutionary Algorithms, including Genetic Algorithms, Evolution Strategies ES and Evolutionary Programming, EP are compared by observing the rate of converge...
142
click to vote
GECCO
2006
Springer
15 years 9 months ago
2006
Springer
Our paper concerns optimal combinations of different types of reinsurance contracts. We introduce a novel approach based on the Mean-Variance-Criterion to solve this task. Two sta...