SBSven Bilke

Sven Bilke

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Sven Bilke has a total of 6 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Probabilistic estimation of microarray data reliability and underlying gene expression

    by S. Bilke, T. Breslin, M. Sigvardsson

    Background: The availability of high throughput methods for measurement of mRNA concentrations makes the reliability of conclusions drawn from the data and global quality control of samples and hybridization important issues. We address these issues by an information theoretic approach, applied to discretized expression values in replicated gene expression data. Results: Our approach yields a quantitative measure of two important parameter classes: First, the probability $P(\sigma | S)$ that a gene is in the biological state $\sigma$ in a certain variety, given its observed expression $S$ in the samples of that variety. Second, sample specific error probabilities which serve as consistency indicators of the measured samples of each variety. The method and its limitations are tested on gene expression data for developing murine B-cells and a $t$-test is used as reference. On a set of known genes it performs better than the $t$-test despite the crude discretization into only two expression levels. The consistency indicators, i.e. the error probabilities, correlate well with variations in the biological material and thus prove efficient. Conclusions: The proposed method is effective in determining differential gene expression and sample reliability in replicated microarray data. Already at two discrete expression levels in each sample, it gives a good explanation of the data and is comparable to standard techniques.

  • Open Access

    Probabilistic estimation of microarray data reliability and underlying gene expression

    by Sven Bilke, Thomas Breslin, Mikael Sigvardsson

    The availability of high throughput methods for measurement of mRNA concentrations makes the reliability of conclusions drawn from the data and global quality control of samples and hybridization important issues. We address these issues by an information theoretic approach, applied to discretized expression values in replicated gene expression data. Our approach yields a quantitative measure of two important parameter classes: First, the probability P(σ|S) that a gene is in the biological state σ in a certain variety, given its observed expression S in the samples of that variety. Second, sample specific error probabilities which serve as consistency indicators of the measured samples of each variety. The method and its limitations are tested on gene expression data for developing murine B-cells and a t-test is used as reference. On a set of known genes it performs better than the t-test despite the crude discretization into only two expression levels. The consistency indicators, i.e. the error probabilities, correlate well with variations in the biological material and thus prove efficient. The proposed method is effective in determining differential gene expression and sample reliability in replicated microarray data. Already at two discrete expression levels in each sample, it gives a good explanation of the data and is comparable to standard techniques.


  • Open Access

    Effective Field Theoretical Approach to Black Hole Production

    by Sven Bilke, Edisher Lipartia, Martin Maul

    A field theoretical description of mini black hole production at TeV energies is given taking into account the quantization of black holes in discrete resonances. The unknown quantum gravitational effects are absorbed in effective couplings, black hole masses and the Hawking temperature. The evaporation is described in terms of thermal field theory.

  • Stability of the Kauffman model

    by Sven Bilke, Fredrik Sjunnesson

    Random Boolean networks, the Kauffman model, are revisited by means of a novel decimation algorithm, which removes variables that cannot be relevant to the asymptotic dynamics of the system. The major part of the removed variables have the same fixed state in all limit cycles. These variables are denoted as the stable core of the network and their number grows approximately linearly with N, the number of variables in the original network. The sensitivity of the attractors to perturbations is investigated. We find that reduced networks lack the well-known insensitivity observed in full Kauffman networks. We conclude that, somewhat counterintuitive, this remarkable property of full Kauffman networks is generated by the dynamics of their stable core. The decimation method is also used to simulate large critical Kauffman networks. For networks up to N=32 we perform full enumeration studies. Strong evidence is provided that the number of limit cycles grows linearly with N. This result is in sharp contrast to the often cited N behavior.


  • Topological properties of citation and metabolic networks

    by Sven Bilke, Carsten Peterson

    Topological properties of “scale-free” networks are investigated by determining their spectral dimensions dS, which reflect a diffusion process in the corresponding graphs. Data bases for citation networks and metabolic networks together with simulation results from the growing network model [A.-L. Barabasi and R. Albert, Science 286, 509 (1999)] are probed. For completeness and comparisons lattice, random and small-world models are also investigated. We find that dS is around 3 for citation and metabolic networks, which is significantly different from the growing network model, for which dS is approximately 7.5. This signals a substantial difference in network topology despite the observed similarities in vertex-order distributions. In addition, the diffusion analysis indicates that the citation networks are treelike in structure, whereas the metabolic networks contain many loops.


  • Open Access

    Shuffling Yeast Gene Expression Data

    by Sven Bilke

    A new method to sort gene expression patterns into functional groups is presented. The method is based on a sorting algorithm using a non-local similarity score, which takes all other patterns in the dataset into account. The method is therefore very robust with respect to noise. Using the expression data for yeast, we extract information about functional groups. Without prior knowledge of parameters the cell cycle regulated genes in yeast can be identified. Furthermore a second, independent cell clock is identified. The capability of the algorithm to extract information about signal flow in the regulatory network underlying the expression patterns is demonstrated.