GeneRank: Using search engine technology for the analysis of microarray experiments

Copyright @ 2005 Morrison et al; licensee BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.Background: Interpretation of simple microarray experiments is usually based on the fold-change of gene expression between a reference and a "treated" sample where the treatment can be of many types from drug exposure to genetic variation. Interpretation of the results usually combines lists of differentially expressed genes with previous knowledge about their biological function. Here we evaluate a method – based on the PageRank algorithm employed by the popular search engine Google – that tries to automate some of this procedure to generate prioritized gene lists by exploiting biological background information. Results: GeneRank is an intuitive modification of PageRank that maintains many of its mathematical properties. It combines gene expression information with a network structure derived from gene annotations (gene ontologies) or expression profile correlations. Using both simulated and real data we find that the algorithm offers an improved ranking of genes compared to pure expression change rankings. Conclusion: Our modification of the PageRank algorithm provides an alternative method of evaluating microarray experimental results which combines prior knowledge about the underlying network. GeneRank offers an improvement compared to assessing the importance of a gene based on its experimentally observed fold-change alone and may be used as a basis for further analytical developments

Ranking the importance of nuclear reactions for activation and transmutation events

Pathways-reduced analysis is one of the techniques used by the Fispact-II nuclear activation and transmutation software to study the sensitivity of the computed inventories to uncertainties in reaction cross-sections. Although deciding which pathways are most important is very helpful in for example determining which nuclear data would benefit from further refinement, pathways-reduced analysis need not necessarily define the most critical reaction, since one reaction may contribute to several different pathways. This work examines three different techniques for ranking reactions in their order of importance in determining the final inventory, comparing the pathways based metric (PBM), the direct method and one based on the Pearson correlation coefficient. Reasons why the PBM is to be preferred are presented.Comment: 30 pages, 10 figure

A Bayesian approach for parameter estimation in the extended clock gene circuit of Arabidopsis thaliana

The circadian clock is an important molecular mechanism that enables many organisms to anticipate and adapt to environmental change. Pokhilko et al. recently built a deterministic ODE mathematical model of the plant circadian clock in order to understand the behaviour, mechanisms and properties of the system. The model comprises 30 molecular species (genes, mRNAs and proteins) and over 100 parameters. The parameters have been fitted heuristically to available gene expression time series data and the calibrated model has been shown to reproduce the behaviour of the clock components. Ongoing work is extending the clock model to cover downstream effects, in particular metabolism, necessitating further parameter estimation and model selection. This work investigates the challenges facing a full Bayesian treatment of parameter estimation. Using an efficient adaptive MCMC proposed by Haario et al. and working in a high performance computing setting, we quantify the posterior distribution around the proposed parameter values and explore the basin of attraction. We investigate if Bayesian inference is feasible in this high dimensional setting and thoroughly assess convergence and mixing with different statistical diagnostics, to prevent apparent convergence in some domains masking poor mixing in others

Assessment of oxygen plasma ashing as a pre-treatment for radiocarbon dating

This study investigates the potential of low-temperature oxygen plasma ashing as a technique for decontaminating charcoal and wood samples prior to radiocarbon dating. Plasma ashing is demonstrated to be rapid, controllable and surface-specific, and clear differences are identified in the rate of ashing in different organic materials. However, the ability of plasma ashing to selectively remove these different components is limited in heterogeneous sample matrices. This is because oxidation is confined to the immediate sample surface. Comparison of radiocarbon dates obtained from identical aliquots of contaminated ancient charcoal pre-treated by acid-base-acid (ABA), acid-base-oxidation-stepped combustion (ABOx-SC) and plasma ashing suggests that the technique performs as well as the ABA pre-treatment but does not remove as much contamination as the ABOx-SC technique. Plasma-ashing may be particularly useful in cases where sample size is limiting

Isolation-by-Distance Gene Flow Among Vermilion Snapper (Rhomboplites aurorubens Cuvier, 1829

Using 12 microsatellite DNA markers, spatial patterns in genetic variation were investigated for 618 specimens of vermilion snapper (Rhomboplites aurorubens). Specimens were obtained from nine collection areas within coastal U.S. waters of the southeastern Atlantic and Gulf of Mexico. Allelic counts ranged from 3 to 29; sample gene diversities ranged from 0.08 to 0.941. Departures from Hardy-Weinberg expectations were observed at one locus in two samples. In both cases, heterozygote deficiencies accounted for the significant test result. Because sample FIs values were also significantly positive for this locus, it was excluded from further analysis. In tests for allele frequency heterogeneity, no differences were observed between any sample pair at any locus or over all loci. For some analyses, collection areas were partitioned into four regional groups (Atlantic, eastern gulf, northern gulf, and western gulf). Small but statistically significant allele frequencies differences were observed between the Atlantic group and the northern, eastern, and western gulf groups. However, fixation-index, AMOVA, and Bayesian analyses were consistent with a null hypothesis that all specimens belonged to a single, panmictic population. Significant patterns of isolation-by-distance gene flow emerged from the Mantel testing and spatial autocorrelation analyses (SAC), both within the gulf and over the tested Atlantic-gulf range. In the overall SAC analysis, the mean r-intercept value, which reflects the maximum scale of genetically effective dispersal, was 1,085 km. From these results, it may be inferred that the population dynamics of vermilion snapper in the western Gulf will be independent of those in the eastern Gulf

Modelling the cAMP pathway using BioNessie, and the use of BVP techniques for solving ODEs (Poster Presentation)

Copyright @ 2007 Gu et al; licensee BioMed Central LtdBiochemists often conduct experiments in-vivo in order to explore observable behaviours and understand the dynamics of many intercellular and intracellular processes. However an intuitive understanding of their dynamics is hard to obtain because most pathways of interest involve components connected via interlocking loops. Formal methods for modelling and analysis of biochemical pathways are therefore indispensable. To this end, ODEs (ordinary differential equations) have been widely adopted as a method to model biochemical pathways because they have an unambiguous mathematical format and are amenable to rigorous quantitative analysis. BioNessie http://www.bionessie.com webcite is a workbench for the composition, simulation and analysis of biochemical networks which is being developed in by the Systems Biology team at the Bioinformatics Research Centre as a part of a large DTI funded project 'BPS: A Software Tool for the Simulation and Analysis of Biochemical Networks' http://www.brc.dcs.gla.ac.uk/projects/dti_beacon webcite. BioNessie is written in Java using NetBeans Platform libraries that makes it platform independent. The software employs specialised differential equations solvers for stiff and non-stiff systems to produce model simulation traces. BioNessie provides a user-friendly interfact that comes up with an intuitive tree-based graphical layout, an edition function to SBML-compatible models and feature of data output

Radiocarbon dates from the Oxford AMS system: archaeometry datelist 35

This is the 35th list of AMS radiocarbon determinations measured at the Oxford Radiocarbon Accelerator Unit (ORAU). Amongst some of the sites included here are the latest series of determinations from the key sites of Abydos, El Mirón, Ban Chiang, Grotte de Pigeons (Taforalt), Alepotrypa and Oberkassel, as well as others dating to the Palaeolithic, Mesolithic and later periods. Comments on the significance of the results are provided by the submitters of the material

Information mobility in complex networks

The concept of information mobility in complex networks is introduced on the basis of a stochastic process taking place in the network. The transition matrix for this process represents the probability that the information arising at a given node is transferred to a target one. We use the fractional powers of this transition matrix to investigate the stochastic process at fractional time intervals. The mobility coefficient is then introduced on the basis of the trace of these fractional powers of the stochastic matrix. The fractional time at which a network diffuses 50% of the information contained in its nodes (1/ k50 ) is also introduced. We then show that the scale-free random networks display better spread of information than the non scale-free ones. We study 38 real-world networks and analyze their performance in spreading information from their nodes. We find that some real-world networks perform even better than the scale-free networks with the same average degree and we point out some of the structural parameters that make this possible

On the security of a new image encryption scheme based on chaotic map lattices

This paper reports a detailed cryptanalysis of a recently proposed encryption scheme based on the logistic map. Some problems are emphasized concerning the key space definition and the implementation of the cryptosystem using floating-point operations. It is also shown how it is possible to reduce considerably the key space through a ciphertext-only attack. Moreover, a timing attack allows the estimation of part of the key due to the existent relationship between this part of the key and the encryption/decryption time. As a result, the main features of the cryptosystem do not satisfy the demands of secure communications. Some hints are offered to improve the cryptosystem under study according to those requirements.Comment: 8 pages, 8 Figure