Sciweavers

1422 search results - page 84 / 285
» Test Generation Algorithms Based on Preorder Relations
Sort
View
PR
1998
86views more  PR 1998»
14 years 9 months ago
Optimizing the cost matrix for approximate string matching using genetic algorithms
This paper describes a method for optimizing the cost matrix of any approximate string matching algorithm based on the Levenshtein distance. The method, which uses genetic algorit...
Marc Parizeau, Nadia Ghazzali, Jean-Françoi...
DAGSTUHL
2007
14 years 11 months ago
Weighted Voronoi Region Algorithms for Political Districting
Automated political districting shares with electronic voting the aim of preventing electoral manipulation and pursuing an impartial electoral mechanism. Political districting can...
Bruno Simeone, Federica Ricca, Andrea Scozzari
BMCBI
2006
115views more  BMCBI 2006»
14 years 10 months ago
The accuracy of several multiple sequence alignment programs for proteins
Background: There have been many algorithms and software programs implemented for the inference of multiple sequence alignments of protein and DNA sequences. The "true" ...
Paulo A. S. Nuin, Zhouzhi Wang, Elisabeth R. M. Ti...
BMCBI
2006
169views more  BMCBI 2006»
14 years 10 months ago
Comparative analysis of haplotype association mapping algorithms
Background: Finding the genetic causes of quantitative traits is a complex and difficult task. Classical methods for mapping quantitative trail loci (QTL) in miceuse an F2 cross b...
Phillip McClurg, Mathew T. Pletcher, Tim Wiltshire...
GECCO
2003
Springer
124views Optimization» more  GECCO 2003»
15 years 3 months ago
ERA: An Algorithm for Reducing the Epistasis of SAT Problems
A novel method, for solving satisfiability (SAT) instances is presented. It is based on two components: a) An Epistasis Reducer Algorithm (ERA) that produces a more suited represe...
Eduardo Rodriguez-Tello, Jose Torres-Jimenez