Evolving Nano Particle Cancer Treatments with Multiple Particle Types

• URL: http://arxiv.org/abs/2011.04975v1
• Date: Tue, 10 Nov 2020 08:46:30 GMT
• Title: Evolving Nano Particle Cancer Treatments with Multiple Particle Types
• Authors: Michail-Antisthenis Tsompanas, Larry Bull, Andrew Adamatzky, Igor Balaz
• Abstract summary: This paper investigates the problem of designing a nano-particle based drug delivery system targeting cancer tumours. utilizing multiple types of NPs is expected to be more effective due to the higher complexity of the treatment. The results suggest that utilizing multiple types of NPs is more efficient when the solution space is explored with the evolutionary techniques under a predefined computational budget.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Evolutionary algorithms have long been used for optimization problems where the appropriate size of solutions is unclear a priori. The applicability of this methodology is here investigated on the problem of designing a nano-particle (NP) based drug delivery system targeting cancer tumours. Utilizing a treatment comprising of multiple types of NPs is expected to be more effective due to the higher complexity of the treatment. This paper begins by utilizing the well-known NK model to explore the effects of fitness landscape ruggedness upon the evolution of genome length and, hence, solution complexity. The size of a novel sequence and the absence or presence of sequence deletion are also considered. Results show that whilst landscape ruggedness can alter the dynamics of the process, it does not hinder the evolution of genome length. These findings are then explored within the aforementioned real-world problem. In the first known instance, treatments with multiple types of NPs are used simultaneously, via an agent-based open source physics-based cell simulator. The results suggest that utilizing multiple types of NPs is more efficient when the solution space is explored with the evolutionary techniques under a predefined computational budget.

Related papers

• Selective Task offloading for Maximum Inference Accuracy and Energy efficient Real-Time IoT Sensing Systems [3.0748861313823]
  We propose a lightweight hybrid genetic algorithm (LGSTO) to solve the multidimensional knapsack problem. Experiment results show that LGSTO performed 3 times faster than the fastest comparable schemes.
  arXiv  Detail & Related papers  (2024-02-24T18:46:06Z)
• Tumoral Angiogenic Optimizer: A new bio-inspired based metaheuristic [5.013833066304755]
  We propose a new metaheuristic inspired by the morphogenetic cellular movements of endothelial cells (ECs) that occur during the tumor angiogenesis process. The proposed algorithm is applied to real-world problems (cantilever beam design, pressure vessel design, tension/compression spring and sustainable explotation renewable resource)
  arXiv  Detail & Related papers  (2023-09-12T03:51:53Z)
• FaDIn: Fast Discretized Inference for Hawkes Processes with General Parametric Kernels [82.53569355337586]
  This work offers an efficient solution to temporal point processes inference using general parametric kernels with finite support. The method's effectiveness is evaluated by modeling the occurrence of stimuli-induced patterns from brain signals recorded with magnetoencephalography (MEG) Results show that the proposed approach leads to an improved estimation of pattern latency than the state-of-the-art.
  arXiv  Detail & Related papers  (2022-10-10T12:35:02Z)
• An Application of a Multivariate Estimation of Distribution Algorithm to Cancer Chemotherapy [59.40521061783166]
  Chemotherapy treatment for cancer is a complex optimisation problem with a large number of interacting variables and constraints. We show that the more sophisticated algorithm would yield better performance on a complex problem like this. We hypothesise that this is caused by the more sophisticated algorithm being impeded by the large number of interactions in the problem.
  arXiv  Detail & Related papers  (2022-05-17T15:28:46Z)
• Modelling and optimization of nanovector synthesis for applications in drug delivery systems [0.0]
  Review focuses on the use of artificial intelligence and metaheuristic algorithms for nanoparticles synthesis in drug delivery systems. neural networks are better at modelling NVs properties than linear regression algorithms and response surface methodology. For metaheuristic algorithms, benchmark functions were optimized with cuckoo search, firefly algorithm, genetic algorithm and symbiotic organism search.
  arXiv  Detail & Related papers  (2021-11-10T20:52:27Z)
• Improving RNA Secondary Structure Design using Deep Reinforcement Learning [69.63971634605797]
  We propose a new benchmark of applying reinforcement learning to RNA sequence design, in which the objective function is defined to be the free energy in the sequence's secondary structure. We show results of the ablation analysis that we do for these algorithms, as well as graphs indicating the algorithm's performance across batches.
  arXiv  Detail & Related papers  (2021-11-05T02:54:06Z)
• Brain Image Synthesis with Unsupervised Multivariate Canonical CSC$\ell_4$Net [122.8907826672382]
  We propose to learn dedicated features that cross both intre- and intra-modal variations using a novel CSC$ell_4$Net.
  arXiv  Detail & Related papers  (2021-03-22T05:19:40Z)
• Complexity-based speciation and genotype representation for neuroevolution [81.21462458089142]
  This paper introduces a speciation principle for neuroevolution where evolving networks are grouped into species based on the number of hidden neurons. The proposed speciation principle is employed in several techniques designed to promote and preserve diversity within species and in the ecosystem as a whole.
  arXiv  Detail & Related papers  (2020-10-11T06:26:56Z)
• AdaLead: A simple and robust adaptive greedy search algorithm for sequence design [55.41644538483948]
  We develop an easy-to-directed, scalable, and robust evolutionary greedy algorithm (AdaLead) AdaLead is a remarkably strong benchmark that out-competes more complex state of the art approaches in a variety of biologically motivated sequence design challenges.
  arXiv  Detail & Related papers  (2020-10-05T16:40:38Z)
• Devolutionary genetic algorithms with application to the minimum labeling Steiner tree problem [0.0]
  This paper characterizes and discusses devolutionary genetic algorithms and evaluates their performances in solving the minimum labeling Steiner tree (MLST) problem. We define devolutionary algorithms as the process of reaching a feasible solution by devolving a population of super-optimal unfeasible solutions over time. We show how classical evolutionary concepts, such as crossing, mutation and fitness can be adapted to aim at reaching an optimal or close-to-optimal solution.
  arXiv  Detail & Related papers  (2020-04-18T13:27:28Z)
• Utilizing Differential Evolution into optimizing targeted cancer treatments [0.0]
  Investigation of Differential Evolution was motivated by the high efficiency of variations of this technique in real-valued problems. A basic DE algorithm, namely "DE/rand/1" was used to optimize the simulated design of a targeted drug delivery system for tumor treatment on PhysiCell simulator.
  arXiv  Detail & Related papers  (2020-03-21T10:20:43Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.