EMBL Australia Bioinformatics Resource (EMBL-ABR) is a developing national research infrastructure, providing bioinformatics resources and support to life science and biomedical researchers in Australia. EMBL-ABR comprises 10 geographically distributed national nodes with one coordinating hub, with current funding provided through Bioplatforms Australia and the University of Melbourne for its initial 2-year development phase. The EMBL-ABR mission is to: (1) increase Australia's capacity in bioinformatics and data sciences; (2) contribute to the development of training in bioinformatics skills; (3) showcase Australian data sets at an international level and (4) enable engagement in international programs. The activities of EMBL-ABR are focussed in six key areas, aligning with comparable international initiatives such as ELIXIR, CyVerse and NIH Commons. These key areas-Tools, Data, Standards, Platforms, Compute and Training-are described in this article.

SUMMARY: Whole-genome sequencing has revolutionized the study of genetics. Genotyping-by-sequencing is now a viable method of genotyping, yet the bioinformatics involved can be daunting if not prohibitive for some laboratories. Here we present ArrayMaker, a user-friendly tool that extracts accurate single nucleotide polymorphism genotypes at pre-defined loci from whole-genome alignments and presents them in a standard genotyping format compatible with association analysis software and datasets genotyped on commercial array platforms. Using this tool, geneticists with only basic computing ability can genotype samples at any desired list of markers, facilitating genome-wide association analysis, fine mapping, candidate variant assessment, data sharing and compatibility of data sourced from multiple technologies. AVAILABILITY AND IMPLEMENTATION: ArrayMaker is licensed under The MIT License and can be freely obtained at https://github.com/cw2014/ArrayMaker/. The program is implemented in Perl and runs on Linux operating systems. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online. CONTACT: [email protected].

Access to nutrients is a key factor governing development, reproduction and ultimately fitness. Within social groups, contest-competition can fundamentally affect nutrient access, potentially leading to reproductive asymmetry among individuals. Previously, agent-based models have been combined with the Geometric Framework of nutrition to provide insight into how nutrition and social interactions affect one another. Here, we expand this modelling approach by incorporating evolutionary algorithms to explore how contest-competition over nutrient acquisition might affect the evolution of animal nutritional strategies. Specifically, we model tolerance of nutrient excesses and deficits when ingesting nutritionally imbalanced foods, which we term 'nutritional latitude'; a higher degree of nutritional latitude constitutes a higher tolerance of nutritional excess and deficit. Our results indicate that a transition between two alternative strategies occurs at moderate to high levels of competition. When competition is low, individuals display a low level of nutritional latitude and regularly switch foods in search of an optimum. When food is scarce and contest-competition is intense, high nutritional latitude appears optimal, and individuals continue to consume an imbalanced food for longer periods before attempting to switch to an alternative. However, the relative balance of nutrients within available foods also strongly influences at what levels of competition, if any, transitions between these two strategies occur. Our models imply that competition combined with reproductive skew in social groups can play a role in the evolution of diet breadth. We discuss how the integration of agent-based, nutritional and evolutionary modelling may be applied in future studies to further understand the evolution of nutritional strategies across social and ecological contexts.

BACKGROUND: Cophylogeny mapping is used to uncover deep coevolutionary associations between two or more phylogenetic histories at a macro coevolutionary scale. As cophylogeny mapping is NP-Hard, this technique relies heavily on heuristics to solve all but the most trivial cases. One notable approach utilises a metaheuristic to search only a subset of the exponential number of fixed node orderings possible for the phylogenetic histories in question. This is of particular interest as it is the only known heuristic that guarantees biologically feasible solutions. This has enabled research to focus on larger coevolutionary systems, such as coevolutionary associations between figs and their pollinator wasps, including over 200 taxa. Although able to converge on solutions for problem instances of this size, a reduction from the current cubic running time is required to handle larger systems, such as Wolbachia and their insect hosts. RESULTS: Rather than solving this underlying problem optimally this work presents a greedy algorithm called TreeCollapse, which uses common topological patterns to recover an approximation of the coevolutionary history where the internal node ordering is fixed. This approach offers a significant speed-up compared to previous methods, running in linear time. This algorithm has been applied to over 100 well-known coevolutionary systems converging on Pareto optimal solutions in over 68% of test cases, even where in some cases the Pareto optimal solution has not previously been recoverable. Further, while TreeCollapse applies a local search technique, it can guarantee solutions are biologically feasible, making this the fastest method that can provide such a guarantee. CONCLUSION: As a result, we argue that the newly proposed algorithm is a valuable addition to the field of coevolutionary research. Not only does it offer a significantly faster method to estimate the cost of cophylogeny mappings but by using this approach, in conjunction with existing heuristics, it can assist in recovering a larger subset of the Pareto front than has previously been possible.

BACKGROUND: The learning active subnetworks problem involves finding subnetworks of a bio-molecular network that are active in a particular condition. Many approaches integrate observation data (e.g., gene expression) with the network topology to find candidate subnetworks. Increasingly, pathway databases contain additional annotation information that can be mined to improve prediction accuracy, e.g., interaction mechanism (e.g., transcription, microRNA, cleavage) annotations. We introduce a mechanism-based approach to active subnetwork recovery which exploits such annotations. We suggest that neighboring interactions in a network tend to be co-activated in a way that depends on the "correlation" of their mechanism annotations. e.g., neighboring phosphorylation and de-phosphorylation interactions may be more likely to be co-activated than neighboring phosphorylation and covalent bonding interactions. RESULTS: Our method iteratively learns the mechanism correlations and finds the most likely active subnetwork. We use a probabilistic graphical model with a Markov Random Field component which creates dependencies between the states (active or non-active) of neighboring interactions, that incorporates a mechanism-based component to the function. We apply a heuristic-based EM-based algorithm suitable for the problem. We validated our method's performance using simulated data in networks downloaded from GeneGO against the same approach without the mechanism-based component, and two other existing methods. We validated our methods performance in correctly recovering (1) the true interaction states, and (2) global network properties of the original network against these other methods. We applied our method to networks generated from time-course gene expression studies in angiogenesis and lung organogenesis and validated the findings from a biological perspective against current literature. CONCLUSIONS: The advantage of our mechanism-based approach is best seen in networks composed of connected regions with a large number of interactions annotated with a subset of mechanisms, e.g., a regulatory region of transcription interactions, or a cleavage cascade region. When applied to real datasets, our method recovered novel and biologically meaningful putative interactions, e.g., interactions from an integrin signaling pathway using the angiogenesis dataset, and a group of regulatory microRNA interactions in an organogenesis network.

MOTIVATION: Current microarray analyses focus on identifying sets of genes that are differentially expressed (DE) or differentially coexpressed (DC) in different biological states (e.g. diseased versus non-diseased). We observed that in many human diseases, some genes have a significant increase or decrease in expression variability (variance). As these observed changes in expression variability may be caused by alteration of the underlying expression dynamics, such differential variability (DV) patterns are also biologically interesting. RESULTS: Here we propose a novel analysis for changes in gene expression variability between groups of samples, which we call differential variability analysis. We introduce the concept of differential variability (DV), and present a simple procedure for identifying DV genes from microarray data. Our procedure is evaluated with simulated and real microarray datasets. The effect of data preprocessing methods on identification of DV gene is investigated. The biological significance of DV analysis is demonstrated with four human disease datasets. The relationships among DV, DE and DC genes are investigated. The results suggest that changes in expression variability are associated with changes in coexpression pattern, which imply that DV is not merely stochastic noise, but informative signal. AVAILABILITY: The R source code for differential variability analysis is available from the contact authors upon request.

This paper presents the development and application of a novel algorithm for the detection and classification of the adaptive and neutral evolutionary patterns associated with HIV drug resistance. Here, the Bayesian theorem will be used to predict the prevalence of an evolutionary pattern over a population to determine the class of its behaviour, whether it arose predominantly from neutral evolution, positive selection or negative selection. As an illustration, we will explain the algorithmic procedure in an application to real data, focusing on two- and three-mutation patterns that confer resistance to a drug agent.

MOTIVATION: Spectrum is a new Macintosh and Microsoft Windows program designed to read in phylogenetic four-state or binary data in NEXUS format, and output the corresponding bipartition spectra. It can be used to find the tree whose expected spectrum is closest to the observed spectrum (the closest tree, Hendy, Discr, Math., 96, 51-58,. 1991).