Estimating genomic coexpression networks using first-order conditional independence

We describe a computationally efficient statistical framework for estimating networks of coexpressed genes. This framework exploits first-order conditional independence relationships among gene-expression measurements to estimate patterns of association. We use this approach to estimate a coexpression network from microarray gene-expression measurements from Saccharomyces cerevisiae. We demonstrate the biological utility of this approach by showing that a large number of metabolic pathways are coherently represented in the estimated network. We describe a complementary unsupervised graph search algorithm for discovering locally distinct subgraphs of a large weighted graph. We apply this algorithm to our coexpression network model and show that subgraphs found using this approach correspond to particular biological processes or contain representatives of distinct gene families.     

Variance estimation in clinical studies with interim sample size re-estimation

We consider clinical studies with a sample size re-estimation based on the unblinded variance estimation at some interim point of the study. Because the sample size is determined in such a flexible way, the usual variance estimator at the end of the trial is biased. We derive sharp bounds for this bias. These bounds have a quite simple form and can help for the decision if this bias is negligible for the actual study or if a correction should be done. An exact formula for the bias is also provided. We discuss possibilities to get rid of this bias or at least to reduce the bias substantially. For this purpose, we propose a certain additive correction of the bias. We see in an example that the significance level of the test can be controlled when this additive correction is used.     

A uniform framework for ordered restriction map problems.

Optical Mapping is an emerging technology for constructing ordered restriction maps of DNA molecules. The underlying computational problems for this technology have been studied and several models have been proposed in recent literature. Most of these propose combinatorial models; some of them also present statistical approaches. However, it is not a priori clear as to how these models relate to one another and to the underlying problem. We present a uniform framework for the restriction map problems where each of these various models is a specific instance of the basic framework. We achieve this by identifying two "signature" functions f() and g() that characterize the models. We identify the constraints these two functions must satisfy, thus opening up the possibility of exploring other plausible models. We show that for all of the combinatorial models proposed in literature, the signature functions are semi-algebraic. We also analyze a proposed statistical method in this framework and show that the signature functions are transcendental for this model. We also believe that this framework would provide useful guidelines for dealing with other inferencing problems arising in practice. Finally, we indicate the open problems by including a survey of the best known results for these problems.     

A 2-approximation for the minimum duplication speciation problem

We consider the following problem: given a set of gene family trees, spanning a given set of species, find a first speciation which splits these species into two subsets and minimizes the number of gene duplications that happened before this speciation. We call this problem the Minimum Duplication Bipartition Problem. Using a generalization of the Minimum Edge-Cut Problem, we propose a polynomial time 2-approximation algorithm for the Minimum Duplication Bipartition Problem. We apply this algorithm to the inference of species trees on synthetic datasets and on two datasets of eukaryotic species.     

Mitochondrial DNA effects on fitness in Drosophila subobscura

We tested different fitness components on a series of conspecific mtDNA haplotypes, detected by RFLPs in Drosophila subobscura. Additionally, haplotype VIII, endemic to the Canary Islands, was tested upon its own native nuclear DNA background and upon that of the rest of mtDNAs tested herein. We found that both nuclear and mitochondrial DNA can have a significant effect upon their hosts' fitness, and that negative selection is one of the mechanisms that can intervene in this species' mtDNA haplotype pattern. We discuss the importance of this mechanism in relation to genetic drift, in the form of periodic population bottlenecks, and how the latter can enhance the former. We also detected a significant positive effect of haplotype VIII upon fitness that could explain in part the dominance of this endemic haplotype on some of the Canary Islands, and a mitochondrial heterosis involving this haplotype when on a foreign nuclear DNA background.     

Genetic assembly rules and community phenotypes

We present a conceptual construct for a genetic based community assembly rule where the genetic composition of a host plant, or resource, affects the structure of the dependent community. This is related to a genetic similarity rule that states that host plants with similar genetic compositions are hosts to similar arthropod communities. We present preliminary data from the Populus system to support this concept. We review the recent literature to evaluate the current state of the assembly rule concept and interpret a set of previous studies in the context of a genetic assembly rule. We suggest that by incorporating this concept into community ecology we can begin to bring an evolutionary perspective to this discipline.     

Violation of the fluctuation-dissipation theorem in a protein system

We report the results of molecular dynamics simulations of the protein myosin carried out with an elastic network model. Quenching the system, we observe glassy behavior of a density correlation function and a density response function that are often investigated in structure glasses and spin glasses. In the equilibrium, the fluctuation-response relation, a representative relation of the fluctuation-dissipation theorem, holds that the ratio of the density correlation function to the density response function is equal to the temperature of the environment. We show that, in the quenched system that we study, this relation can be violated. In the case that this relation does not hold, this ratio can be regarded as an effective temperature. We find that this effective temperature of myosin is higher than the temperature of the environment. We discuss the relation between this effective temperature and energy transduction that occurs after ATP hydrolysis in the myosin molecule.     

The plant tree of life: an overview and some points of view

We provide a brief overview of this special issue on the plant tree of life, describing its history and the general nature of its articles. We then present our estimate for the overall topology and, for land plants, divergence times of the plant tree of life. We discuss several major controversies and unsolved problems in resolving portions of this tree. We conclude with a few thoughts about the prospects for obtaining a comprehensive, robustly resolved, and accurately dated plant tree of life and the importance of such a grand endeavor.     

Bilobed flap in the release of postburn mentosternal contracture

We have described in brief detail our experience with bilobed flaps in the release of postburn mentosternal synaechia. We have found this method handy, and it gives very good results. We reckon that this method has a prominent place in the release of this contracture, particularly in children who cannot provide adequate free-skin flaps for revascularization and in centers where the procedure is technically impossible.     

Protein evolution within a structural space

Understanding of the evolutionary origins of protein structures represents a key component of the understanding of molecular evolution as a whole. Here we seek to elucidate how the features of an underlying protein structural “space” might impact protein structural evolution. We approach this question using lattice polymers as a completely characterized model of this space. We develop a measure of structural comparison of lattice structures that is analogous to the one used to understand structural similarities between real proteins. We use this measure of structural relatedness to create a graph of lattice structures and compare this graph (in which nodes are lattice structures and edges are defined using structural similarity) to the graph obtained for real protein structures. We find that the graph obtained from all compact lattice structures exhibits a distribution of structural neighbors per node consistent with a random graph. We also find that subgraphs of 3500 nodes chosen either at random or according to physical constraints also represent random graphs. We develop a divergent evolution model based on the lattice space which produces graphs that, within certain parameter regimes, recapitulate the scale-free behavior observed in similar graphs of real protein structures.     

Effective detection of remote homologues by searching in sequence dataset of a protein domain fold

Profile matching methods are commonly used in searches in protein sequence databases to detect evolutionary relationships. We describe here a sensitive protocol, which detects remote similarities by searching in a specialized database of sequences belonging to a fold. We have assessed this protocol by exploring the relationships we detect among sequences known to belong to specific folds. We find that searches within sequences adopting a fold are more effective in detecting remote similarities and evolutionary connections than searches in a database of all sequences. We also discuss the implications of using this strategy to link sequence and structure space.     

Modernity and ethnic affiliation in Israeli schools: A dependence approach*

In this article, we argue that there is an important, but as yet unidentified, process involved in the maintenance and reconstruction of ethnic identity. We call this process ‘ethnic reorganization’. We argue that this process is useful for understanding the ethnic survival of indigenous peoples in colonized societies, as well as for illuminating the processes of ethnic renascence among both indigenous and immigrant groups. We find it especially useful in accounting for both the persistence and the transformation of American Indian ethnicity in the United States. Ethnic reorganization occurs when an ethnic minority undergoes a reorganization of its social structure, redefinition of ethnic group boundaries, or some other change in response to pressures or demands imposed by the dominant culture. From this viewpoint, ethnic reorganization is a mechanism that facilitates ethnic group survival, albeit in a modified form. We specify several types of ethnic reorganization. These include: social reorganization, economic reorganization, political reorganization, and cultural reorganization. We argue that ethnic reorganization represents a central mechanism of ethnic change. We present evidence of these forms of ethnic reorganization among many different American Indian societies faced with demographic and cultural extinction.     

A spatially extended model for macroscopic spike-wave discharges

Spike-wave discharges are a distinctive feature of epileptic seizures. So far, they have not been reported in spatially extended neural field models. We study a space-independent version of the Amari neural field model with two competing inhibitory populations. We show that this competition leads to robust spike-wave dynamics if the inhibitory populations operate on different time-scales. The spike-wave oscillations present a fold/homoclinic type bursting. From this result we predict parameters of the extended Amari system where spike-wave oscillations produce a spatially homogeneous pattern. We propose this mechanism as a prototype of macroscopic epileptic spike-wave discharges. To our knowledge this is the first example of robust spike-wave patterns in a spatially extended neural field model.     

Evolution of evolvability in a developmental model

Evolvability, the ability of populations to adapt, can evolve through changes in the mechanisms determining genetic variation and in the processes of development. Here we construct and evolve a simple developmental model in which the pleiotropic effects of genes can evolve. We demonstrate that selection in a changing environment favors a specific pattern of variability, and that this favored pattern maximizes evolvability. Our analysis shows that mutant genotypes with higher evolvability are more likely to increase to fixation. We also show that populations of highly evolvable genotypes are much less likely to be invaded by mutants with lower evolvability, and that this dynamic primarily shapes evolvability. We examine several theoretical objections to the evolution of evolvability in light of this result. We also show that this result is robust to the presence or absence of recombination, and explore how nonrandom environmental change can select for a modular pattern of variability.     

NOA36 Protein Contains a Highly Conserved Nucleolar Localization Signal Capable of Directing Functional Proteins to the Nucleolus,in Mammalian Cells

NOA36/ZNF330 is an evolutionarily well-preserved protein present in the nucleolus and mitochondria of mammalian cells. We have previously reported that the pro-apoptotic activity of this protein is mediated by a characteristic cysteine-rich domain. We now demonstrate that the nucleolar localization of NOA36 is due to a highly-conserved nucleolar localization signal (NoLS) present in residues 1–33. This NoLS is a sequence containing three clusters of two or three basic amino acids. We fused the amino terminal of NOA36 to eGFP in order to characterize this putative NoLS. We show that a cluster of three lysine residues at positions 3 to 5 within this sequence is critical for the nucleolar localization. We also demonstrate that the sequence as found in human is capable of directing eGFP to the nucleolus in several mammal, fish and insect cells. Moreover, this NoLS is capable of specifically directing the cytosolic yeast enzyme polyphosphatase to the target of the nucleolus of HeLa cells, wherein its enzymatic activity was detected. This NoLS could therefore serve as a very useful tool as a nucleolar marker and for directing particular proteins to the nucleolus in distant animal species.     

Phylogenetic trait conservation in the partner choice of a group of ectomycorrhizal trees

Ecological interactions are frequently conserved across evolutionary time. In the case of mutualisms, these conserved interactions may play a large role in structuring mutualist communities. We hypothesized that phylogenetic trait conservation could play a key role in determining patterns of association in the ectomycorrhizal symbiosis, a globally important trophic mutualism. We used the association between members of the pantropical plant tribe Pisonieae and its fungal mutualist partners as a model system to test the prediction that Pisonieae‐associating ectomycorrhizal fungi will be more closely related than expected by chance, reflecting a conserved trait. We tested this prediction using previously published and newly generated sequences in a Bayesian framework incorporating phylogenetic uncertainty. We report that phylogenetic trait conservation does exist in this association. We generated a five‐marker phylogeny of members of the Pisonieae and used this phylogeny in a Bayesian relaxed molecular clock analysis. We established that the most recent common ancestors of Pisonieae species and Pisonieae‐associating fungi sharing phylogenetic conservation of their patterns of ectomycorrhizal association occurred no more recently than 14.2 Ma. We therefore suggest that phylogenetic trait conservation in the Pisonieae ectomycorrhizal mutualism association represents an inherited syndrome which has existed for at least 14 Myr.     

New Automated Single-Cell Technique for Segmentation and Quantitation of Lipid Droplets

Lipid droplets are the major organelle for intracellular storage of triglycerides and cholesterol esters. Various methods have been attempted for automated quantitation of fluorescently stained lipid droplets using either thresholding or watershed methods. We find that thresholding methods deal poorly with clusters of lipid droplets, whereas watershed methods require a smoothing step that must be optimized to remove image noise. We describe here a novel three-stage hybrid method for automated segmentation and quantitation of lipid droplets. In this method, objects are initially identified by thresholding. They are then tested for circularity to distinguish single lipid droplets from clusters. Clusters are subjected to a secondary watershed segmentation. We provide a characterization of this method in simulated images. Additionally, we apply this method to images of fixed cells containing stained lipid droplets and GFP-tagged proteins to provide a proof-of-principle that this method can be used for colocalization studies. The circularity measure can additionally prove useful for the identification of inappropriate segmentation in an automated way; for example, of non-cellular material. We will make the programs and source code available to the community under the Gnu Public License. We believe this technique will be of interest to cell biologists for light microscopic studies of lipid droplet biology.     

An evolutionary strategy for all-atom folding of the 60-amino-acid bacterial ribosomal protein l20

We have investigated an evolutionary algorithm for de novo all-atom folding of the bacterial ribosomal protein L20. We report results of two simulations that converge to near-native conformations of this 60-amino-acid, four-helix protein. We observe a steady increase of "native content" in both simulated ensembles and a large number of near-native conformations in their final populations. We argue that these structures represent a significant fraction of the low-energy metastable conformations, which characterize the folding funnel of this protein. These data validate our all-atom free-energy force field PFF01 for tertiary structure prediction of a previously inaccessible structural family of proteins. We also compare folding simulations of the evolutionary algorithm with the basin-hopping technique for the Trp-cage protein. We find that the evolutionary algorithm generates a dynamic memory in the simulated population, which leads to faster overall convergence.     

Modes and cuts in metabolic networks: complexity and algorithms

Constraint-based approaches recently brought new insight into our understanding of metabolism. By making very simple assumptions such as that the system is at steady-state and some reactions are irreversible, and without requiring kinetic parameters, general properties of the system can be derived. A central concept in this methodology is the notion of an elementary mode (EM for short) which represents a minimal functional subsystem. The computation of EMs still forms a limiting step in metabolic studies and several algorithms have been proposed to address this problem leading to increasingly faster methods. However, although a theoretical upper bound on the number of elementary modes that a network may possess has been established, surprisingly, the complexity of this problem has never been systematically studied. In this paper, we give a systematic overview of the complexity of optimisation problems related to modes. We first establish results regarding network consistency. Most consistency problems are easy, i.e., they can be solved in polynomial time. We then establish the complexity of finding and counting elementary modes. We show in particular that finding one elementary mode is easy but that this task becomes hard when a specific EM (i.e. an EM containing some specified reactions) is sought. We then show that counting the number of elementary modes is musical sharpP-complete. We emphasize that the easy problems can be solved using currently existing software packages. We then analyse the complexity of a closely related task which is the computation of so-called minimum reaction cut sets and we show that this problem is hard. We then present two positive results which both allow to avoid computing EMs as a prior to the computation of reaction cuts. The first one is a polynomial approximation algorithm for finding a minimum reaction cut set. The second one is a test for verifying whether a set of reactions constitutes a reaction cut; this test can be readily included in existing algorithms to improve their performance. Finally, we discuss the complexity of other cut-related problems.