EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Identifiability, Sensitivity, and Genetic Algorithms in Bacterial Biofilm Selection Models

Stephen Williams, Daravuth Cheam, Michele K Nishiguchi, Suzanne S Sindi, Shilpa Khatri, Erica M Rutter

Bulletin of Mathematical Biology · 2026-07 · 88 (7)

DOI: 10.1007/s11538-026-01693-5 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Bulletin of Mathematical Biology, online erschienen am 02.07.2026. Verfasst von Stephen Williams und 5 weiteren Autor:innen. Beteiligte Einrichtung: Department of Applied Mathematics, University of California, Merced, California, US. Hauptthemen laut MEDLINE: Biofilms, Models, Biological, Bacterial Physiological Phenomena. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 72 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Science Foundation.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Bacteria often develop distinct phenotypes to adapt to environmental stress. In particular, they can produce biofilms, dense communities of bacteria that live in a complex extracellular matrix. While previous studies have investigated how bacterial biofilms are regulated under laboratory conditions, they have not considered (1) the data requirements necessary to estimate model parameters and (2) how bacteria respond to recurring stressors in their natural habitats. To address (1), we adapted a mechanistic population model to explore the dynamics of biofilm formation in the presence of predator stress, using synthetic data. We used a Maximum Likelihood Estimation framework to measure crucial parameters underpinning the biofilm formation dynamics. We used genetic algorithms to propose an optimal data collection schedule that minimised parameter identifiability confidence interval widths. Our sensitivity analysis revealed that, within the explored regimes, we could simplify the binding dynamics and eliminate biofilm detachment. To address (2), we proposed a structured version of our model to capture the long-term behaviour and evolutionary selection. In our extended model, the subpopulations feature different maximal rates of biofilm formation. We compared the selection under different predator types and amounts and identified key parameters that affected the speed of selection via sensitivity analysis.

Schlagwörter

MeSH-Schlagwörter (MEDLINE)

BiofilmsModels, BiologicalBacterial Physiological PhenomenaMathematical ConceptsGenetic AlgorithmsComputer SimulationLikelihood FunctionsBiological Evolution

Stichwörter der Autor:innen

Optimal experimental designParameter identifiability

Autor:innen und Institutionen

  • Department of Applied Mathematics, University of California, Merced, California, US.
  • Department of Molecular and Cell Biology, University of California, Merced, California, US.
  • Quantitative and Systems Biology, University of California, Merced, California, US.
  • Department of Applied Mathematics, University of California, Merced, California, US. erutter2@ucmerced.edu.

Förderung

  • National Science Foundation

Zitieren

APA

Williams, S., Cheam, D., Nishiguchi, M. K., Sindi, S. S., Khatri, S., & Rutter, E. M. (2026). Identifiability, Sensitivity, and Genetic Algorithms in Bacterial Biofilm Selection Models. Bulletin of Mathematical Biology, 88(7). https://doi.org/10.1007/s11538-026-01693-5

Vancouver

Williams S, Cheam D, Nishiguchi MK, Sindi SS, Khatri S, Rutter EM. Identifiability, Sensitivity, and Genetic Algorithms in Bacterial Biofilm Selection Models. Bulletin of Mathematical Biology. 2026;88(7). doi:10.1007/s11538-026-01693-5

BibTeX
@article{Williams2026,
  author = {Williams, Stephen and Cheam, Daravuth and Nishiguchi, Michele K and Sindi, Suzanne S and Khatri, Shilpa and Rutter, Erica M},
  title = {Identifiability, Sensitivity, and Genetic Algorithms in Bacterial Biofilm Selection Models},
  journal = {Bulletin of Mathematical Biology},
  year = {2026},
  volume = {88},
  number = {7},
  doi = {10.1007/s11538-026-01693-5}
}
Kostenlos starten →