Fine oral filaments in Paramecium: a biochemical and immunological analysis

In Paramecium, several kinds of the oral networks of fine filaments are defined at the ultrastructural level. Using the sodium chloride-treated oral apparatus of Paramecium as an antigen to produce monoclonal antibodies, we have begun to identify the proteins constituting these networks. Immunoblotting showed that all positive antibodies were directed against three bands (70-, 75-and 83-kD), which corresponded to quantitatively minor components of the antigen; there was no antibody specific for the quantitatively major components (58- and 62-kD). Immunolocalization with four of these antibodies directed against one or several of these three bands showed that these proteins are components of the fine filaments supporting the oral area; a decoration of the basal bodies and the outer lattice was also observed on the cortex. Immunofluorescence on interphase cells suggested that the three proteins colocalized on the left side of the oral apparatus, whereas only the 70-kD band was detected on the right side. During division, the antigens of the antibodies were detected at different stages after oral basal body assembly. The antibodies cross-reacted with the tetrins, which are oral filament-forming proteins in Tetrahymena, demonstrating that tetrin-related proteins are quantitatively minor components of the oral and the somatic cytoskeleton of Paramecium.     

A comparison of methods for predicting vegetation type

Predictive modeling of vegetation patterns has wide application in vegetation science. In this paper I discuss three methods of predictive modeling using data from the alpine treeline ecotone as a case study. The study area is a portion of Glacier National Park, Montana. Parametric general linear models (GLM), artificial neural networks (ANN) and classification tree (CT) methods of predicting vegetation type are compared to determine the relative strength of each predictive approach and how they may be used in concert to increase understanding of important vegetation – environment relations. For each predictive method, vegetation type within the alpine treeline ecotone is predicted using a suite of environmental indicator variables including elevation, moisture potential, solar radiation potential, snow potential index, and disturbance history. Results from each of the predictive methods are compared against the real vegetation types to determine the relative accuracy of the methods.When the entire data field is examined (i.e., not evaluated by smaller spatial aggregates of data) the ANN procedure produces the most accurate predictions (=0.571); the CT predictions are the least accurate (=0.351). The predicted patterns of vegetation on the landscape are considerably different using the three methods. The GLM and CT methods produce large contiguous swaths of vegetation types throughout the study area, whereas the ANN method produces patterns with much more heterogeneity and smaller patches.When predictions are compared to reality at catchment scale, it becomes evident that the accuracy of each method varies depending upon the specific situation. The ANN procedure remains the most accurate method in the majority of the catchments, but both the GLM and PCT produce the most accurate classifications in at least one basin each.The variability in predictive ability of the three methods tested here indicates that there may not be a single best predictive method. Rather it may be important to use a suite of predictive models to help understand the environment – vegetation relationships. The ability to use multiple predictive methods to determine which spatial subunits of a landscape are outliers is important when identifying locations useful for climate change monitoring studies.     

Automated identification of Fos expression

The concentration of Fos, a protein encoded by the immediate-early gene c-fos, provides a measure of synaptic activity that may not parallel the electrical activity of neurons. Such a measure is important for the difficult problem of identifying dynamic properties of neuronal circuitries activated by a variety of stimuli and behaviours. We employ two-stage statistical pattern recognition to identify cellular nuclei that express Fos in two-dimensional sections of rat forebrain after administration of antipsychotic drugs. In stage one, we distinguish dark-stained candidate nuclei from image background by a thresholding algorithm and record size and shape measurements of these objects. In stage two, we compare performance of linear and quadratic discriminants, nearest-neighbour and artificial neural network classifiers that employ functions of these measurements to label candidate objects as either Fos nuclei, two touching Fos nuclei or irrelevant background material. New images of neighbouring brain tissue serve as test sets to assess generalizability of the best derived classification rule, as determined by lowest cross-validation misclassification rate. Three experts, two internal and one external, compare manual and automated results for accuracy assessment. Analyses of a subset of images on two separate occasions provide quantitative measures of inter- and intra-expert consistency. We conclude that our automated procedure yields results that compare favourably with those of the experts and thus has potential to remove much of the tedium, subjectivity and irreproducibility of current Fos identification methods in digital microscopy.     

WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks

In this paper, we propose an on-demand distributed clustering algorithm for multi-hop packet radio networks. These types of networks, also known as ad hoc networks, are dynamic in nature due to the mobility of nodes. The association and dissociation of nodes to and from clusters perturb the stability of the network topology, and hence a reconfiguration of the system is often unavoidable. However, it is vital to keep the topology stable as long as possible. The clusterheads, form a dominant set in the network, determine the topology and its stability. The proposed weight-based distributed clustering algorithm takes into consideration the ideal degree, transmission power, mobility, and battery power of mobile nodes. The time required to identify the clusterheads depends on the diameter of the underlying graph. We try to keep the number of nodes in a cluster around a pre-defined threshold to facilitate the optimal operation of the medium access control (MAC) protocol. The non-periodic procedure for clusterhead election is invoked on-demand, and is aimed to reduce the computation and communication costs. The clusterheads, operating in dual power mode, connects the clusters which help in routing messages from a node to any other node. We observe a trade-off between the uniformity of the load handled by the clusterheads and the connectivity of the network. Simulation experiments are conducted to evaluate the performance of our algorithm in terms of the number of clusterheads, reaffiliation frequency, and dominant set updates. Results show that our algorithm performs better than existing ones and is also tunable to different kinds of network conditions.     

Network genomics – A novel approach for the analysis of biological systems in the post-genomic era

Network Genomics studies genomics and proteomics foundations of cellular networks in biological systems. It complements systems biology in providing information on elements, their interaction and their functional interplay in cellular networks. The relationship between genomic and proteomic high-throughput technologies and computational methods are described, as well as several examples of specific network genomic application are presented.     

Equivalence of branched and unbranched Michaelian pathways concerning periodic signal transmission

Sinusoidal oscillation transmission through branched metabolic pathways is studied. Two systems are analyzed, which are composed of two convergent reaction branches and differ in the length of one of them. Linear kinetics is assumed first. Michaelis-Menten enzymes are then considered by using previous results that suggest their behavior with respect to propagation of oscillations is close to linearity around the mean input flux. As a result, there exist ways to modulate the activity of the enzymes so that propagation is equivalent for branched and specific unbranched pathways. Cells may have taken advantage of such a possibility in cases where oscillations have a biological role.     

MIAX: a new paradigm for modeling biomacromolecular interactions and complex formation in condensed phases

A new paradigm is proposed for modeling biomacromolecular interactions and complex formation in solution (protein-protein interactions so far in this report) that constitutes the scaffold of the automatic system MIAX (acronym for Macromolecular Interaction Assessment X). It combines in a rational way a series of computational methodologies, the goal being the prediction of the most native-like protein complex that may be formed when two isolated (unbound) protein monomers interact in a liquid environment. The overall strategy consists of first inferring putative precomplex structures by identification of binding sites or epitopes on the proteins surfaces and a simultaneous rigid-body docking process using geometric instances alone. Precomplex configurations are defined here as all those decoys the interfaces of which comply substantially with the inferred binding sites and whose free energy values are lower. Retaining all those precomplex configurations with low energies leads to a reasonable number of decoys for which a flexible treatment is amenable. A novel algorithm is introduced here for automatically inferring binding sites in proteins given their 3-D structure. The procedure combines an unsupervised learning algorithm based on the self-organizing map or Kohonen network with a 2-D Fourier spectral analysis. To model interaction, the potential function proposed here plays a central role in the system and is constituted by empirical terms expressing well-characterized factors influencing biomacromolecular interaction processes, essentially electrostatic, van der Waals, and hydrophobic. Each of these procedures is validated by comparing results with observed instances. Finally, the more demanding process of flexible docking is performed in MIAX embedding the potential function in a simulated annealing optimization procedure. Whereas search of the entire configuration hyperspace is a major factor precluding hitherto systems from efficiently modeling macromolecular interaction modes and complex structures, the paradigm presented here may constitute a step forward in the field because it is shown that a rational treatment of the information available from the 3-D structure of the interacting monomers combined with conveniently selected computational techniques can assist to elude search of regions of low probability in configuration space and indeed lead to a highly efficient system oriented to solve this intriguing and fundamental biologic problem.     

In silico two-hybrid system for the selection of physically interacting protein pairs

Deciphering the interaction links between proteins has become one of the main tasks of experimental and bioinformatic methodologies. Reconstruction of complex networks of interactions in simple cellular systems by integrating predicted interaction networks with available experimental data is becoming one of the most demanding needs in the postgenomic era. On the basis of the study of correlated mutations in multiple sequence alignments, we propose a new method (in silico two-hybrid, i2h) that directly addresses the detection of physically interacting protein pairs and identifies the most likely sequence regions involved in the interactions. We have applied the system to several test sets, showing that it can discriminate between true and false interactions in a significant number of cases. We have also analyzed a large collection of E. coli protein pairs as a first step toward the virtual reconstruction of its complete interaction network.     

Modelling autocatalytic networks with artificial microbiology

Cells can usefully be equated to autocatalytic networks that increase in mass and then divide. To begin to model relationships between autocatalytic networks and cell division, we have written a program of artificial chemistry that simulates a cell fed by monomers. These monomers are symbols that can be assembled into linear (non-branched) polymers to give different lengths. A reaction is catalysed by a particular polymer or 'enzyme' that may itself be a reactant of that reaction (autocatalysis). These reactions are only studied within the confines of the 'cell' or 'reaction chamber'. There is a flux of material through the cell and eventually the mass of polymers reaches a threshold at which we analyse the cell. Our results indicate a similarity between the connectivity of the reaction network and that of real metabolic networks. Developing the model will entail attributing increased probabilities of reactions to polymers that are colocalised to evaluate the consequences of the dynamics of large assemblies of diverse molecules (hyperstructures) and of cell division.     

Current approaches to whole genome phylogenetic analysis

It has long been known that evolutionary trees (phylogenies) can be estimated by comparing the DNA or protein sequences of homologous genes across different organisms. More recently, attempts have been made to estimate phylogenies by comparing entire genomes. These attempts have focused largely on comparisons of gene content and gene order. Many different methods have been proposed for making these comparisons. These include primarily maximum parsimony and distance methods, although more recently maximum likelihood and Bayesian methods are being developed. This paper discusses each of these approaches in turn, including their merits and limitations, and any software which is available to make use of them.