Displaying 401 – 420 of 1850

Showing per page

Characterization of lung tumor subtypes through gene expression cluster validity assessment

Giorgio Valentini, Francesca Ruffino (2006)

RAIRO - Theoretical Informatics and Applications

The problem of assessing the reliability of clusters patients identified by clustering algorithms is crucial to estimate the significance of subclasses of diseases detectable at bio-molecular level, and more in general to support bio-medical discovery of patterns in gene expression data. In this paper we present an experimental analysis of the reliability of clusters discovered in lung tumor patients using DNA microarray data. In particular we investigate if subclasses of lung adenocarcinoma...

Chemotaxis models with a threshold cell density

Dariusz Wrzosek (2008)

Banach Center Publications

We consider a quasilinear parabolic system which has the structure of Patlak-Keller-Segel model of chemotaxis and contains a class of models with degenerate diffusion. A cell population is described in terms of volume fraction or density. In the latter case, it is assumed that there is a threshold value which the density of cells cannot exceed. Existence and uniqueness of solutions to the corresponding initial-boundary value problem and existence of space inhomogeneous stationary solutions are discussed....

Classification des solutions d’un problème elliptique fortement non linéaire

A. Benaouda, A. Gmira, B. Hamri (2005)

Annales mathématiques Blaise Pascal

On étudie la classification des solutions du problème elliptique ( u p - 2 u ) ( t ) + u q - 1 u ( t ) - f ( t ) u m - 1 u ( t ) = 0 , t > 0 , q > 1 , p m + 1 > 2 et f une fonction changeant de signe. En utilisant une méthode de tire, On montre qu’en partant avec une dérivée initiale nulle toutes les solutions sont globales. De plus si p > m + 1 et q > ( p - 1 ) ( m + 1 ) / p l’ensemble des solutions est constitué d’une seule solution à support compact et de deux familles de solutions ; celles qui sont strictement positives et celles qui changent de signes. On montre aussi que ces deux familles tendent vers l’infini quand...

Codings and operators in two genetic algorithms for the leaf-constrained minimum spanning tree problem

Bryant Julstrom (2004)

International Journal of Applied Mathematics and Computer Science

The features of an evolutionary algorithm that most determine its performance are the coding by which its chromosomes represent candidate solutions to its target problem and the operators that act on that coding. Also, when a problem involves constraints, a coding that represents only valid solutions and operators that preserve that validity represent a smaller search space and result in a more effective search. Two genetic algorithms for the leaf-constrained minimum spanning tree problem illustrate...

Currently displaying 401 – 420 of 1850