In silico modeling of cancer cell dissemination and metastasis.

Metastasis is the main cause of cancer-related death. It is surprising then that the exact nature of metastasis-the process by which cancer cells leave the primary tumor to reach distant organs, and resume proliferation-is not fully understood. Moreover, the different conditions under which the immune system can either promote or suppress metastasis are only now beginning to be uncovered. In recent years, our understanding of metastasis as a genocentric, cell-autonomous process has shifted toward a systemic model in which interactions between cancer cells and their surrounding microenvironments lead to dissemination and metastasis. In silico modeling of the various steps involved in metastasis can help provide an understanding of how tumor properties emerge from the complex interplays between tumor cells and their microenvironment. In silico models can also be useful in identifying the selective forces that favor the outcomes of cancer cells with metastatic potential.

Selection of Mesenchymal-Like Metastatic Cells in Primary Tumors - An in silico Investigation.

In order to metastasize, cancer cells must undergo phenotypic transition from an anchorage-dependent form to a motile form via a process referred to as epithelial to mesenchymal transition. It is currently unclear whether metastatic cells emerge late during tumor progression by successive accumulation of mutations, or whether they derive from distinct cell populations already present during the early stages of tumorigenesis. Similarly, the selective pressures that drive metastasis are poorly understood. Selection of cancer cells with increased proliferative capacity and enhanced survival characteristics may explain how some transformations promote a metastatic phenotype. However, it is difficult to explain how cancer cells that disseminate can emerge due to such selective pressure, since these cells usually remain dormant for prolonged periods of time. In the current study, we have used in silico modeling and simulation to investigate the hypothesis that mesenchymal-like cancer cells evolve during the early stages of primary tumor development, and that these cells exhibit survival and proliferative advantages within the tumor microenvironment. In an agent-based tumor microenvironment model, cancer cell agents with distinct sets of attributes governing nutrient consumption, proliferation, apoptosis, random motility, and cell adhesion were allowed to compete for space and nutrients. These simulation data indicated that mesenchymal-like cancer cells displaying high motility and low adhesion proliferate more rapidly and display a survival advantage over epithelial-like cancer cells. Furthermore, the presence of mesenchymal-like cells within the primary tumor influences the macroscopic properties, emergent morphology, and growth rate of tumors.

Systems immunology: a survey of modeling formalisms, applications and simulation tools.

Immunological studies frequently analyze individual components (e.g., signaling pathways) of immune systems in a reductionist manner. In contrast, systems immunology aims to give a synthetic understanding of how these components function together as a whole. While immunological research involves in vivo and in vitro experiments, systems immunology research can also be conducted in silico. With an increasing interest in systems-level studies spawned by high-throughput technologies, many immunologists are looking forward to insights provided by computational modeling and simulation. However, modeling and simulation research has mainly been conducted in computational fields, and therefore, little material is available or accessible to immunologists today. This survey is an attempt at bridging the gap between immunologists and systems immunology modeling and simulation. Modeling and simulation refer to building and executing an in silico replica of an immune system. Models are specified within a mathematical or algorithmic framework called formalism and then implemented using software tools. A plethora of modeling formalisms and software tools are reported in the literature for systems immunology. However, it is difficult for a new entrant to the field to know which of these would be suitable for modeling an immunological application at hand. This paper covers three aspects. First, it introduces the field of system immunology emphasizing on the modeling and simulation components. Second, it gives an overview of the principal modeling formalisms, each of which is illustrated with salient applications in immunological research. This overview of formalisms and applications is conducted not only to illustrate their power but also to serve as a reference to assist immunologists in choosing the best formalism for the problem at hand. Third, it lists major software tools, which can be used to practically implement models in these formalisms. Combined, these aspects can help immunologists to start experimenting with in silico models. Finally, future research directions are discussed. Particularly, we identify integrative frameworks to facilitate the coupling of different modeling formalisms and modeling the adaptation properties through evolution of immune systems as the next key research efforts necessary to further develop the multidisciplinary field of systems immunology.

Detection of spatially correlated objects in 3D images using appearance models and coupled active contours.

We consider the problem of segmenting 3D images that contain a dense collection of spatially correlated objects, such as fluorescent labeled cells in tissue. Our approach involves an initial modeling phase followed by a data-fitting segmentation phase. In the first phase, cell shape (membrane bound) is modeled implicitly using a parametric distribution of correlation function estimates. The nucleus is modeled for its shape as well as image intensity distribution inspired from the physics of its image formation. In the second phase, we solve the segmentation problem using a variational level-set strategy with coupled active contours to minimize a novel energy functional. We demonstrate the utility of our approach on multispectral fluorescence microscopy images.

Streaming level set algorithm for 3D segmentation of confocal microscopy images.

We present a high performance variant of the popular geodesic active contours which are used for splitting cell clusters in microscopy images. Previously, we implemented a linear pipelined version that incorporates as many cues as possible into developing a suitable level-set speed function so that an evolving contour exactly segments a cell/nuclei blob. We use image gradients, distance maps, multiple channel information and a shape model to drive the evolution. We also developed a dedicated seeding strategy that uses the spatial coherency of the data to generate an over complete set of seeds along with a quality metric which is further used to sort out which seed should be used for a given cell. However, the computational performance of any level-set methodology is quite poor when applied to thousands of 3D data-sets each containing thousands of cells. Those data-sets are common in confocal microscopy. In this work, we explore methods to stream the algorithm in shared memory, multi-core environments. By partitioning the input and output using spatial data structures we insure the spatial coherency needed by our seeding algorithm as well as improve drastically the speed without memory overhead. Our results show speed-ups up to a factor of six.

Computing shortest cycles on discrete surfaces for acurate topological modifications of medical image isosurfaces.

Topological control over discrete isosurface is of primordial interest in medical applications, especially discrete model building for active contours. Previous attempts showed that the key point in acurately modifying topology was computation of shortest cycles on the surface of interest. This paper generalizes the shortest path algorithm to compute shortest cycles in a given homotopy class on a discrete surface with arbitrary topology. The algorithm is simple to implement and general to all kinds of discrete surfaces. The algorithm is validated against synthetic surfaces.