Sciweavers

2152 search results - page 407 / 431
» Backward-chaining evolutionary algorithms
Sort
View
RECOMB
1997
Springer
15 years 1 months ago
On the complexity and approximation of syntenic distance
The paper studies the computational complexity and approximation algorithms for a new evolutionary distance between multi-chromosomal genomes introduced recently by Ferretti, Nade...
Bhaskar DasGupta, Tao Jiang, Sampath Kannan, Ming ...
CEC
2007
IEEE
15 years 1 months ago
Mining association rules from databases with continuous attributes using genetic network programming
Most association rule mining algorithms make use of discretization algorithms for handling continuous attributes. Discretization is a process of transforming a continuous attribute...
Karla Taboada, Eloy Gonzales, Kaoru Shimada, Shing...
GECCO
2006
Springer
159views Optimization» more  GECCO 2006»
15 years 1 months ago
Multi-step environment learning classifier systems applied to hyper-heuristics
Heuristic Algorithms (HA) are very widely used to tackle practical problems in operations research. They are simple, easy to understand and inspire confidence. Many of these HAs a...
Javier G. Marín-Blázquez, Sonia Schu...
82
Voted
RECOMB
2006
Springer
15 years 10 months ago
Efficient Enumeration of Phylogenetically Informative Substrings
We study the problem of enumerating substrings that are common amongst genomes that share evolutionary descent. For example, one might want to enumerate all identical (therefore co...
Stanislav Angelov, Boulos Harb, Sampath Kannan, Sa...
75
Voted
RECOMB
2006
Springer
15 years 10 months ago
A Parsimony Approach to Genome-Wide Ortholog Assignment
The assignment of orthologous genes between a pair of genomes is a fundamental and challenging problem in comparative genomics, since many computational methods for solving various...
Zheng Fu, Xin Chen, Vladimir Vacic, Peng Nan, Yang...