Sciweavers

8431 search results - page 277 / 1687
» Algorithmically Independent Sequences
Sort
View
EVOW
2010
Springer
15 years 5 months ago
Finding Gapped Motifs by a Novel Evolutionary Algorithm
Background: Identifying approximately repeated patterns, or motifs, in DNA sequences from a set of co-regulated genes is an important step towards deciphering the complex gene reg...
Chengwei Lei, Jianhua Ruan
BMCBI
2010
154views more  BMCBI 2010»
15 years 6 months ago
An algorithm for automated closure during assembly
Background: Finishing is the process of improving the quality and utility of draft genome sequences generated by shotgun sequencing and computational assembly. Finishing can invol...
Sergey Koren, Jason R. Miller, Brian Walenz, Grang...
188
Voted
BMCBI
2007
216views more  BMCBI 2007»
15 years 6 months ago
A replica exchange Monte Carlo algorithm for protein folding in the HP model
Background: The ab initio protein folding problem consists of predicting protein tertiary structure from a given amino acid sequence by minimizing an energy function; it is one of...
Chris Thachuk, Alena Shmygelska, Holger H. Hoos
ORL
2006
114views more  ORL 2006»
15 years 6 months ago
A (1-1/e)-approximation algorithm for the generalized assignment problem
We give a (1 - 1/e)-approximation algorithm for the Max-Profit Generalized Assignment Problem (Max-GAP) with fixed profits when the profit (but not necessarily the size) of every ...
Zeev Nutov, Israel Beniaminy, Raphael Yuster
EOR
2000
43views more  EOR 2000»
15 years 6 months ago
A framework for the description of evolutionary algorithms
Evolutionary algorithms (EA) are optimisation techniques inspired from natural evolution processes. They handle a population of individuals that evolve with the help of informatio...
Alain Hertz, Daniel Kobler