Randomized search heuristics, among them randomized local search and evolutionary algorithms, are applied to problems whose structure is not well understood, as well as to problems...
Determining the evolutionary history of a given biological data is an important task in biological sciences. Given a set of quartet topologies over a set of taxa, the Maximum Quart...
Many current heuristics for domain-independent planning, such as Bonet and Geffner's additive heuristic and Hoffmann and Nebel's FF heuristic, are based on delete relaxa...
We present a general heuristicfor the median problem for induced breakpoints on genomes with unequal gene content and incorporate this into a routine for estimating optimal gene o...
Under a stochastic model of molecular sequence evolution the probability of each possible pattern of characters is well defined. The Kimura's three-substitution-types (K3ST) m...