Results 71 to 80 of about 7,593,248 (327)
A Novel Genetic Algorithm using Helper Objectives for the 0-1 Knapsack Problem [PDF]
The 0-1 knapsack problem is a well-known combinatorial optimisation problem. Approximation algorithms have been designed for solving it and they return provably good solutions within polynomial time. On the other hand, genetic algorithms are well suited for solving the knapsack problem and they find reasonably good solutions quickly.
arxiv
Multi-objective Genetic Algorithms: Problem Difficulties and Construction of Test Problems
In this paper, we study the problem features that may cause a multi-objective genetic algorithm (GA) difficulty in converging to the true Pareto-optimal front.
K. Deb
semanticscholar +1 more source
MET variants in the N‐lobe of the kinase domain, found in hereditary papillary renal cell carcinoma, require ligand stimulation to promote cell transformation, in contrast to other RTK variants. This suggests that HGF expression in the microenvironment is important for tumor growth in such patients. Their sensitivity to MET inhibitors opens the way for
Célia Guérin+14 more
wiley +1 more source
Design of Novel Metaheuristic Techniques for Clustering
One of the major drawbacks of clustering techniques utilizing a predetermined number of clusters is that it does not guarantee convergence to the global optimum.
Dina A. Moussa+3 more
doaj +1 more source
In molecular cancer diagnostics, comprehensive genomic profiling (CGP) is going to replace the small NGS panels since it provides all clinically relevant somatic variants as well as genomic biomarkers with clinical value. Here, we compared two CGP assays and demonstrate that the choice for diagnostic implementation will depend on the specific ...
Guy Froyen+17 more
wiley +1 more source
Local Crossover: A New Genetic Operator for Grammatical Evolution
The presented work outlines a new genetic crossover operator, which can be used to solve problems by the Grammatical Evolution technique. This new operator intensively applies the one-point crossover procedure to randomly selected chromosomes with the ...
Ioannis G. Tsoulos+2 more
doaj +1 more source
An efficient rank based approach for closest string and closest substring. [PDF]
This paper aims to present a new genetic approach that uses rank distance for solving two known NP-hard problems, and to compare rank distance with other distance measures for strings.
Liviu P Dinu, Radu Ionescu
doaj +1 more source
Variations of Genetic Algorithms [PDF]
The goal of this project is to develop the Genetic Algorithms (GA) for solving the Schaffer F6 function in fewer than 4000 function evaluations on a total of 30 runs. Four types of Genetic Algorithms (GA) are presented - Generational GA (GGA), Steady-State (mu+1)-GA (SSGA), Steady-Generational (mu,mu)-GA (SGGA), and (mu+mu)-GA.
arxiv
Molecular and functional profiling unravels targetable vulnerabilities in colorectal cancer
We used whole exome and RNA‐sequencing to profile divergent genomic and transcriptomic landscapes of microsatellite stable (MSS) and microsatellite instable (MSI) colorectal cancer. Alterations were classified using a computational score for integrative cancer variant annotation and prioritization.
Efstathios‐Iason Vlachavas+15 more
wiley +1 more source
Optimization-Based Image Segmentation by Genetic Algorithms
Many works in the literature focus on the definition of evaluation metrics and criteria that enable to quantify the performance of an image processing algorithm.
Rosenberger C+3 more
doaj +2 more sources