3117 search results - page 264 / 624 » The Spatially-Dispersed Genetic Algorithm |
192
click to vote
BMCBI
2011
14 years 10 months ago
2011
Background: Next-generation sequencing (NGS) offers a unique opportunity for high-throughput genomics and has potential to replace Sanger sequencing in many fields, including de-n...
182
click to vote
AUSAI
1999
Springer
15 years 11 months ago
1999
Springer
In previous work solutions for the nesting problem are produced using the no fit polygon (NFP), a new evaluation method and three evolutionary algorithms (simulated annealing (SA),...
246
click to vote
BMCBI
2008
15 years 5 months ago
2008
Background: Genome-wide association studies (GWAS) aim to identify genetic variants (usually single nucleotide polymorphisms [SNPs]) across the entire human genome that are associ...
284
click to vote
SLS
2009
Springer
15 years 11 months ago
2009
Springer
The Multidimensional Assignment Problem (MAP or s-AP in the case of s dimensions) is an extension of the well-known assignment problem. The most studied case of MAP is 3-AP, though...
216
click to vote
BMCBI
2010
15 years 4 months ago
2010
Background: Physical maps are the substrate of genome sequencing and map-based cloning and their construction relies on the accurate assembly of BAC clones into large contigs that...