Sciweavers

87 search results - page 1 / 18
» On the Completeness of Attack Mutation Algorithms
Sort
View
CSFW
2006
IEEE
13 years 11 months ago
On the Completeness of Attack Mutation Algorithms
An attack mutation algorithm takes a known instance of an attack and transforms it into many distinct instances by repeatedly applying attack transformations. Such algorithms are ...
Shai Rubin, Somesh Jha, Barton P. Miller
CORR
2010
Springer
114views Education» more  CORR 2010»
13 years 2 months ago
On the Impact of Mutation-Selection Balance on the Runtime of Evolutionary Algorithms
The interplay between the mutation operator and the selection mechanism plays a fundamental role in the behaviour of evolutionary algorithms (EAs). However, this interplay is stil...
Per Kristian Lehre, Xin Yao
RECOMB
2002
Springer
14 years 5 months ago
Deconvolving sequence variation in mixed DNA populations
We present an original approach to identifying sequence variants in a mixed DNA population from sequence trace data. The heart of the method is based on parsimony: given a wildtyp...
Andy Wildenberg, Steven Skiena, Pavel Sumazin
ITRE
2005
IEEE
13 years 11 months ago
Structure learning of Bayesian networks using a semantic genetic algorithm-based approach
A Bayesian network model is a popular technique for data mining due to its intuitive interpretation. This paper presents a semantic genetic algorithm (SGA) to learn a complete qual...
Sachin Shetty, Min Song
BMCBI
2011
12 years 9 months ago
A mutation degree model for the identification of transcriptional regulatory elements
Background: Current approaches for identifying transcriptional regulatory elements are mainly via the combination of two properties, the evolutionary conservation and the overrepr...
Changqing Zhang, Jin Wang, Xu Hua, Jinggui Fang, H...