376 research outputs found
An HMM-based Comparative Genomic Framework for Detecting Introgression in Eukaryotes
One outcome of interspecific hybridization and subsequent effects of
evolutionary forces is introgression, which is the integration of genetic
material from one species into the genome of an individual in another species.
The evolution of several groups of eukaryotic species has involved
hybridization, and cases of adaptation through introgression have been already
established. In this work, we report on a new comparative genomic framework for
detecting introgression in genomes, called PhyloNet-HMM, which combines
phylogenetic networks, that capture reticulate evolutionary relationships among
genomes, with hidden Markov models (HMMs), that capture dependencies within
genomes. A novel aspect of our work is that it also accounts for incomplete
lineage sorting and dependence across loci.
Application of our model to variation data from chromosome 7 in the mouse
(Mus musculus domesticus) genome detects a recently reported adaptive
introgression event involving the rodent poison resistance gene Vkorc1, in
addition to other newly detected introgression regions. Based on our analysis,
it is estimated that about 12% of all sites withinchromosome 7 are of
introgressive origin (these cover about 18 Mbp of chromosome 7, and over 300
genes). Further, our model detects no introgression in two negative control
data sets. Our work provides a powerful framework for systematic analysis of
introgression while simultaneously accounting for dependence across sites,
point mutations, recombination, and ancestral polymorphism
Simulations and cosmological inference: A statistical model for power spectra means and covariances
We describe an approximate statistical model for the sample variance
distribution of the non-linear matter power spectrum that can be calibrated
from limited numbers of simulations. Our model retains the common assumption of
a multivariate Normal distribution for the power spectrum band powers, but
takes full account of the (parameter dependent) power spectrum covariance. The
model is calibrated using an extension of the framework in Habib et al. (2007)
to train Gaussian processes for the power spectrum mean and covariance given a
set of simulation runs over a hypercube in parameter space. We demonstrate the
performance of this machinery by estimating the parameters of a power-law model
for the power spectrum. Within this framework, our calibrated sample variance
distribution is robust to errors in the estimated covariance and shows rapid
convergence of the posterior parameter constraints with the number of training
simulations.Comment: 14 pages, 3 figures, matches final version published in PR
Cosmic Calibration: Constraints from the Matter Power Spectrum and the Cosmic Microwave Background
Several cosmological measurements have attained significant levels of
maturity and accuracy over the last decade. Continuing this trend, future
observations promise measurements of the statistics of the cosmic mass
distribution at an accuracy level of one percent out to spatial scales with
k~10 h/Mpc and even smaller, entering highly nonlinear regimes of gravitational
instability. In order to interpret these observations and extract useful
cosmological information from them, such as the equation of state of dark
energy, very costly high precision, multi-physics simulations must be
performed. We have recently implemented a new statistical framework with the
aim of obtaining accurate parameter constraints from combining observations
with a limited number of simulations. The key idea is the replacement of the
full simulator by a fast emulator with controlled error bounds. In this paper,
we provide a detailed description of the methodology and extend the framework
to include joint analysis of cosmic microwave background and large scale
structure measurements. Our framework is especially well-suited for upcoming
large scale structure probes of dark energy such as baryon acoustic
oscillations and, especially, weak lensing, where percent level accuracy on
nonlinear scales is needed.Comment: 15 pages, 14 figure
PhyloNet: a software package for analyzing and reconstructing reticulate evolutionary relationships
<p>Abstract</p> <p>Background</p> <p>Phylogenies, i.e., the evolutionary histories of groups of taxa, play a major role in representing the interrelationships among biological entities. Many software tools for reconstructing and evaluating such phylogenies have been proposed, almost all of which assume the underlying evolutionary history to be a tree. While trees give a satisfactory first-order approximation for many families of organisms, other families exhibit evolutionary mechanisms that cannot be represented by trees. Processes such as horizontal gene transfer (HGT), hybrid speciation, and interspecific recombination, collectively referred to as <it>reticulate evolutionary events</it>, result in <it>networks</it>, rather than trees, of relationships. Various software tools have been recently developed to analyze reticulate evolutionary relationships, which include SplitsTree4, LatTrans, EEEP, HorizStory, and T-REX.</p> <p>Results</p> <p>In this paper, we report on the PhyloNet software package, which is a suite of tools for analyzing reticulate evolutionary relationships, or <it>evolutionary networks</it>, which are rooted, directed, acyclic graphs, leaf-labeled by a set of taxa. These tools can be classified into four categories: (1) evolutionary network representation: reading/writing evolutionary networks in a newly devised compact form; (2) evolutionary network characterization: analyzing evolutionary networks in terms of three basic building blocks – trees, clusters, and tripartitions; (3) evolutionary network comparison: comparing two evolutionary networks in terms of topological dissimilarities, as well as fitness to sequence evolution under a maximum parsimony criterion; and (4) evolutionary network reconstruction: reconstructing an evolutionary network from a species tree and a set of gene trees.</p> <p>Conclusion</p> <p>The software package, PhyloNet, offers an array of utilities to allow for efficient and accurate analysis of evolutionary networks. The software package will help significantly in analyzing large data sets, as well as in studying the performance of evolutionary network reconstruction methods. Further, the software package supports the proposed eNewick format for compact representation of evolutionary networks, a feature that allows for efficient interoperability of evolutionary network software tools. Currently, all utilities in PhyloNet are invoked on the command line.</p
First impressions and perceived roles: Palestinian perceptions on foreign aid
This paper summarizes some results of a wider research on foreign aid that was conducted in the West Bank and Gaza Strip in 2010. It seeks to describe the impressions and feelings of Palestinian aid beneficiaries as well as the roles and functions they attached to foreign aid. To capture and measure local perceptions on Western assistance a series of individual in depth interviews and few focus group interviews were conducted in the Palestinian territories. The interview transcripts were processed by content analysis. As research results show — from the perspective of aid beneficiaries — foreign aid is more related to human dignity than to any economic development. All this implies that frustration with the ongoing Israeli-Palestinian conflict inevitably embraces the donor policies and practices too
Maximum Parsimony on Phylogenetic networks
Abstract Background Phylogenetic networks are generalizations of phylogenetic trees, that are used to model evolutionary events in various contexts. Several different methods and criteria have been introduced for reconstructing phylogenetic trees. Maximum Parsimony is a character-based approach that infers a phylogenetic tree by minimizing the total number of evolutionary steps required to explain a given set of data assigned on the leaves. Exact solutions for optimizing parsimony scores on phylogenetic trees have been introduced in the past. Results In this paper, we define the parsimony score on networks as the sum of the substitution costs along all the edges of the network; and show that certain well-known algorithms that calculate the optimum parsimony score on trees, such as Sankoff and Fitch algorithms extend naturally for networks, barring conflicting assignments at the reticulate vertices. We provide heuristics for finding the optimum parsimony scores on networks. Our algorithms can be applied for any cost matrix that may contain unequal substitution costs of transforming between different characters along different edges of the network. We analyzed this for experimental data on 10 leaves or fewer with at most 2 reticulations and found that for almost all networks, the bounds returned by the heuristics matched with the exhaustively determined optimum parsimony scores. Conclusion The parsimony score we define here does not directly reflect the cost of the best tree in the network that displays the evolution of the character. However, when searching for the most parsimonious network that describes a collection of characters, it becomes necessary to add additional cost considerations to prefer simpler structures, such as trees over networks. The parsimony score on a network that we describe here takes into account the substitution costs along the additional edges incident on each reticulate vertex, in addition to the substitution costs along the other edges which are common to all the branching patterns introduced by the reticulate vertices. Thus the score contains an in-built cost for the number of reticulate vertices in the network, and would provide a criterion that is comparable among all networks. Although the problem of finding the parsimony score on the network is believed to be computationally hard to solve, heuristics such as the ones described here would be beneficial in our efforts to find a most parsimonious network.</p
Circular Networks from Distorted Metrics
Trees have long been used as a graphical representation of species
relationships. However complex evolutionary events, such as genetic
reassortments or hybrid speciations which occur commonly in viruses, bacteria
and plants, do not fit into this elementary framework. Alternatively, various
network representations have been developed. Circular networks are a natural
generalization of leaf-labeled trees interpreted as split systems, that is,
collections of bipartitions over leaf labels corresponding to current species.
Although such networks do not explicitly model specific evolutionary events of
interest, their straightforward visualization and fast reconstruction have made
them a popular exploratory tool to detect network-like evolution in genetic
datasets.
Standard reconstruction methods for circular networks, such as Neighbor-Net,
rely on an associated metric on the species set. Such a metric is first
estimated from DNA sequences, which leads to a key difficulty: distantly
related sequences produce statistically unreliable estimates. This is
problematic for Neighbor-Net as it is based on the popular tree reconstruction
method Neighbor-Joining, whose sensitivity to distance estimation errors is
well established theoretically. In the tree case, more robust reconstruction
methods have been developed using the notion of a distorted metric, which
captures the dependence of the error in the distance through a radius of
accuracy. Here we design the first circular network reconstruction method based
on distorted metrics. Our method is computationally efficient. Moreover, the
analysis of its radius of accuracy highlights the important role played by the
maximum incompatibility, a measure of the extent to which the network differs
from a tree.Comment: Submitte
- …