Conditioning and time representation in long short-term memory networks

Dopaminergic models based on the temporal-difference learning algorithm usually do not differentiate trace from delay conditioning. Instead, they use a fixed temporal representation of elapsed time since conditioned stimulus onset. Recently, a new model was proposed in which timing is learned within a long short-term memory (LSTM) artificial neural network representing the cerebral cortex (Rivest et al. in J Comput Neurosci 28(1):107–130, 2010). In this paper, that model’s ability to reproduce and explain relevant data, as well as its ability to make interesting new predictions, are evaluated. The model reveals a strikingly different temporal representation between trace and delay conditioning since trace conditioning requires working memory to remember the past conditioned stimulus while delay conditioning does not. On the other hand, the model predicts no important difference in DA responses between those two conditions when trained on one conditioning paradigm and tested on the other. The model predicts that in trace conditioning, animal timing starts with the conditioned stimulus offset as opposed to its onset. In classical conditioning, it predicts that if the conditioned stimulus does not disappear after the reward, the animal may expect a second reward. Finally, the last simulation reveals that the buildup of activity of some units in the networks can adapt to new delays by adjusting their rate of integration. Most importantly, the paper shows that it is possible, with the proposed architecture, to acquire discharge patterns similar to those observed in dopaminergic neurons and in the cerebral cortex on those tasks simply by minimizing a predictive cost function.     

Perioperative do-not-resuscitate orders: it is time to talk

A study by Burkle et al. in BMC Anesthesiology examined attitudes around perioperative do-not-resuscitate orders. Questionnaires were given to patients, as well as to anesthesiologists, internists and surgeons. The study has limitations and is open to interpretation. However, the findings are important. There appear to be attitudinal differences between patients and doctors, and between specialties. A small majority of patients are content to have a do-not-resuscitate order postponed during the perioperative period. A large majority expects open communication from doctors before proceeding. However, this article could also encourage a broader debate. This is about how to respect patient autonomy, while ensuring that resuscitation truly serves the patient’s best interests. This commentary outlines how more communication is needed at the bedside and in wider society.     

BIMLR: A method for constructing rooted phylogenetic networks from rooted phylogenetic trees

Rooted phylogenetic trees constructed from different datasets (e.g. from different genes) are often conflicting with one another, i.e. they cannot be integrated into a single phylogenetic tree. Phylogenetic networks have become an important tool in molecular evolution, and rooted phylogenetic networks are able to represent conflicting rooted phylogenetic trees. Hence, the development of appropriate methods to compute rooted phylogenetic networks from rooted phylogenetic trees has attracted considerable research interest of late. The C_ASS algorithm proposed by van Iersel et al. is able to construct much simpler networks than other available methods, but it is extremely slow, and the networks it constructs are dependent on the order of the input data. Here, we introduce an improved C_ASS algorithm, BIMLR. We show that BIMLR is faster than C_ASS and less dependent on the input data order. Moreover, BIMLR is able to construct much simpler networks than almost all other methods. BIMLR is available at http://nclab.hit.edu.cn/wangjuan/BIMLR/.     

Proposal for a standard representation of two-dimensional gel electrophoresis data

The global analysis of proteins is now feasible due to improvements in techniques such as two-dimensional gel electrophoresis (2-DE), mass spectrometry, yeast two-hybrid systems and the development of bioinformatics applications. The experiments form the basis of proteomics, and present significant challenges in data analysis, storage and querying. We argue that a standard format for proteome data is required to enable the storage, exchange and subsequent re-analysis of large datasets. We describe the criteria that must be met for the development of a standard for proteomics. We have developed a model to represent data from 2-DE experiments, including difference gel electrophoresis along with image analysis and statistical analysis across multiple gels. This part of proteomics analysis is not represented in current proposals for proteomics standards. We are working with the Proteomics Standards Initiative to develop a model encompassing biological sample origin, experimental protocols, a number of separation techniques and mass spectrometry. The standard format will facilitate the development of central repositories of data, enabling results to be verified or re-analysed, and the correlation of results produced by different research groups using a variety of laboratory techniques.     

Making a robust biomolecular time scale for phylogenetic studies

The further evolution of informational molecular sequences should depend on the number of viable alternatives possible for the sequences as set by selection, the unrepaired mutation rate, and time. Most biomolecular clocks are based on Kimura's nearly neutral mutation random-drift hypothesis. This clock assumes that informational sequences are in equilibrium, i.e., the nucleotides mutate at a uniform rate and the number of nucleotides unconstrained by selection remains constant. Correcting for deviations from these assumptions should produce a more accurate clock. Informational molecules probably formed from polynucleotides having some other function such as nitrogen or nucleotide storage, thus being initially functionally unselected. At any time the rate of development of functionality in a protein may be expected to be proportional to the number of viable alternatives of sequence in its potentially interacting regions. Assuming the rate of unrepaired mutations is constant, these clocks should exponentially slow as they evolve, each with a different rate toward individual equilibria. Also if the degree of selection changes, its clock rate should change. For a more precise clock two approaches are suggested to estimate these time dependent changes in evolutionary rate. An improved clock could improve estimation of phylogeny and put a time scale on that phylogeny.     

Place representation within hippocampal networks is modified by long-term potentiation

In the brain, information is encoded by the firing patterns of neuronal ensembles and the strength of synaptic connections between individual neurons. We report here that representation of the environment by "place" cells is altered by changing synaptic weights within hippocampal networks. Long-term potentiation (LTP) of intrinsic hippocampal pathways abolished existing place fields, created new place fields, and rearranged the temporal relationship within the affected population. The effect of LTP on neuron discharge was rate and context dependent. The LTP-induced "remapping" occurred without affecting the global firing rate of the network. The findings support the view that learned place representation can be accomplished by LTP-like synaptic plasticity within intrahippocampal networks.     

Neighbor-net: an agglomerative method for the construction of phylogenetic networks

We present Neighbor-Net, a distance based method for constructing phylogenetic networks that is based on the Neighbor-Joining (NJ) algorithm of Saitou and Nei. Neighbor-Net provides a snapshot of the data that can guide more detailed analysis. Unlike split decomposition, Neighbor-Net scales well and can quickly produce detailed and informative networks for several hundred taxa. We illustrate the method by reanalyzing three published data sets: a collection of 110 highly recombinant Salmonella multi-locus sequence typing sequences, the 135 "African Eve" human mitochondrial sequences published by Vigilant et al., and a collection of 12 Archeal chaperonin sequences demonstrating strong evidence for gene conversion. Neighbor-Net is available as part of the SplitsTree4 software package.     

Regulating DnaA complex assembly: it is time to fill the gaps

New rounds of bacterial chromosome replication are triggered during each cell division cycle by the initiator protein, DnaA. For precise timing, interactions of DnaA-ATP monomers with the replication origin, oriC, must be carefully regulated during formation of complexes that unwind origin DNA and load replicative helicase. Recent studies in Escherichia coli suggest that high and low affinity DnaA recognition sites are positioned within oriC to direct staged assembly of bacterial pre-replication complexes, with DnaA contacting low affinity sites as it oligomerizes to 'fill the gaps' between high affinity sites. The wide variability of oriC DnaA recognition site patterns seen in nature may reflect myriad gap-filling strategies needed to couple oriC function to the lifestyle of different bacterial types.     

Maximum likelihood of phylogenetic networks

MOTIVATION: Horizontal gene transfer (HGT) is believed to be ubiquitous among bacteria, and plays a major role in their genome diversification as well as their ability to develop resistance to antibiotics. In light of its evolutionary significance and implications for human health, developing accurate and efficient methods for detecting and reconstructing HGT is imperative. RESULTS: In this article we provide a new HGT-oriented likelihood framework for many problems that involve phylogeny-based HGT detection and reconstruction. Beside the formulation of various likelihood criteria, we show that most of these problems are NP-hard, and offer heuristics for efficient and accurate reconstruction of HGT under these criteria. We implemented our heuristics and used them to analyze biological as well as synthetic data. In both cases, our criteria and heuristics exhibited very good performance with respect to identifying the correct number of HGT events as well as inferring their correct location on the species tree. AVAILABILITY: Implementation of the criteria as well as heuristics and hardness proofs are available from the authors upon request. Hardness proofs can also be downloaded at http://www.cs.tau.ac.il/~tamirtul/MLNET/Supp-ML.pdf     

Maximum likelihood of phylogenetic networks

Bioinformatics (2006) 22(21), 2604–2611 The authors would like to apologize for errors of graph misplacementin Figures 4–6, and an     

Improved layout of phylogenetic networks

Split networks are increasingly being used in phylogenetic analysis. Usually, a simple equal angle algorithm is used to draw such networks, producing layouts that leave much room for improvement. Addressing the problem of producing better layouts of split networks, this paper presents an algorithm for maximizing the area covered by the network, describes an extension of the equal-daylight algorithm to networks, looks into using a spring embedder and discusses how to construct rooted split networks.     

MC-Net: a method for the construction of phylogenetic networks based on the Monte-Carlo method

Background  

A phylogenetic network is a generalization of phylogenetic trees that allows the representation of conflicting signals or alternative evolutionary histories in a single diagram. There are several methods for constructing these networks. Some of these methods are based on distances among taxa. In practice, the methods which are based on distance perform faster in comparison with other methods. The Neighbor-Net (N-Net) is a distance-based method. The N-Net produces a circular ordering from a distance matrix, then constructs a collection of weighted splits using circular ordering. The SplitsTree which is a program using these weighted splits makes a phylogenetic network. In general, finding an optimal circular ordering is an NP-hard problem. The N-Net is a heuristic algorithm to find the optimal circular ordering which is based on neighbor-joining algorithm.