93 research outputs found

    Edge-weighting of gene expression graphs

    Get PDF
    In recent years, considerable research efforts have been directed to micro-array technologies and their role in providing simultaneous information on expression profiles for thousands of genes. These data, when subjected to clustering and classification procedures, can assist in identifying patterns and providing insight on biological processes. To understand the properties of complex gene expression datasets, graphical representations can be used. Intuitively, the data can be represented in terms of a bipartite graph, with weighted edges corresponding to gene-sample node couples in the dataset. Biologically meaningful subgraphs can be sought, but performance can be influenced both by the search algorithm, and, by the graph-weighting scheme and both merit rigorous investigation. In this paper, we focus on edge-weighting schemes for bipartite graphical representation of gene expression. Two novel methods are presented: the first is based on empirical evidence; the second on a geometric distribution. The schemes are compared for several real datasets, assessing efficiency of performance based on four essential properties: robustness to noise and missing values, discrimination, parameter influence on scheme efficiency and reusability. Recommendations and limitations are briefly discussed

    The least common multiple of a sequence of products of linear polynomials

    Full text link
    Let f(x)f(x) be the product of several linear polynomials with integer coefficients. In this paper, we obtain the estimate: loglcm(f(1),...,f(n))An\log {\rm lcm}(f(1), ..., f(n))\sim An as nn\rightarrow\infty , where AA is a constant depending on ff.Comment: To appear in Acta Mathematica Hungaric

    The impact of Stieltjes' work on continued fractions and orthogonal polynomials

    Full text link
    Stieltjes' work on continued fractions and the orthogonal polynomials related to continued fraction expansions is summarized and an attempt is made to describe the influence of Stieltjes' ideas and work in research done after his death, with an emphasis on the theory of orthogonal polynomials

    SPARSE Reduces Conjunctively to TALLY

    Full text link

    On Chebyshev Polynomials of Matrices

    Full text link

    Reasonable Sample Sizes for Convergence to Normality

    Full text link
    The central limit theorem says that, provided an estimator fulfills certain weak conditions, then, for reasonable sample sizes, the sampling distribution of the estimator converges to normality. We propose a procedure to find out what a "reasonably large sample size" is. The procedure is based on the properties of Gini's mean difference decomposition. We show the results of implementations of the procedure from simulated datasets and data from the German Socio-economic Panel

    Interacting finite-size magnons

    Full text link
    We explicitly construct a large class of finite-volume two-magnon string solutions moving on R x S^2. In particular, by making use of the relationship between the O(3) sigma model and sine-Gordon theory we are able to find solutions corresponding to the periodic analogues of magnon scattering and breather-like solutions. After semi-classically quantizing these solutions we invert the implicit expressions for the excitation energies in certain limits and find the corrections for the multi-magnon states. For the breather-like solutions we express the energies directly in terms of the action variable whereas for the scattering solution we express the result as a combination of corrections to the dispersion relation and to the scattering phase.Comment: 45pages, 7figures, v2: simplified expressions for periods and angular momenta when elliptic modulus is greater than one, references added, typos correcte
    corecore