Bayesian modeling of recombination events in bacterial populations

Background: We consider the discovery of recombinant segments jointly with their origins within multilocus DNA sequences from bacteria representing heterogeneous populations of fairly closely related species. The currently available methods for recombination detection capable of probabilistic characterization of uncertainty have a limited applicability in practice as the number of strains in a data set increases. Results: We introduce a Bayesian spatial structural model representing the continuum of origins over sites within the observed sequences, including a probabilistic characterization of uncertainty related to the origin of any particular site. To enable a statistically accurate and practically feasible approach to the analysis of large-scale data sets representing a single genus, we have developed a novel software tool (BRAT, Bayesian Recombination Tracker) implementing the model and the corresponding learning algorithm, which is capable of identifying the posterior optimal structure and to estimate the marginal posterior probabilities of putative origins over the sites. Conclusion: A multitude of challenging simulation scenarios and an analysis of real data from seven housekeeping genes of 120 strains of genus Burkholderia are used to illustrate the possibilities offered by our approach. The software is freely available for download at URL http://web.abo.fi/fak/ mnf//mate/jc/software/brat.html

A hybrid approach to protein folding problem integrating constraint programming with local search

<p>Abstract</p> <p>Background</p> <p>The protein folding problem remains one of the most challenging open problems in computational biology. Simplified models in terms of lattice structure and energy function have been proposed to ease the computational hardness of this optimization problem. Heuristic search algorithms and constraint programming are two common techniques to approach this problem. The present study introduces a novel hybrid approach to simulate the protein folding problem using constraint programming technique integrated within local search.</p> <p>Results</p> <p>Using the face-centered-cubic lattice model and 20 amino acid pairwise interactions energy function for the protein folding problem, a constraint programming technique has been applied to generate the neighbourhood conformations that are to be used in generic local search procedure. Experiments have been conducted for a few small and medium sized proteins. Results have been compared with both pure constraint programming approach and local search using well-established local move set. Substantial improvements have been observed in terms of final energy values within acceptable runtime using the hybrid approach.</p> <p>Conclusion</p> <p>Constraint programming approaches usually provide optimal results but become slow as the problem size grows. Local search approaches are usually faster but do not guarantee optimal solutions and tend to stuck in local minima. The encouraging results obtained on the small proteins show that these two approaches can be combined efficiently to obtain better quality solutions within acceptable time. It also encourages future researchers on adopting hybrid techniques to solve other hard optimization problems.</p

Linking like with like: optimising connectivity between environmentally-similar habitats

Habitat fragmentation is one of the greatest threats to biodiversity. To minimise the effect of fragmentation on biodiversity, connectivity between otherwise isolated habitats should be promoted. However, the identification of linkages favouring connectivity is not trivial. Firstly, they compete with other land uses, so they need to be cost-efficient. Secondly, linkages for one species might be barriers for others, so they should effectively account for distinct mobility requirements. Thirdly, detailed information on the auto-ecology of most of the species is lacking, so linkages need being defined based on surrogates. In order to address these challenges we develop a framework that (a) identifies environmentally-similar habitats; (b) identifies environmental barriers (i.e., regions with a very distinct environment from the areas to be linked), and; (c) determines cost-efficient linkages between environmentally-similar habitats, free from environmental barriers. The assumption is that species with similar ecological requirements occupy the same environments, so environmental similarity provides a rationale for the identification of the areas that need to be linked. A variant of the classical minimum Steiner tree problem in graphs is used to address c). We present a heuristic for this problem that is capable of handling large datasets. To illustrate the framework we identify linkages between environmentally-similar protected areas in the Iberian Peninsula. The Natura 2000 network is used as a positive ‘attractor’ of links while the human footprint is used as ‘repellent’ of links.Wecompare the outcomes of our approach with cost-efficient networks linking protected areas that disregard the effect of environmental barriers. As expected, the latter achieved a smaller area covered with linkages, but with barriers that can significantly reduce the permeability of the landscape for the dispersal of some species

Uitnodigingen worden niet verstrekt

No abstract

Operations research : een virtuele wetenschap met toekomst

No abstract