
arXiv: 1208.3857
This paper introduces Cancer Hybrid Automata (CHAs), a formalism to model the progression of cancers through discrete phenotypes. The classification of cancer progression using discrete states like stages and hallmarks has become common in the biology literature, but primarily as an organizing principle, and not as an executable formalism. The precise computational model developed here aims to exploit this untapped potential, namely, through automatic verification of progression models (e.g., consistency, causal connections, etc.), classification of unreachable or unstable states and computer-generated (individualized or universal) therapy plans. The paper builds on a phenomenological approach, and as such does not need to assume a model for the biochemistry of the underlying natural progression. Rather, it abstractly models transition timings between states as well as the effects of drugs and clinical tests, and thus allows formalization of temporal statements about the progression as well as notions of timed therapies. The model proposed here is ultimately based on hybrid automata, and we show how existing controller synthesis algorithms can be generalized to CHA models, so that therapies can be generated automatically. Throughout this paper we use cancer hallmarks to represent the discrete states through which cancer progresses, but other notions of discretely or continuously varying state formalisms could also be used to derive similar therapies.
In Proceedings HSB 2012, arXiv:1208.3151
FOS: Computer and information sciences, Formal Languages and Automata Theory (cs.FL), Computer Science - Formal Languages and Automata Theory, QA75.5-76.95, Systems and Control (eess.SY), Electrical Engineering and Systems Science - Systems and Control, Electronic computers. Computer science, QA1-939, FOS: Electrical engineering, electronic engineering, information engineering, Mathematics
FOS: Computer and information sciences, Formal Languages and Automata Theory (cs.FL), Computer Science - Formal Languages and Automata Theory, QA75.5-76.95, Systems and Control (eess.SY), Electrical Engineering and Systems Science - Systems and Control, Electronic computers. Computer science, QA1-939, FOS: Electrical engineering, electronic engineering, information engineering, Mathematics
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 1 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
