Sciweavers

193 search results - page 34 / 39
» Chromosome Reuse in Genetic Algorithms
Sort
View
BMCBI
2007
180views more  BMCBI 2007»
13 years 9 months ago
Using expression arrays for copy number detection: an example from E. coli
Background: The sequencing of many genomes and tiling arrays consisting of millions of DNA segments spanning entire genomes have made high-resolution copy number analysis possible...
Dmitriy Skvortsov, Diana Abdueva, Michael E. Stitz...
RECOMB
2009
Springer
14 years 4 months ago
Yeast Ancestral Genome Reconstructions: The Possibilities of Computational Methods
In 2006, a debate has risen on the question of the efficiency of bioinformatics methods to reconstruct mammalian ancestral genomes. Three years later, Gordon et al. (PLoS Genetics,...
Eric Tannier
GECCO
2009
Springer
107views Optimization» more  GECCO 2009»
14 years 4 months ago
Swarming along the evolutionary branches sheds light on genome rearrangement scenarios
A genome rearrangement scenario describes a series of chromosome fusion, fission, and translocation operations that suffice to rewrite one genome into another. Exact algorithmic ...
Nikolay Vyahhi, Adrien Goëffon, Macha Nikolsk...
GECCO
2004
Springer
102views Optimization» more  GECCO 2004»
14 years 3 months ago
Dynamic and Scalable Evolutionary Data Mining: An Approach Based on a Self-Adaptive Multiple Expression Mechanism
Data mining has recently attracted attention as a set of efficient techniques that can discover patterns from huge data. More recent advancements in collecting massive evolving da...
Olfa Nasraoui, Carlos Rojas, Cesar Cardona
ISCIS
2009
Springer
14 years 4 months ago
Channel assignment problem in cellular networks: A reactive tabu search approach
—The channel assignment problem (CAP) in cellular networks is concerned with the allocation and reuse of the frequency spectrum to the base stations in such a way that both the i...
Didem Gözüpek, Gaye Genç, Cem Ers...