Sciweavers

454 search results - page 41 / 91
» On improving approximate solutions by evolutionary algorithm...
Sort
View
JCB
2007
99views more  JCB 2007»
15 years 1 months ago
Duplication and Inversion History of a Tandemly Repeated Genes Family
Given a phylogenetic tree for a family of tandemly repeated genes and their signed order on the chromosome, we aim to find the minimum number of inversions compatible with an evo...
Mathieu Lajoie, Denis Bertrand, Nadia El-Mabrouk, ...
ISAAC
2004
Springer
135views Algorithms» more  ISAAC 2004»
15 years 7 months ago
Geometric Optimization Problems Over Sliding Windows
Abstract. We study the problem of maintaining a (1+ )-factor approximation of the diameter of a stream of points under the sliding window model. In one dimension, we give a simple ...
Timothy M. Chan, Bashir S. Sadjad
IAT
2006
IEEE
15 years 7 months ago
Using Prior Knowledge to Improve Distributed Hill Climbing
The Distributed Probabilistic Protocol (DPP) is a new, approximate algorithm for solving Distributed Constraint Satisfaction Problems (DCSPs) that exploits prior knowledge to impr...
Roger Mailler
CORR
2004
Springer
119views Education» more  CORR 2004»
15 years 1 months ago
The Largest Compatible Subset Problem for Phylogenetic Data
Abstract. The phylogenetic tree construction is to infer the evolutionary relationship between species from the experimental data. However, the experimental data are often imperfec...
Andy Auyeung, Ajith Abraham
ALGORITHMICA
2005
195views more  ALGORITHMICA 2005»
15 years 1 months ago
Bit-Parallel Witnesses and Their Applications to Approximate String Matching
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
Heikki Hyyrö, Gonzalo Navarro