Enzyme functional evolution through improved catalysis of ancestrally nonpreferred substrates.

PubMed

Huang, Ruiqi; Hippauf, Frank; Rohrbeck, Diana; Haustein, Maria; Wenke, Katrin; Feike, Janie; Sorrelle, Noah; Piechulla, Birgit; Barkman, Todd J

2012-02-21

In this study, we investigated the role for ancestral functional variation that may be selected upon to generate protein functional shifts using ancestral protein resurrection, statistical tests for positive selection, forward and reverse evolutionary genetics, and enzyme functional assays. Data are presented for three instances of protein functional change in the salicylic acid/benzoic acid/theobromine (SABATH) lineage of plant secondary metabolite-producing enzymes. In each case, we demonstrate that ancestral nonpreferred activities were improved upon in a daughter enzyme after gene duplication, and that these functional shifts were likely coincident with positive selection. Both forward and reverse mutagenesis studies validate the impact of one or a few sites toward increasing activity with ancestrally nonpreferred substrates. In one case, we document the occurrence of an evolutionary reversal of an active site residue that reversed enzyme properties. Furthermore, these studies show that functionally important amino acid replacements result in substrate discrimination as reflected in evolutionary changes in the specificity constant (k(cat)/K(M)) for competing substrates, even though adaptive substitutions may affect K(M) and k(cat) separately. In total, these results indicate that nonpreferred, or even latent, ancestral protein activities may be coopted at later times to become the primary or preferred protein activities.

Ancestrality and evolution of trait syndromes in finches (Fringillidae).

PubMed

Ponge, Jean-François; Zuccon, Dario; Elias, Marianne; Pavoine, Sandrine; Henry, Pierre-Yves; Théry, Marc; Guilbert, Éric

2017-12-01

Species traits have been hypothesized by one of us (Ponge, 2013) to evolve in a correlated manner as species colonize stable, undisturbed habitats, shifting from "ancestral" to "derived" strategies. We predicted that generalism, r-selection, sexual monomorphism, and migration/gregariousness are the ancestral states (collectively called strategy A) and evolved correlatively toward specialism, K-selection, sexual dimorphism, and residence/territoriality as habitat stabilized (collectively called B strategy). We analyzed the correlated evolution of four syndromes, summarizing the covariation between 53 traits, respectively, involved in ecological specialization, r-K gradient, sexual selection, and dispersal/social behaviors in 81 species representative of Fringillidae, a bird family with available natural history information and that shows variability for all these traits. The ancestrality of strategy A was supported for three of the four syndromes, the ancestrality of generalism having a weaker support, except for the core group Carduelinae (69 species). It appeared that two different B-strategies evolved from the ancestral state A, both associated with highly predictable environments: one in poorly seasonal environments, called B1, with species living permanently in lowland tropics, with "slow pace of life" and weak sexual dimorphism, and one in highly seasonal environments, called B2, with species breeding out-of-the-tropics, migratory, with a "fast pace of life" and high sexual dimorphism.

Inference of population splits and mixtures from genome-wide allele frequency data.

PubMed

Pickrell, Joseph K; Pritchard, Jonathan K

2012-01-01

Many aspects of the historical relationships between populations in a species are reflected in genetic data. Inferring these relationships from genetic data, however, remains a challenging task. In this paper, we present a statistical model for inferring the patterns of population splits and mixtures in multiple populations. In our model, the sampled populations in a species are related to their common ancestor through a graph of ancestral populations. Using genome-wide allele frequency data and a Gaussian approximation to genetic drift, we infer the structure of this graph. We applied this method to a set of 55 human populations and a set of 82 dog breeds and wild canids. In both species, we show that a simple bifurcating tree does not fully describe the data; in contrast, we infer many migration events. While some of the migration events that we find have been detected previously, many have not. For example, in the human data, we infer that Cambodians trace approximately 16% of their ancestry to a population ancestral to other extant East Asian populations. In the dog data, we infer that both the boxer and basenji trace a considerable fraction of their ancestry (9% and 25%, respectively) to wolves subsequent to domestication and that East Asian toy breeds (the Shih Tzu and the Pekingese) result from admixture between modern toy breeds and "ancient" Asian breeds. Software implementing the model described here, called TreeMix, is available at http://treemix.googlecode.com.

Genome-wide SNP data suggest complex ancestry of sympatric North Pacific killer whale ecotypes.

PubMed

Foote, A D; Morin, P A

2016-11-01

Three ecotypes of killer whale occur in partial sympatry in the North Pacific. Individuals assortatively mate within the same ecotype, resulting in correlated ecological and genetic differentiation. A key question is whether this pattern of evolutionary divergence is an example of incipient sympatric speciation from a single panmictic ancestral population, or whether sympatry could have resulted from multiple colonisations of the North Pacific and secondary contact between ecotypes. Here, we infer multilocus coalescent trees from >1000 nuclear single-nucleotide polymorphisms (SNPs) and find evidence of incomplete lineage sorting so that the genealogies of SNPs do not all conform to a single topology. To disentangle whether uncertainty in the phylogenetic inference of the relationships among ecotypes could also result from ancestral admixture events we reconstructed the relationship among the ecotypes as an admixture graph and estimated f 4 -statistics using TreeMix. The results were consistent with episodes of admixture between two of the North Pacific ecotypes and the two outgroups (populations from the Southern Ocean and the North Atlantic). Gene flow may have occurred via unsampled 'ghost' populations rather than directly between the populations sampled here. Our results indicate that because of ancestral admixture events and incomplete lineage sorting, a single bifurcating tree does not fully describe the relationship among these populations. The data are therefore most consistent with the genomic variation among North Pacific killer whale ecotypes resulting from multiple colonisation events, and secondary contact may have facilitated evolutionary divergence. Thus, the present-day populations of North Pacific killer whale ecotypes have a complex ancestry, confounding the tree-based inference of ancestral geography.

Evolutionary graph theory: breaking the symmetry between interaction and replacement

PubMed Central

Ohtsuki, Hisashi; Pacheco, Jorge M.; Nowak, Martin A.

2008-01-01

We study evolutionary dynamics in a population whose structure is given by two graphs: the interaction graph determines who plays with whom in an evolutionary game; the replacement graph specifies the geometry of evolutionary competition and updating. First, we calculate the fixation probabilities of frequency dependent selection between two strategies or phenotypes. We consider three different update mechanisms: birth-death, death-birth and imitation. Then, as a particular example, we explore the evolution of cooperation. Suppose the interaction graph is a regular graph of degree h, the replacement graph is a regular graph of degree g and the overlap between the two graphs is a regular graph of degree l. We show that cooperation is favored by natural selection if b/c > hg/l. Here, b and c denote the benefit and cost of the altruistic act. This result holds for death-birth updating, weak selection and large population size. Note that the optimum population structure for cooperators is given by maximum overlap between the interaction and the replacement graph (g = h = l), which means that the two graphs are identical. We also prove that a modified replicator equation can describe how the expected values of the frequencies of an arbitrary number of strategies change on replacement and interaction graphs: the two graphs induce a transformation of the payoff matrix. PMID:17350049

What Would a Graph Look Like in this Layout? A Machine Learning Approach to Large Graph Visualization.

PubMed

Kwon, Oh-Hyun; Crnovrsanin, Tarik; Ma, Kwan-Liu

2018-01-01

Using different methods for laying out a graph can lead to very different visual appearances, with which the viewer perceives different information. Selecting a "good" layout method is thus important for visualizing a graph. The selection can be highly subjective and dependent on the given task. A common approach to selecting a good layout is to use aesthetic criteria and visual inspection. However, fully calculating various layouts and their associated aesthetic metrics is computationally expensive. In this paper, we present a machine learning approach to large graph visualization based on computing the topological similarity of graphs using graph kernels. For a given graph, our approach can show what the graph would look like in different layouts and estimate their corresponding aesthetic metrics. An important contribution of our work is the development of a new framework to design graph kernels. Our experimental study shows that our estimation calculation is considerably faster than computing the actual layouts and their aesthetic metrics. Also, our graph kernels outperform the state-of-the-art ones in both time and accuracy. In addition, we conducted a user study to demonstrate that the topological similarity computed with our graph kernel matches perceptual similarity assessed by human users.

Genome-wide SNP data suggest complex ancestry of sympatric North Pacific killer whale ecotypes

PubMed Central

Foote, A D; Morin, P A

2016-01-01

Three ecotypes of killer whale occur in partial sympatry in the North Pacific. Individuals assortatively mate within the same ecotype, resulting in correlated ecological and genetic differentiation. A key question is whether this pattern of evolutionary divergence is an example of incipient sympatric speciation from a single panmictic ancestral population, or whether sympatry could have resulted from multiple colonisations of the North Pacific and secondary contact between ecotypes. Here, we infer multilocus coalescent trees from >1000 nuclear single-nucleotide polymorphisms (SNPs) and find evidence of incomplete lineage sorting so that the genealogies of SNPs do not all conform to a single topology. To disentangle whether uncertainty in the phylogenetic inference of the relationships among ecotypes could also result from ancestral admixture events we reconstructed the relationship among the ecotypes as an admixture graph and estimated f4-statistics using TreeMix. The results were consistent with episodes of admixture between two of the North Pacific ecotypes and the two outgroups (populations from the Southern Ocean and the North Atlantic). Gene flow may have occurred via unsampled ‘ghost' populations rather than directly between the populations sampled here. Our results indicate that because of ancestral admixture events and incomplete lineage sorting, a single bifurcating tree does not fully describe the relationship among these populations. The data are therefore most consistent with the genomic variation among North Pacific killer whale ecotypes resulting from multiple colonisation events, and secondary contact may have facilitated evolutionary divergence. Thus, the present-day populations of North Pacific killer whale ecotypes have a complex ancestry, confounding the tree-based inference of ancestral geography. PMID:27485668

GrouseFlocks: steerable exploration of graph hierarchy space.

PubMed

Archambault, Daniel; Munzner, Tamara; Auber, David

2008-01-01

Several previous systems allow users to interactively explore a large input graph through cuts of a superimposed hierarchy. This hierarchy is often created using clustering algorithms or topological features present in the graph. However, many graphs have domain-specific attributes associated with the nodes and edges, which could be used to create many possible hierarchies providing unique views of the input graph. GrouseFlocks is a system for the exploration of this graph hierarchy space. By allowing users to see several different possible hierarchies on the same graph, the system helps users investigate graph hierarchy space instead of a single fixed hierarchy. GrouseFlocks provides a simple set of operations so that users can create and modify their graph hierarchies based on selections. These selections can be made manually or based on patterns in the attribute data provided with the graph. It provides feedback to the user within seconds, allowing interactive exploration of this space.

IRiS: construction of ARG networks at genomic scales.

PubMed

Javed, Asif; Pybus, Marc; Melé, Marta; Utro, Filippo; Bertranpetit, Jaume; Calafell, Francesc; Parida, Laxmi

2011-09-01

Given a set of extant haplotypes IRiS first detects high confidence recombination events in their shared genealogy. Next using the local sequence topology defined by each detected event, it integrates these recombinations into an ancestral recombination graph. While the current system has been calibrated for human population data, it is easily extendible to other species as well. IRiS (Identification of Recombinations in Sequences) binary files are available for non-commercial use in both Linux and Microsoft Windows, 32 and 64 bit environments from https://researcher.ibm.com/researcher/view_project.php?id = 2303 parida@us.ibm.com.

Sampling ARG of multiple populations under complex configurations of subdivision and admixture.

PubMed

Carrieri, Anna Paola; Utro, Filippo; Parida, Laxmi

2016-04-01

Simulating complex evolution scenarios of multiple populations is an important task for answering many basic questions relating to population genomics. Apart from the population samples, the underlying Ancestral Recombinations Graph (ARG) is an additional important means in hypothesis checking and reconstruction studies. Furthermore, complex simulations require a plethora of interdependent parameters making even the scenario-specification highly non-trivial. We present an algorithm SimRA that simulates generic multiple population evolution model with admixture. It is based on random graphs that improve dramatically in time and space requirements of the classical algorithm of single populations.Using the underlying random graphs model, we also derive closed forms of expected values of the ARG characteristics i.e., height of the graph, number of recombinations, number of mutations and population diversity in terms of its defining parameters. This is crucial in aiding the user to specify meaningful parameters for the complex scenario simulations, not through trial-and-error based on raw compute power but intelligent parameter estimation. To the best of our knowledge this is the first time closed form expressions have been computed for the ARG properties. We show that the expected values closely match the empirical values through simulations.Finally, we demonstrate that SimRA produces the ARG in compact forms without compromising any accuracy. We demonstrate the compactness and accuracy through extensive experiments. SimRA (Simulation based on Random graph Algorithms) source, executable, user manual and sample input-output sets are available for downloading at: https://github.com/ComputationalGenomics/SimRA CONTACT: : parida@us.ibm.com Supplementary data are available at Bioinformatics online. © The Author 2015. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com.

High-order graph matching based feature selection for Alzheimer's disease identification.

PubMed

Liu, Feng; Suk, Heung-Il; Wee, Chong-Yaw; Chen, Huafu; Shen, Dinggang

2013-01-01

One of the main limitations of l1-norm feature selection is that it focuses on estimating the target vector for each sample individually without considering relations with other samples. However, it's believed that the geometrical relation among target vectors in the training set may provide useful information, and it would be natural to expect that the predicted vectors have similar geometric relations as the target vectors. To overcome these limitations, we formulate this as a graph-matching feature selection problem between a predicted graph and a target graph. In the predicted graph a node is represented by predicted vector that may describe regional gray matter volume or cortical thickness features, and in the target graph a node is represented by target vector that include class label and clinical scores. In particular, we devise new regularization terms in sparse representation to impose high-order graph matching between the target vectors and the predicted ones. Finally, the selected regional gray matter volume and cortical thickness features are fused in kernel space for classification. Using the ADNI dataset, we evaluate the effectiveness of the proposed method and obtain the accuracies of 92.17% and 81.57% in AD and MCI classification, respectively.

IcyTree: rapid browser-based visualization for phylogenetic trees and networks

PubMed Central

2017-01-01

Abstract Summary: IcyTree is an easy-to-use application which can be used to visualize a wide variety of phylogenetic trees and networks. While numerous phylogenetic tree viewers exist already, IcyTree distinguishes itself by being a purely online tool, having a responsive user interface, supporting phylogenetic networks (ancestral recombination graphs in particular), and efficiently drawing trees that include information such as ancestral locations or trait values. IcyTree also provides intuitive panning and zooming utilities that make exploring large phylogenetic trees of many thousands of taxa feasible. Availability and Implementation: IcyTree is a web application and can be accessed directly at http://tgvaughan.github.com/icytree. Currently supported web browsers include Mozilla Firefox and Google Chrome. IcyTree is written entirely in client-side JavaScript (no plugin required) and, once loaded, does not require network access to run. IcyTree is free software, and the source code is made available at http://github.com/tgvaughan/icytree under version 3 of the GNU General Public License. Contact: tgvaughan@gmail.com PMID:28407035

IcyTree: rapid browser-based visualization for phylogenetic trees and networks.

PubMed

Vaughan, Timothy G

2017-08-01

IcyTree is an easy-to-use application which can be used to visualize a wide variety of phylogenetic trees and networks. While numerous phylogenetic tree viewers exist already, IcyTree distinguishes itself by being a purely online tool, having a responsive user interface, supporting phylogenetic networks (ancestral recombination graphs in particular), and efficiently drawing trees that include information such as ancestral locations or trait values. IcyTree also provides intuitive panning and zooming utilities that make exploring large phylogenetic trees of many thousands of taxa feasible. IcyTree is a web application and can be accessed directly at http://tgvaughan.github.com/icytree . Currently supported web browsers include Mozilla Firefox and Google Chrome. IcyTree is written entirely in client-side JavaScript (no plugin required) and, once loaded, does not require network access to run. IcyTree is free software, and the source code is made available at http://github.com/tgvaughan/icytree under version 3 of the GNU General Public License. tgvaughan@gmail.com. © The Author(s) 2017. Published by Oxford University Press.

Evolutionary interplay between structure, energy and epistasis in the coat protein of the ϕX174 phage family.

PubMed

Redondo, Rodrigo A F; de Vladar, Harold P; Włodarski, Tomasz; Bollback, Jonathan P

2017-01-01

Viral capsids are structurally constrained by interactions among the amino acids (AAs) of their constituent proteins. Therefore, epistasis is expected to evolve among physically interacting sites and to influence the rates of substitution. To study the evolution of epistasis, we focused on the major structural protein of the ϕX174 phage family by first reconstructing the ancestral protein sequences of 18 species using a Bayesian statistical framework. The inferred ancestral reconstruction differed at eight AAs, for a total of 256 possible ancestral haplotypes. For each ancestral haplotype and the extant species, we estimated, in silico, the distribution of free energies and epistasis of the capsid structure. We found that free energy has not significantly increased but epistasis has. We decomposed epistasis up to fifth order and found that higher-order epistasis sometimes compensates pairwise interactions making the free energy seem additive. The dN/dS ratio is low, suggesting strong purifying selection, and that structure is under stabilizing selection. We synthesized phages carrying ancestral haplotypes of the coat protein gene and measured their fitness experimentally. Our findings indicate that stabilizing mutations can have higher fitness, and that fitness optima do not necessarily coincide with energy minima. © 2017 The Authors.

Divergent sorting of a balanced ancestral polymorphism underlies the establishment of gene-flow barriers in Capsella

PubMed Central

Sicard, Adrien; Kappel, Christian; Josephs, Emily B.; Lee, Young Wha; Marona, Cindy; Stinchcombe, John R.; Wright, Stephen I.; Lenhard, Michael

2015-01-01

In the Bateson–Dobzhansky–Muller model of genetic incompatibilities post-zygotic gene-flow barriers arise by fixation of novel alleles at interacting loci in separated populations. Many such incompatibilities are polymorphic in plants, implying an important role for genetic drift or balancing selection in their origin and evolution. Here we show that NPR1 and RPP5 loci cause a genetic incompatibility between the incipient species Capsella grandiflora and C. rubella, and the more distantly related C. rubella and C. orientalis. The incompatible RPP5 allele results from a mutation in C. rubella, while the incompatible NPR1 allele is frequent in the ancestral C. grandiflora. Compatible and incompatible NPR1 haplotypes are maintained by balancing selection in C. grandiflora, and were divergently sorted into the derived C. rubella and C. orientalis. Thus, by maintaining differentiated alleles at high frequencies, balancing selection on ancestral polymorphisms can facilitate establishing gene-flow barriers between derived populations through lineage sorting of the alternative alleles. PMID:26268845

Some Applications of Graph Theory to Clustering

ERIC Educational Resources Information Center

Hubert, Lawrence J.

1974-01-01

The connection between graph theory and clustering is reviewed and extended. Major emphasis is on restating, in a graph-theoretic context, selected past work in clustering, and conversely, developing alternative strategies from several standard concepts used in graph theory per se. (Author/RC)

Evolutionary dynamics on graphs

NASA Astrophysics Data System (ADS)

Lieberman, Erez; Hauert, Christoph; Nowak, Martin A.

2005-01-01

Evolutionary dynamics have been traditionally studied in the context of homogeneous or spatially extended populations. Here we generalize population structure by arranging individuals on a graph. Each vertex represents an individual. The weighted edges denote reproductive rates which govern how often individuals place offspring into adjacent vertices. The homogeneous population, described by the Moran process, is the special case of a fully connected graph with evenly weighted edges. Spatial structures are described by graphs where vertices are connected with their nearest neighbours. We also explore evolution on random and scale-free networks. We determine the fixation probability of mutants, and characterize those graphs for which fixation behaviour is identical to that of a homogeneous population. Furthermore, some graphs act as suppressors and others as amplifiers of selection. It is even possible to find graphs that guarantee the fixation of any advantageous mutant. We also study frequency-dependent selection and show that the outcome of evolutionary games can depend entirely on the structure of the underlying graph. Evolutionary graph theory has many fascinating applications ranging from ecology to multi-cellular organization and economics.

Additive genetic variation and evolvability of a multivariate trait can be increased by epistatic gene action.

PubMed

Griswold, Cortland K

2015-12-21

Epistatic gene action occurs when mutations or alleles interact to produce a phenotype. Theoretically and empirically it is of interest to know whether gene interactions can facilitate the evolution of diversity. In this paper, we explore how epistatic gene action affects the additive genetic component or heritable component of multivariate trait variation, as well as how epistatic gene action affects the evolvability of multivariate traits. The analysis involves a sexually reproducing and recombining population. Our results indicate that under stabilizing selection conditions a population with a mixed additive and epistatic genetic architecture can have greater multivariate additive genetic variation and evolvability than a population with a purely additive genetic architecture. That greater multivariate additive genetic variation can occur with epistasis is in contrast to previous theory that indicated univariate additive genetic variation is decreased with epistasis under stabilizing selection conditions. In a multivariate setting, epistasis leads to less relative covariance among individuals in their genotypic, as well as their breeding values, which facilitates the maintenance of additive genetic variation and increases a population׳s evolvability. Our analysis involves linking the combinatorial nature of epistatic genetic effects to the ancestral graph structure of a population to provide insight into the consequences of epistasis on multivariate trait variation and evolution. Copyright © 2015 Elsevier Ltd. All rights reserved.

The Coalescent Process in Models with Selection

PubMed Central

Kaplan, N. L.; Darden, T.; Hudson, R. R.

1988-01-01

Statistical properties of the process describing the genealogical history of a random sample of genes are obtained for a class of population genetics models with selection. For models with selection, in contrast to models without selection, the distribution of this process, the coalescent process, depends on the distribution of the frequencies of alleles in the ancestral generations. If the ancestral frequency process can be approximated by a diffusion, then the mean and the variance of the number of segregating sites due to selectively neutral mutations in random samples can be numerically calculated. The calculations are greatly simplified if the frequencies of the alleles are tightly regulated. If the mutation rates between alleles maintained by balancing selection are low, then the number of selectively neutral segregating sites in a random sample of genes is expected to substantially exceed the number predicted under a neutral model. PMID:3066685

Evolutionary dynamics on graphs: Efficient method for weak selection

NASA Astrophysics Data System (ADS)

Fu, Feng; Wang, Long; Nowak, Martin A.; Hauert, Christoph

2009-04-01

Investigating the evolutionary dynamics of game theoretical interactions in populations where individuals are arranged on a graph can be challenging in terms of computation time. Here, we propose an efficient method to study any type of game on arbitrary graph structures for weak selection. In this limit, evolutionary game dynamics represents a first-order correction to neutral evolution. Spatial correlations can be empirically determined under neutral evolution and provide the basis for formulating the game dynamics as a discrete Markov process by incorporating a detailed description of the microscopic dynamics based on the neutral correlations. This framework is then applied to one of the most intriguing questions in evolutionary biology: the evolution of cooperation. We demonstrate that the degree heterogeneity of a graph impedes cooperation and that the success of tit for tat depends not only on the number of rounds but also on the degree of the graph. Moreover, considering the mutation-selection equilibrium shows that the symmetry of the stationary distribution of states under weak selection is skewed in favor of defectors for larger selection strengths. In particular, degree heterogeneity—a prominent feature of scale-free networks—generally results in a more pronounced increase in the critical benefit-to-cost ratio required for evolution to favor cooperation as compared to regular graphs. This conclusion is corroborated by an analysis of the effects of population structures on the fixation probabilities of strategies in general 2×2 games for different types of graphs. Computer simulations confirm the predictive power of our method and illustrate the improved accuracy as compared to previous studies.

Most Undirected Random Graphs Are Amplifiers of Selection for Birth-Death Dynamics, but Suppressors of Selection for Death-Birth Dynamics.

PubMed

Hindersin, Laura; Traulsen, Arne

2015-11-01

We analyze evolutionary dynamics on graphs, where the nodes represent individuals of a population. The links of a node describe which other individuals can be displaced by the offspring of the individual on that node. Amplifiers of selection are graphs for which the fixation probability is increased for advantageous mutants and decreased for disadvantageous mutants. A few examples of such amplifiers have been developed, but so far it is unclear how many such structures exist and how to construct them. Here, we show that almost any undirected random graph is an amplifier of selection for Birth-death updating, where an individual is selected to reproduce with probability proportional to its fitness and one of its neighbors is replaced by that offspring at random. If we instead focus on death-Birth updating, in which a random individual is removed and its neighbors compete for the empty spot, then the same ensemble of graphs consists of almost only suppressors of selection for which the fixation probability is decreased for advantageous mutants and increased for disadvantageous mutants. Thus, the impact of population structure on evolutionary dynamics is a subtle issue that will depend on seemingly minor details of the underlying evolutionary process.

Inference of Spatio-Temporal Functions Over Graphs via Multikernel Kriged Kalman Filtering

NASA Astrophysics Data System (ADS)

Ioannidis, Vassilis N.; Romero, Daniel; Giannakis, Georgios B.

2018-06-01

Inference of space-time varying signals on graphs emerges naturally in a plethora of network science related applications. A frequently encountered challenge pertains to reconstructing such dynamic processes, given their values over a subset of vertices and time instants. The present paper develops a graph-aware kernel-based kriged Kalman filter that accounts for the spatio-temporal variations, and offers efficient online reconstruction, even for dynamically evolving network topologies. The kernel-based learning framework bypasses the need for statistical information by capitalizing on the smoothness that graph signals exhibit with respect to the underlying graph. To address the challenge of selecting the appropriate kernel, the proposed filter is combined with a multi-kernel selection module. Such a data-driven method selects a kernel attuned to the signal dynamics on-the-fly within the linear span of a pre-selected dictionary. The novel multi-kernel learning algorithm exploits the eigenstructure of Laplacian kernel matrices to reduce computational complexity. Numerical tests with synthetic and real data demonstrate the superior reconstruction performance of the novel approach relative to state-of-the-art alternatives.

Graph State-Based Quantum Secret Sharing with the Chinese Remainder Theorem

NASA Astrophysics Data System (ADS)

Guo, Ying; Luo, Peng; Wang, Yijun

2016-11-01

Quantum secret sharing (QSS) is a significant quantum cryptography technology in the literature. Dividing an initial secret into several sub-secrets which are then transferred to other legal participants so that it can be securely recovered in a collaboration fashion. In this paper, we develop a quantum route selection based on the encoded quantum graph state, thus enabling the practical QSS scheme in the small-scale complex quantum network. Legal participants are conveniently designated with the quantum route selection using the entanglement of the encoded graph states. Each participant holds a vertex of the graph state so that legal participants are selected through performing operations on specific vertices. The Chinese remainder theorem (CRT) strengthens the security of the recovering process of the initial secret among the legal participants. The security is ensured by the entanglement of the encoded graph states that are cooperatively prepared and shared by legal users beforehand with the sub-secrets embedded in the CRT over finite fields.

Avian W and mammalian Y chromosomes convergently retained dosage-sensitive regulators

PubMed Central

Bellott, Daniel W.; Skaletsky, Helen; Cho, Ting-Jan; Brown, Laura; Locke, Devin; Chen, Nancy; Galkina, Svetlana; Pyntikova, Tatyana; Koutseva, Natalia; Graves, Tina; Kremitzki, Colin; Warren, Wesley C.; Clark, Andrew G.; Gaginskaya, Elena; Wilson, Richard K.; Page, David C.

2017-01-01

After birds diverged from mammals, different ancestral autosomes evolved into sex chromosomes in each lineage. In birds, females are ZW and males ZZ, but in mammals females are XX and males XY. We sequenced the chicken W chromosome, compared its gene content with our reconstruction of the ancestral autosomes, and followed the evolutionary trajectory of ancestral W-linked genes across birds. Avian W chromosomes evolved in parallel with mammalian Y chromosomes, preserving ancestral genes through selection to maintain the dosage of broadly-expressed regulators of key cellular processes. We propose that, like the human Y chromosome, the chicken W chromosome is essential for embryonic viability of the heterogametic sex. Unlike other sequenced sex chromosomes, the chicken W did not acquire and amplify genes specifically expressed in reproductive tissues. We speculate that the pressures that drive the acquisition of reproduction related genes on sex chromosomes may be specific to the male germ line. PMID:28135246

An Indel Polymorphism in the Hybrid Incompatibility Gene Lethal Hybrid Rescue of Drosophila Is Functionally Relevant

PubMed Central

Maheshwari, Shamoni; Barbash, Daniel A.

2012-01-01

Hybrid incompatibility (HI) genes are frequently observed to be rapidly evolving under selection. This observation has led to the attractive conjecture that selection-derived protein-sequence divergence is culpable for incompatibilities in hybrids. The Drosophila simulans HI gene Lethal hybrid rescue (Lhr) is an intriguing case, because despite having experienced rapid sequence evolution, its HI properties are a shared function inherited from the ancestral state. Using an unusual D. simulans Lhr hybrid rescue allele, Lhr2, we here identify a conserved stretch of 10 amino acids in the C terminus of LHR that is critical for causing hybrid incompatibility. Altering these 10 amino acids weakens or abolishes the ability of Lhr to suppress the hybrid rescue alleles Lhr1 or Hmr1, respectively. Besides single-amino-acid substitutions, Lhr orthologs differ by a 16-aa indel polymorphism, with the ancestral deletion state fixed in D. melanogaster and the derived insertion state at very high frequency in D. simulans. Lhr2 is a rare D. simulans allele that has the ancestral deletion state of the 16-aa polymorphism. Through a series of transgenic constructs we demonstrate that the ancestral deletion state contributes to the rescue activity of Lhr2. This indel is thus a polymorphism that can affect the HI function of Lhr. PMID:22865735

Evaluation of Graph Pattern Matching Workloads in Graph Analysis Systems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hong, Seokyong; Lee, Sangkeun; Lim, Seung-Hwan

2016-01-01

Graph analysis has emerged as a powerful method for data scientists to represent, integrate, query, and explore heterogeneous data sources. As a result, graph data management and mining became a popular area of research, and led to the development of plethora of systems in recent years. Unfortunately, the number of emerging graph analysis systems and the wide range of applications, coupled with a lack of apples-to-apples comparisons, make it difficult to understand the trade-offs between different systems and the graph operations for which they are designed. A fair comparison of these systems is a challenging task for the following reasons:more » multiple data models, non-standardized serialization formats, various query interfaces to users, and diverse environments they operate in. To address these key challenges, in this paper we present a new benchmark suite by extending the Lehigh University Benchmark (LUBM) to cover the most common capabilities of various graph analysis systems. We provide the design process of the benchmark, which generalizes the workflow for data scientists to conduct the desired graph analysis on different graph analysis systems. Equipped with this extended benchmark suite, we present performance comparison for nine subgraph pattern retrieval operations over six graph analysis systems, namely NetworkX, Neo4j, Jena, Titan, GraphX, and uRiKA. Through the proposed benchmark suite, this study reveals both quantitative and qualitative findings in (1) implications in loading data into each system; (2) challenges in describing graph patterns for each query interface; and (3) different sensitivity of each system to query selectivity. We envision that this study will pave the road for: (i) data scientists to select the suitable graph analysis systems, and (ii) data management system designers to advance graph analysis systems.« less

Molecular evolution of the betagamma lens crystallin superfamily: evidence for a retained ancestral function in gamma N crystallins?

PubMed

Weadick, Cameron J; Chang, Belinda S W

2009-05-01

Within the vertebrate eye, betagamma crystallins are extremely stable lens proteins that are uniquely adapted to increase refractory power while maintaining transparency. Unlike alpha crystallins, which are well-characterized, multifunctional proteins that have important functions both in and out of the lens, betagamma lens crystallins are a diverse group of proteins with no clear ancestral or contemporary nonlens role. We carried out phylogenetic and molecular evolutionary analyses of the betagamma-crystallin superfamily in order to study the evolutionary history of the gamma N crystallins, a recently discovered, biochemically atypical family suggested to possess a divergent or ancestral function. By including nonlens, betagamma-motif-containing sequences in our analysis as outgroups, we confirmed the phylogenetic position of the gamma N family as sister to other gamma crystallins. Using maximum likelihood codon models to estimate lineage-specific nonsynonymous-to-synonymous rate ratios revealed strong positive selection in all of the early lineages within the betagamma family, with the striking exception of the lineage leading to the gamma N crystallins which was characterized by strong purifying selection. Branch-site analysis, used to identify candidate sites involved in functional divergence between gamma N crystallins and its sister clade containing all other gamma crystallins, identified several positively selected changes at sites of known functional importance in the betagamma crystallin protein structure. Further analyses of a fish-specific gamma N crystallin gene duplication revealed a more recent episode of positive selection in only one of the two descendant lineages (gamma N2). Finally, from the guppy, Poecilia reticulata, we isolated complete gamma N1 and gamma N2 coding sequence data from cDNA and partial coding sequence data from genomic DNA in order to confirm the presence of a novel gamma N2 intron, discovered through data mining of two pufferfish genomes. We conclude that the function of the gamma N family likely resembles the ancestral vertebrate betagamma crystallin more than other betagamma families. Furthermore, owing to the presence of an additional intron in some fish gamma N2 crystallins, and the inferred action of positive selection following the fish-specific gamma N duplication, we suggest that further study of fish gamma N crystallins will be critical in further elucidating possible ancestral functions of gamma N crystallins and any nonstructural role they may have.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bromberger, Seth A.; Klymko, Christine F.; Henderson, Keith A.

Betweenness centrality is a graph statistic used to nd vertices that are participants in a large number of shortest paths in a graph. This centrality measure is commonly used in path and network interdiction problems and its complete form requires the calculation of all-pairs shortest paths for each vertex. This leads to a time complexity of O(jV jjEj), which is impractical for large graphs. Estimation of betweenness centrality has focused on performing shortest-path calculations on a subset of randomly- selected vertices. This reduces the complexity of the centrality estimation to O(jSjjEj); jSj < jV j, which can be scaled appropriatelymore » based on the computing resources available. An estimation strategy that uses random selection of vertices for seed selection is fast and simple to implement, but may not provide optimal estimation of betweenness centrality when the number of samples is constrained. Our experimentation has identi ed a number of alternate seed-selection strategies that provide lower error than random selection in common scale-free graphs. These strategies are discussed and experimental results are presented.« less

Biometric Subject Verification Based on Electrocardiographic Signals

NASA Technical Reports Server (NTRS)

Dusan, Sorin V. (Inventor); Jorgensen, Charles C. (Inventor)

2014-01-01

A method of authenticating or declining to authenticate an asserted identity of a candidate-person. In an enrollment phase, a reference PQRST heart action graph is provided or constructed from information obtained from a plurality of graphs that resemble each other for a known reference person, using a first graph comparison metric. In a verification phase, a candidate-person asserts his/her identity and presents a plurality of his/her heart cycle graphs. If a sufficient number of the candidate-person's measured graphs resemble each other, a representative composite graph is constructed from the candidate-person's graphs and is compared with a composite reference graph, for the person whose identity is asserted, using a second graph comparison metric. When the second metric value lies in a selected range, the candidate-person's assertion of identity is accepted.

On spatial coalescents with multiple mergers in two dimensions.

PubMed

Heuer, Benjamin; Sturm, Anja

2013-08-01

We consider the genealogy of a sample of individuals taken from a spatially structured population when the variance of the offspring distribution is relatively large. The space is structured into discrete sites of a graph G. If the population size at each site is large, spatial coalescents with multiple mergers, so called spatial Λ-coalescents, for which ancestral lines migrate in space and coalesce according to some Λ-coalescent mechanism, are shown to be appropriate approximations to the genealogy of a sample of individuals. We then consider as the graph G the two dimensional torus with side length 2L+1 and show that as L tends to infinity, and time is rescaled appropriately, the partition structure of spatial Λ-coalescents of individuals sampled far enough apart converges to the partition structure of a non-spatial Kingman coalescent. From a biological point of view this means that in certain circumstances both the spatial structure as well as larger variances of the underlying offspring distribution are harder to detect from the sample. However, supplemental simulations show that for moderately large L the different structure is still evident. Copyright © 2012 Elsevier Inc. All rights reserved.

Female song is widespread and ancestral in songbirds.

PubMed

Odom, Karan J; Hall, Michelle L; Riebel, Katharina; Omland, Kevin E; Langmore, Naomi E

2014-03-04

Bird song has historically been considered an almost exclusively male trait, an observation fundamental to the formulation of Darwin's theory of sexual selection. Like other male ornaments, song is used by male songbirds to attract females and compete with rivals. Thus, bird song has become a textbook example of the power of sexual selection to lead to extreme neurological and behavioural sex differences. Here we present an extensive survey and ancestral state reconstruction of female song across songbirds showing that female song is present in 71% of surveyed species including 32 families, and that females sang in the common ancestor of modern songbirds. Our results reverse classical assumptions about the evolution of song and sex differences in birds. The challenge now is to identify whether sexual selection alone or broader processes, such as social or natural selection, best explain the evolution of elaborate traits in both sexes.

Fault-tolerant dynamic task graph scheduling

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kurt, Mehmet C.; Krishnamoorthy, Sriram; Agrawal, Kunal

2014-11-16

In this paper, we present an approach to fault tolerant execution of dynamic task graphs scheduled using work stealing. In particular, we focus on selective and localized recovery of tasks in the presence of soft faults. We elicit from the user the basic task graph structure in terms of successor and predecessor relationships. The work stealing-based algorithm to schedule such a task graph is augmented to enable recovery when the data and meta-data associated with a task get corrupted. We use this redundancy, and the knowledge of the task graph structure, to selectively recover from faults with low space andmore » time overheads. We show that the fault tolerant design retains the essential properties of the underlying work stealing-based task scheduling algorithm, and that the fault tolerant execution is asymptotically optimal when task re-execution is taken into account. Experimental evaluation demonstrates the low cost of recovery under various fault scenarios.« less

Inability of populations of Callosobruchus maculatus to develop tolerance to exposures of acute gamma irradiation

DOE Office of Scientific and Technical Information (OSTI.GOV)

Brower, J.H.

1974-03-01

The reproductive capacity and resistance to an acute dose of gamma irradiation were determined for populations of Callosobruchus maculatus treated with substerilizing doses of irradiation each generation for 30 generations. Reproductive capacity was decreased by an ancestral history of irradiation, the reduction being positively correlated with both the size of dose per generation and the number of ancestral generations treated. Irradiation of the selected populations with an acute dose revealed no increase in tolerance, even after 30 generations. In general, the greater the amount of accumulated ancestral exposure to irradiation, the greater the sensitivity to further irradiation. The ability tomore » develop a tolerance to ionizing irradiation may not be a general phenomenon in insects. (auth)« less

Cloning and characterization of wnt4a gene and evidence for positive selection in half-smooth tongue sole (Cynoglossus semilaevis).

PubMed

Hu, Qiaomu; Zhu, Ying; Liu, Yang; Wang, Na; Chen, Songlin

2014-11-24

Wnt4 gene plays a role in developmental processes in mammals. However, little is known regarding its function in teleosts. We cloned and characterized the full-length half-smooth tongue sole (Cynoglossus semilaevis) wnt4a gene (CS-wnt4a). CS-wnt4a cDNA was 1746 bp in length encoding 353aa. CS-wnt4a expression level was highest in the testis, and gradually increased in the developing gonads until 1 year of age. In situ hybridization revealed that CS-wnt4a expression level was highest in stage II oocytes and sperm in the adult ovary and testis, respectively. CS-wnt4a expression level was significantly up-regulated in the gonads after exposure to high temperature. The level of methylation of the CS-wnt4a first exon was negatively correlated with the expression of CS-wnt4a. The branch-site model suggested that vertebrate wnt4a differed significantly from that of wnt4b, and that the selective pressures differed between ancestral aquatic and terrestrial organisms. Two positively selected sites were found in the ancestral lineages of teleost fish, but none in the ancestral lineages of mammals. One positively selected site was located on the α-helices of the 3D structure, the other on the random coil. Our results are of value for further study of the function of wnt4 and the mechanism of selection.

Cloning and characterization of wnt4a gene and evidence for positive selection in half-smooth tongue sole (Cynoglossus semilaevis)

NASA Astrophysics Data System (ADS)

Hu, Qiaomu; Zhu, Ying; Liu, Yang; Wang, Na; Chen, Songlin

2014-11-01

Wnt4 gene plays a role in developmental processes in mammals. However, little is known regarding its function in teleosts. We cloned and characterized the full-length half-smooth tongue sole (Cynoglossus semilaevis) wnt4a gene (CS-wnt4a). CS-wnt4a cDNA was 1746 bp in length encoding 353aa. CS-wnt4a expression level was highest in the testis, and gradually increased in the developing gonads until 1 year of age. In situ hybridization revealed that CS-wnt4a expression level was highest in stage II oocytes and sperm in the adult ovary and testis, respectively. CS-wnt4a expression level was significantly up-regulated in the gonads after exposure to high temperature. The level of methylation of the CS-wnt4a first exon was negatively correlated with the expression of CS-wnt4a. The branch-site model suggested that vertebrate wnt4a differed significantly from that of wnt4b, and that the selective pressures differed between ancestral aquatic and terrestrial organisms. Two positively selected sites were found in the ancestral lineages of teleost fish, but none in the ancestral lineages of mammals. One positively selected site was located on the α-helices of the 3D structure, the other on the random coil. Our results are of value for further study of the function of wnt4 and the mechanism of selection.

Interacting particle systems on graphs

NASA Astrophysics Data System (ADS)

Sood, Vishal

In this dissertation, the dynamics of socially or biologically interacting populations are investigated. The individual members of the population are treated as particles that interact via links on a social or biological network represented as a graph. The effect of the structure of the graph on the properties of the interacting particle system is studied using statistical physics techniques. In the first chapter, the central concepts of graph theory and social and biological networks are presented. Next, interacting particle systems that are drawn from physics, mathematics and biology are discussed in the second chapter. In the third chapter, the random walk on a graph is studied. The mean time for a random walk to traverse between two arbitrary sites of a random graph is evaluated. Using an effective medium approximation it is found that the mean first-passage time between pairs of sites, as well as all moments of this first-passage time, are insensitive to the density of links in the graph. The inverse of the mean-first passage time varies non-monotonically with the density of links near the percolation transition of the random graph. Much of the behavior can be understood by simple heuristic arguments. Evolutionary dynamics, by which mutants overspread an otherwise uniform population on heterogeneous graphs, are studied in the fourth chapter. Such a process underlies' epidemic propagation, emergence of fads, social cooperation or invasion of an ecological niche by a new species. The first part of this chapter is devoted to neutral dynamics, in which the mutant genotype does not have a selective advantage over the resident genotype. The time to extinction of one of the two genotypes is derived. In the second part of this chapter, selective advantage or fitness is introduced such that the mutant genotype has a higher birth rate or a lower death rate. This selective advantage leads to a dynamical competition in which selection dominates for large populations, while for small populations the dynamics are similar to the neutral case. The likelihood for the fitter mutants to drive the resident genotype to extinction is calculated.

Strong Selection at MHC in Mexicans since Admixture

PubMed Central

Zhou, Quan; Zhao, Liang; Guan, Yongtao

2016-01-01

Mexicans are a recent admixture of Amerindians, Europeans, and Africans. We performed local ancestry analysis of Mexican samples from two genome-wide association studies obtained from dbGaP, and discovered that at the MHC region Mexicans have excessive African ancestral alleles compared to the rest of the genome, which is the hallmark of recent selection for admixed samples. The estimated selection coefficients are 0.05 and 0.07 for two datasets, which put our finding among the strongest known selections observed in humans, namely, lactase selection in northern Europeans and sickle-cell trait in Africans. Using inaccurate Amerindian training samples was a major concern for the credibility of previously reported selection signals in Latinos. Taking advantage of the flexibility of our statistical model, we devised a model fitting technique that can learn Amerindian ancestral haplotype from the admixed samples, which allows us to infer local ancestries for Mexicans using only European and African training samples. The strong selection signal at the MHC remains without Amerindian training samples. Finally, we note that medical history studies suggest such a strong selection at MHC is plausible in Mexicans. PMID:26863142

A complementary graphical method for reducing and analyzing large data sets. Case studies demonstrating thresholds setting and selection.

PubMed

Jing, X; Cimino, J J

2014-01-01

Graphical displays can make data more understandable; however, large graphs can challenge human comprehension. We have previously described a filtering method to provide high-level summary views of large data sets. In this paper we demonstrate our method for setting and selecting thresholds to limit graph size while retaining important information by applying it to large single and paired data sets, taken from patient and bibliographic databases. Four case studies are used to illustrate our method. The data are either patient discharge diagnoses (coded using the International Classification of Diseases, Clinical Modifications [ICD9-CM]) or Medline citations (coded using the Medical Subject Headings [MeSH]). We use combinations of different thresholds to obtain filtered graphs for detailed analysis. The thresholds setting and selection, such as thresholds for node counts, class counts, ratio values, p values (for diff data sets), and percentiles of selected class count thresholds, are demonstrated with details in case studies. The main steps include: data preparation, data manipulation, computation, and threshold selection and visualization. We also describe the data models for different types of thresholds and the considerations for thresholds selection. The filtered graphs are 1%-3% of the size of the original graphs. For our case studies, the graphs provide 1) the most heavily used ICD9-CM codes, 2) the codes with most patients in a research hospital in 2011, 3) a profile of publications on "heavily represented topics" in MEDLINE in 2011, and 4) validated knowledge about adverse effects of the medication of rosiglitazone and new interesting areas in the ICD9-CM hierarchy associated with patients taking the medication of pioglitazone. Our filtering method reduces large graphs to a manageable size by removing relatively unimportant nodes. The graphical method provides summary views based on computation of usage frequency and semantic context of hierarchical terminology. The method is applicable to large data sets (such as a hundred thousand records or more) and can be used to generate new hypotheses from data sets coded with hierarchical terminologies.

Simultaneous grouping pursuit and feature selection over an undirected graph*

PubMed Central

Zhu, Yunzhang; Shen, Xiaotong; Pan, Wei

2013-01-01

Summary In high-dimensional regression, grouping pursuit and feature selection have their own merits while complementing each other in battling the curse of dimensionality. To seek a parsimonious model, we perform simultaneous grouping pursuit and feature selection over an arbitrary undirected graph with each node corresponding to one predictor. When the corresponding nodes are reachable from each other over the graph, regression coefficients can be grouped, whose absolute values are the same or close. This is motivated from gene network analysis, where genes tend to work in groups according to their biological functionalities. Through a nonconvex penalty, we develop a computational strategy and analyze the proposed method. Theoretical analysis indicates that the proposed method reconstructs the oracle estimator, that is, the unbiased least squares estimator given the true grouping, leading to consistent reconstruction of grouping structures and informative features, as well as to optimal parameter estimation. Simulation studies suggest that the method combines the benefit of grouping pursuit with that of feature selection, and compares favorably against its competitors in selection accuracy and predictive performance. An application to eQTL data is used to illustrate the methodology, where a network is incorporated into analysis through an undirected graph. PMID:24098061

Feature Grouping and Selection Over an Undirected Graph.

PubMed

Yang, Sen; Yuan, Lei; Lai, Ying-Cheng; Shen, Xiaotong; Wonka, Peter; Ye, Jieping

2012-01-01

High-dimensional regression/classification continues to be an important and challenging problem, especially when features are highly correlated. Feature selection, combined with additional structure information on the features has been considered to be promising in promoting regression/classification performance. Graph-guided fused lasso (GFlasso) has recently been proposed to facilitate feature selection and graph structure exploitation, when features exhibit certain graph structures. However, the formulation in GFlasso relies on pairwise sample correlations to perform feature grouping, which could introduce additional estimation bias. In this paper, we propose three new feature grouping and selection methods to resolve this issue. The first method employs a convex function to penalize the pairwise l ∞ norm of connected regression/classification coefficients, achieving simultaneous feature grouping and selection. The second method improves the first one by utilizing a non-convex function to reduce the estimation bias. The third one is the extension of the second method using a truncated l 1 regularization to further reduce the estimation bias. The proposed methods combine feature grouping and feature selection to enhance estimation accuracy. We employ the alternating direction method of multipliers (ADMM) and difference of convex functions (DC) programming to solve the proposed formulations. Our experimental results on synthetic data and two real datasets demonstrate the effectiveness of the proposed methods.

Transformations of Mathematical and Stimulus Functions

PubMed Central

Ninness, Chris; Barnes-Holmes, Dermot; Rumph, Robin; McCuller, Glen; Ford, Angela M; Payne, Robert; Ninness, Sharon K; Smith, Ronald J; Ward, Todd A; Elliott, Marc P

2006-01-01

Following a pretest, 8 participants who were unfamiliar with algebraic and trigonometric functions received a brief presentation on the rectangular coordinate system. Next, they participated in a computer-interactive matching-to-sample procedure that trained formula-to-formula and formula-to-graph relations. Then, they were exposed to 40 novel formula-to-graph tests and 10 novel graph-to-formula tests. Seven of the 8 participants showed substantial improvement in identifying formula-to-graph relations; however, in the test of novel graph-to-formula relations, participants tended to select equations in their factored form. Next, we manipulated contextual cues in the form of rules regarding mathematical preferences. First, we informed participants that standard forms of equations were preferred over factored forms. In a subsequent test of 10 additional novel graph-to-formula relations, participants shifted their selections to favor equations in their standard form. This preference reversed during 10 more tests when financial reward was made contingent on correct identification of formulas in factored form. Formula preferences and transformation of novel mathematical and stimulus functions are discussed. PMID:17020211

Reconstructed ancestral enzymes reveal that negative selection drove the evolution of substrate specificity in ADP-dependent kinases.

PubMed

Castro-Fernandez, Víctor; Herrera-Morande, Alejandra; Zamora, Ricardo; Merino, Felipe; Gonzalez-Ordenes, Felipe; Padilla-Salinas, Felipe; Pereira, Humberto M; Brandão-Neto, Jose; Garratt, Richard C; Guixe, Victoria

2017-09-22

One central goal in molecular evolution is to pinpoint the mechanisms and evolutionary forces that cause an enzyme to change its substrate specificity; however, these processes remain largely unexplored. Using the glycolytic ADP-dependent kinases of archaea, including the orders Thermococcales , Methanosarcinales , and Methanococcales , as a model and employing an approach involving paleoenzymology, evolutionary statistics, and protein structural analysis, we could track changes in substrate specificity during ADP-dependent kinase evolution along with the structural determinants of these changes. To do so, we studied five key resurrected ancestral enzymes as well as their extant counterparts. We found that a major shift in function from a bifunctional ancestor that could phosphorylate either glucose or fructose 6-phosphate (fructose-6-P) as a substrate to a fructose 6-P-specific enzyme was started by a single amino acid substitution resulting in negative selection with a ground-state mode against glucose and a subsequent 1,600-fold change in specificity of the ancestral protein. This change rendered the residual phosphorylation of glucose a promiscuous and physiologically irrelevant activity, highlighting how promiscuity may be an evolutionary vestige of ancestral enzyme activities, which have been eliminated over time. We also could reconstruct the evolutionary history of substrate utilization by using an evolutionary model of discrete binary characters, indicating that substrate uses can be discretely lost or acquired during enzyme evolution. These findings exemplify how negative selection and subtle enzyme changes can lead to major evolutionary shifts in function, which can subsequently generate important adaptive advantages, for example, in improving glycolytic efficiency in Thermococcales . © 2017 by The American Society for Biochemistry and Molecular Biology, Inc.

Understanding of Graphs in Social Science Undergraduate Students: Selection and Interpretation of Graphs

ERIC Educational Resources Information Center

Pérez-Echeverría, Ma. del Puy; Postigo, Yolanda; Marín, Cristina

2018-01-01

How do university students understand the graphs that they read in their textbooks? How does their knowledge regarding the content and their statistical training influence this understanding? Does the kind of task demand also influence this understanding? To answer these questions, we asked a group of psychology students and a group of economics…

Optimal Clustering in Graphs with Weighted Edges: A Unified Approach to the Threshold Problem.

ERIC Educational Resources Information Center

Goetschel, Roy; Voxman, William

1987-01-01

Relations on a finite set V are viewed as weighted graphs. Using the language of graph theory, two methods of partitioning V are examined: selecting threshold values and applying them to a maximal weighted spanning forest, and using a parametric linear program to obtain a most adhesive partition. (Author/EM)

Identification and characterization of cuticular hydrocarbons from a rapid species radiation of Hawaiian swordtailed crickets (Gryllidae: Trigonidiinae: Laupala).

PubMed

Mullen, Sean P; Millar, Jocelyn G; Schal, Coby; Shaw, Kerry L

2008-02-01

A previous investigation of cuticular hydrocarbon variation among Hawaiian swordtail crickets (genus Laupala) revealed that these species differ dramatically in composition of cuticular lipids. Cuticular lipid extracts of Laupala species sampled from the Big Island of Hawaii also possess a greatly reduced number of chemicals (as evidenced by number of gas chromatography peaks) relative to ancestral taxa sampled from the geologically older island of Maui. One possible explanation for this biogeographic pattern is that reduction in chemical diversity observed among the Big Island taxa represents the loss of ancestral hydrocarbons found on Maui. To test this hypothesis, we characterized and identified the structures of cuticular hydrocarbons for seven species of Hawaiian Laupala, two from Maui (ancestral) and five from the Big Island of Hawaii (derived) by using gas chromatography-mass spectrometry. Big Island Laupala possessed a reduced number of alkenes as well as a reduction in the diversity of methyl-branch positions relative to species sampled from Maui (ancestral), thus supporting our hypothesis of a founder-induced loss of chemical diversity. The reduction in diversity of ancestral hydrocarbons was more severe within one of the two sister lineages on the Big Island, suggesting that post-colonizing processes, such as drift or selection, also have influenced hydrocarbon evolution in this group.

Tumble Graphs: Avoiding Misleading End Point Extrapolation When Graphing Interactions From a Moderated Multiple Regression Analysis

ERIC Educational Resources Information Center

Bodner, Todd E.

2016-01-01

This article revisits how the end points of plotted line segments should be selected when graphing interactions involving a continuous target predictor variable. Under the standard approach, end points are chosen at ±1 or 2 standard deviations from the target predictor mean. However, when the target predictor and moderator are correlated or the…

Distributed MPC based consensus for single-integrator multi-agent systems.

PubMed

Cheng, Zhaomeng; Fan, Ming-Can; Zhang, Hai-Tao

2015-09-01

This paper addresses model predictive control schemes for consensus in multi-agent systems (MASs) with discrete-time single-integrator dynamics under switching directed interaction graphs. The control horizon is extended to be greater than one which endows the closed-loop system with extra degree of freedom. We derive sufficient conditions on the sampling period and the interaction graph to achieve consensus by using the property of infinite products of stochastic matrices. Consensus can be achieved asymptotically if the sampling period is selected such that the interaction graph among agents has a directed spanning tree jointly. Significantly, if the interaction graph always has a spanning tree, one can select an arbitrary large sampling period to guarantee consensus. Finally, several simulations are conducted to illustrate the effectiveness of the theoretical results. Copyright © 2015 ISA. Published by Elsevier Ltd. All rights reserved.

Graph reconstruction using covariance-based methods.

PubMed

Sulaimanov, Nurgazy; Koeppl, Heinz

2016-12-01

Methods based on correlation and partial correlation are today employed in the reconstruction of a statistical interaction graph from high-throughput omics data. These dedicated methods work well even for the case when the number of variables exceeds the number of samples. In this study, we investigate how the graphs extracted from covariance and concentration matrix estimates are related by using Neumann series and transitive closure and through discussing concrete small examples. Considering the ideal case where the true graph is available, we also compare correlation and partial correlation methods for large realistic graphs. In particular, we perform the comparisons with optimally selected parameters based on the true underlying graph and with data-driven approaches where the parameters are directly estimated from the data.

Multiple graph regularized protein domain ranking.

PubMed

Wang, Jim Jing-Yan; Bensmail, Halima; Gao, Xin

2012-11-19

Protein domain ranking is a fundamental task in structural biology. Most protein domain ranking methods rely on the pairwise comparison of protein domains while neglecting the global manifold structure of the protein domain database. Recently, graph regularized ranking that exploits the global structure of the graph defined by the pairwise similarities has been proposed. However, the existing graph regularized ranking methods are very sensitive to the choice of the graph model and parameters, and this remains a difficult problem for most of the protein domain ranking methods. To tackle this problem, we have developed the Multiple Graph regularized Ranking algorithm, MultiG-Rank. Instead of using a single graph to regularize the ranking scores, MultiG-Rank approximates the intrinsic manifold of protein domain distribution by combining multiple initial graphs for the regularization. Graph weights are learned with ranking scores jointly and automatically, by alternately minimizing an objective function in an iterative algorithm. Experimental results on a subset of the ASTRAL SCOP protein domain database demonstrate that MultiG-Rank achieves a better ranking performance than single graph regularized ranking methods and pairwise similarity based ranking methods. The problem of graph model and parameter selection in graph regularized protein domain ranking can be solved effectively by combining multiple graphs. This aspect of generalization introduces a new frontier in applying multiple graphs to solving protein domain ranking applications.

Multiple graph regularized protein domain ranking

PubMed Central

2012-01-01

Background Protein domain ranking is a fundamental task in structural biology. Most protein domain ranking methods rely on the pairwise comparison of protein domains while neglecting the global manifold structure of the protein domain database. Recently, graph regularized ranking that exploits the global structure of the graph defined by the pairwise similarities has been proposed. However, the existing graph regularized ranking methods are very sensitive to the choice of the graph model and parameters, and this remains a difficult problem for most of the protein domain ranking methods. Results To tackle this problem, we have developed the Multiple Graph regularized Ranking algorithm, MultiG-Rank. Instead of using a single graph to regularize the ranking scores, MultiG-Rank approximates the intrinsic manifold of protein domain distribution by combining multiple initial graphs for the regularization. Graph weights are learned with ranking scores jointly and automatically, by alternately minimizing an objective function in an iterative algorithm. Experimental results on a subset of the ASTRAL SCOP protein domain database demonstrate that MultiG-Rank achieves a better ranking performance than single graph regularized ranking methods and pairwise similarity based ranking methods. Conclusion The problem of graph model and parameter selection in graph regularized protein domain ranking can be solved effectively by combining multiple graphs. This aspect of generalization introduces a new frontier in applying multiple graphs to solving protein domain ranking applications. PMID:23157331

A simple rule for the evolution of cooperation on graphs and social networks.

PubMed

Ohtsuki, Hisashi; Hauert, Christoph; Lieberman, Erez; Nowak, Martin A

2006-05-25

A fundamental aspect of all biological systems is cooperation. Cooperative interactions are required for many levels of biological organization ranging from single cells to groups of animals. Human society is based to a large extent on mechanisms that promote cooperation. It is well known that in unstructured populations, natural selection favours defectors over cooperators. There is much current interest, however, in studying evolutionary games in structured populations and on graphs. These efforts recognize the fact that who-meets-whom is not random, but determined by spatial relationships or social networks. Here we describe a surprisingly simple rule that is a good approximation for all graphs that we have analysed, including cycles, spatial lattices, random regular graphs, random graphs and scale-free networks: natural selection favours cooperation, if the benefit of the altruistic act, b, divided by the cost, c, exceeds the average number of neighbours, k, which means b/c > k. In this case, cooperation can evolve as a consequence of 'social viscosity' even in the absence of reputation effects or strategic complexity.

Graph theory enables drug repurposing--how a mathematical model can drive the discovery of hidden mechanisms of action.

PubMed

Gramatica, Ruggero; Di Matteo, T; Giorgetti, Stefano; Barbiani, Massimo; Bevec, Dorian; Aste, Tomaso

2014-01-01

We introduce a methodology to efficiently exploit natural-language expressed biomedical knowledge for repurposing existing drugs towards diseases for which they were not initially intended. Leveraging on developments in Computational Linguistics and Graph Theory, a methodology is defined to build a graph representation of knowledge, which is automatically analysed to discover hidden relations between any drug and any disease: these relations are specific paths among the biomedical entities of the graph, representing possible Modes of Action for any given pharmacological compound. We propose a measure for the likeliness of these paths based on a stochastic process on the graph. This measure depends on the abundance of indirect paths between a peptide and a disease, rather than solely on the strength of the shortest path connecting them. We provide real-world examples, showing how the method successfully retrieves known pathophysiological Mode of Action and finds new ones by meaningfully selecting and aggregating contributions from known bio-molecular interactions. Applications of this methodology are presented, and prove the efficacy of the method for selecting drugs as treatment options for rare diseases.

On a programming language for graph algorithms

NASA Technical Reports Server (NTRS)

Rheinboldt, W. C.; Basili, V. R.; Mesztenyi, C. K.

1971-01-01

An algorithmic language, GRAAL, is presented for describing and implementing graph algorithms of the type primarily arising in applications. The language is based on a set algebraic model of graph theory which defines the graph structure in terms of morphisms between certain set algebraic structures over the node set and arc set. GRAAL is modular in the sense that the user specifies which of these mappings are available with any graph. This allows flexibility in the selection of the storage representation for different graph structures. In line with its set theoretic foundation, the language introduces sets as a basic data type and provides for the efficient execution of all set and graph operators. At present, GRAAL is defined as an extension of ALGOL 60 (revised) and its formal description is given as a supplement to the syntactic and semantic definition of ALGOL. Several typical graph algorithms are written in GRAAL to illustrate various features of the language and to show its applicability.

Adaptive Memory: Young Children Show Enhanced Retention of Fitness-Related Information

ERIC Educational Resources Information Center

Aslan, Alp; Bauml, Karl-Heinz T.

2012-01-01

Evolutionary psychologists propose that human cognition evolved through natural selection to solve adaptive problems related to survival and reproduction, with its ultimate function being the enhancement of reproductive fitness. Following this proposal and the evolutionary-developmental view that ancestral selection pressures operated not only on…

Application-Specific Graph Sampling for Frequent Subgraph Mining and Community Detection

DOE Office of Scientific and Technical Information (OSTI.GOV)

Purohit, Sumit; Choudhury, Sutanay; Holder, Lawrence B.

Graph mining is an important data analysis methodology, but struggles as the input graph size increases. The scalability and usability challenges posed by such large graphs make it imperative to sample the input graph and reduce its size. The critical challenge in sampling is to identify the appropriate algorithm to insure the resulting analysis does not suffer heavily from the data reduction. Predicting the expected performance degradation for a given graph and sampling algorithm is also useful. In this paper, we present different sampling approaches for graph mining applications such as Frequent Subgrpah Mining (FSM), and Community Detection (CD). Wemore » explore graph metrics such as PageRank, Triangles, and Diversity to sample a graph and conclude that for heterogeneous graphs Triangles and Diversity perform better than degree based metrics. We also present two new sampling variations for targeted graph mining applications. We present empirical results to show that knowledge of the target application, along with input graph properties can be used to select the best sampling algorithm. We also conclude that performance degradation is an abrupt, rather than gradual phenomena, as the sample size decreases. We present the empirical results to show that the performance degradation follows a logistic function.« less

Knowledge Representation Issues in Semantic Graphs for Relationship Detection

DOE Office of Scientific and Technical Information (OSTI.GOV)

Barthelemy, M; Chow, E; Eliassi-Rad, T

2005-02-02

An important task for Homeland Security is the prediction of threat vulnerabilities, such as through the detection of relationships between seemingly disjoint entities. A structure used for this task is a ''semantic graph'', also known as a ''relational data graph'' or an ''attributed relational graph''. These graphs encode relationships as typed links between a pair of typed nodes. Indeed, semantic graphs are very similar to semantic networks used in AI. The node and link types are related through an ontology graph (also known as a schema). Furthermore, each node has a set of attributes associated with it (e.g., ''age'' maymore » be an attribute of a node of type ''person''). Unfortunately, the selection of types and attributes for both nodes and links depends on human expertise and is somewhat subjective and even arbitrary. This subjectiveness introduces biases into any algorithm that operates on semantic graphs. Here, we raise some knowledge representation issues for semantic graphs and provide some possible solutions using recently developed ideas in the field of complex networks. In particular, we use the concept of transitivity to evaluate the relevance of individual links in the semantic graph for detecting relationships. We also propose new statistical measures for semantic graphs and illustrate these semantic measures on graphs constructed from movies and terrorism data.« less

A Graph Analytic Metric for Mitigating Advanced Persistent Threat

DOE Office of Scientific and Technical Information (OSTI.GOV)

Johnson, John R.; Hogan, Emilie A.

2013-06-04

This paper introduces a novel graph analytic metric that can be used to measure the potential vulnerability of a cyber network to specific types of attacks that use lateral movement and privilege escalation such as the well known Pass The Hash, (PTH). The metric is computed from an oriented subgraph of the underlying cyber network induced by selecting only those edges for which a given property holds between the two vertices of the edge. The metric with respect to a select node on the subgraph is defined as the likelihood that the select node is reachable from another arbitrary nodemore » in the graph. This metric can be calculated dynamically from the authorization and auditing layers during the network security authorization phase and will potentially enable predictive deterrence against attacks such as PTH.« less

Evolutionary games on cycles with strong selection

NASA Astrophysics Data System (ADS)

Altrock, P. M.; Traulsen, A.; Nowak, M. A.

2017-02-01

Evolutionary games on graphs describe how strategic interactions and population structure determine evolutionary success, quantified by the probability that a single mutant takes over a population. Graph structures, compared to the well-mixed case, can act as amplifiers or suppressors of selection by increasing or decreasing the fixation probability of a beneficial mutant. Properties of the associated mean fixation times can be more intricate, especially when selection is strong. The intuition is that fixation of a beneficial mutant happens fast in a dominance game, that fixation takes very long in a coexistence game, and that strong selection eliminates demographic noise. Here we show that these intuitions can be misleading in structured populations. We analyze mean fixation times on the cycle graph under strong frequency-dependent selection for two different microscopic evolutionary update rules (death-birth and birth-death). We establish exact analytical results for fixation times under strong selection and show that there are coexistence games in which fixation occurs in time polynomial in population size. Depending on the underlying game, we observe inherence of demographic noise even under strong selection if the process is driven by random death before selection for birth of an offspring (death-birth update). In contrast, if selection for an offspring occurs before random removal (birth-death update), then strong selection can remove demographic noise almost entirely.

A new algorithm to find fuzzy Hamilton cycle in a fuzzy network using adjacency matrix and minimum vertex degree.

PubMed

Nagoor Gani, A; Latha, S R

2016-01-01

A Hamiltonian cycle in a graph is a cycle that visits each node/vertex exactly once. A graph containing a Hamiltonian cycle is called a Hamiltonian graph. There have been several researches to find the number of Hamiltonian cycles of a Hamilton graph. As the number of vertices and edges grow, it becomes very difficult to keep track of all the different ways through which the vertices are connected. Hence, analysis of large graphs can be efficiently done with the assistance of a computer system that interprets graphs as matrices. And, of course, a good and well written algorithm will expedite the analysis even faster. The most convenient way to quickly test whether there is an edge between two vertices is to represent graphs using adjacent matrices. In this paper, a new algorithm is proposed to find fuzzy Hamiltonian cycle using adjacency matrix and the degree of the vertices of a fuzzy graph. A fuzzy graph structure is also modeled to illustrate the proposed algorithms with the selected air network of Indigo airlines.

Development of a panel of genome-wide ancestry informative markers to study admixture throughout the Americas.

PubMed

Galanter, Joshua Mark; Fernandez-Lopez, Juan Carlos; Gignoux, Christopher R; Barnholtz-Sloan, Jill; Fernandez-Rozadilla, Ceres; Via, Marc; Hidalgo-Miranda, Alfredo; Contreras, Alejandra V; Figueroa, Laura Uribe; Raska, Paola; Jimenez-Sanchez, Gerardo; Zolezzi, Irma Silva; Torres, Maria; Ponte, Clara Ruiz; Ruiz, Yarimar; Salas, Antonio; Nguyen, Elizabeth; Eng, Celeste; Borjas, Lisbeth; Zabala, William; Barreto, Guillermo; González, Fernando Rondón; Ibarra, Adriana; Taboada, Patricia; Porras, Liliana; Moreno, Fabián; Bigham, Abigail; Gutierrez, Gerardo; Brutsaert, Tom; León-Velarde, Fabiola; Moore, Lorna G; Vargas, Enrique; Cruz, Miguel; Escobedo, Jorge; Rodriguez-Santana, José; Rodriguez-Cintrón, William; Chapela, Rocio; Ford, Jean G; Bustamante, Carlos; Seminara, Daniela; Shriver, Mark; Ziv, Elad; Burchard, Esteban Gonzalez; Haile, Robert; Parra, Esteban; Carracedo, Angel

2012-01-01

Most individuals throughout the Americas are admixed descendants of Native American, European, and African ancestors. Complex historical factors have resulted in varying proportions of ancestral contributions between individuals within and among ethnic groups. We developed a panel of 446 ancestry informative markers (AIMs) optimized to estimate ancestral proportions in individuals and populations throughout Latin America. We used genome-wide data from 953 individuals from diverse African, European, and Native American populations to select AIMs optimized for each of the three main continental populations that form the basis of modern Latin American populations. We selected markers on the basis of locus-specific branch length to be informative, well distributed throughout the genome, capable of being genotyped on widely available commercial platforms, and applicable throughout the Americas by minimizing within-continent heterogeneity. We then validated the panel in samples from four admixed populations by comparing ancestry estimates based on the AIMs panel to estimates based on genome-wide association study (GWAS) data. The panel provided balanced discriminatory power among the three ancestral populations and accurate estimates of individual ancestry proportions (R² > 0.9 for ancestral components with significant between-subject variance). Finally, we genotyped samples from 18 populations from Latin America using the AIMs panel and estimated variability in ancestry within and between these populations. This panel and its reference genotype information will be useful resources to explore population history of admixture in Latin America and to correct for the potential effects of population stratification in admixed samples in the region.

Development of a Panel of Genome-Wide Ancestry Informative Markers to Study Admixture Throughout the Americas

PubMed Central

Galanter, Joshua Mark; Fernandez-Lopez, Juan Carlos; Gignoux, Christopher R.; Barnholtz-Sloan, Jill; Fernandez-Rozadilla, Ceres; Via, Marc; Hidalgo-Miranda, Alfredo; Contreras, Alejandra V.; Figueroa, Laura Uribe; Raska, Paola; Jimenez-Sanchez, Gerardo; Silva Zolezzi, Irma; Torres, Maria; Ponte, Clara Ruiz; Ruiz, Yarimar; Salas, Antonio; Nguyen, Elizabeth; Eng, Celeste; Borjas, Lisbeth; Zabala, William; Barreto, Guillermo; Rondón González, Fernando; Ibarra, Adriana; Taboada, Patricia; Porras, Liliana; Moreno, Fabián; Bigham, Abigail; Gutierrez, Gerardo; Brutsaert, Tom; León-Velarde, Fabiola; Moore, Lorna G.; Vargas, Enrique; Cruz, Miguel; Escobedo, Jorge; Rodriguez-Santana, José; Rodriguez-Cintrón, William; Chapela, Rocio; Ford, Jean G.; Bustamante, Carlos; Seminara, Daniela; Shriver, Mark; Ziv, Elad; Gonzalez Burchard, Esteban; Haile, Robert

2012-01-01

Most individuals throughout the Americas are admixed descendants of Native American, European, and African ancestors. Complex historical factors have resulted in varying proportions of ancestral contributions between individuals within and among ethnic groups. We developed a panel of 446 ancestry informative markers (AIMs) optimized to estimate ancestral proportions in individuals and populations throughout Latin America. We used genome-wide data from 953 individuals from diverse African, European, and Native American populations to select AIMs optimized for each of the three main continental populations that form the basis of modern Latin American populations. We selected markers on the basis of locus-specific branch length to be informative, well distributed throughout the genome, capable of being genotyped on widely available commercial platforms, and applicable throughout the Americas by minimizing within-continent heterogeneity. We then validated the panel in samples from four admixed populations by comparing ancestry estimates based on the AIMs panel to estimates based on genome-wide association study (GWAS) data. The panel provided balanced discriminatory power among the three ancestral populations and accurate estimates of individual ancestry proportions (R2>0.9 for ancestral components with significant between-subject variance). Finally, we genotyped samples from 18 populations from Latin America using the AIMs panel and estimated variability in ancestry within and between these populations. This panel and its reference genotype information will be useful resources to explore population history of admixture in Latin America and to correct for the potential effects of population stratification in admixed samples in the region. PMID:22412386

Measuring Academic Progress of Students with Learning Difficulties: A Comparison of the Semi-Logarithmic Chart and Equal Interval Graph Paper.

ERIC Educational Resources Information Center

Marston, Doug; Deno, Stanley L.

The accuracy of predictions of future student performance on the basis of graphing data on semi-logarithmic charts and equal interval graphs was examined. All 83 low-achieving students in grades 3 to 6 read randomly-selected lists of words from the Harris-Jacobson Word List for 1 minute. The number of words read correctly and words read…

SELECTION ON LEAF ECOPHYSIOLOGICAL TRAITS IN A DESERT HYBRID HELIANTHUS SPECIES AND EARLY-GENERATION HYBRIDS

PubMed Central

Ludwig, Fulco; Rosenthal, David M.; Johnston, Jill A.; Kane, Nolan; Gross, Briana L.; Lexer, Christian; Dudley, Susan A.; Rieseberg, Loren H.; Donovan, Lisa A.

2008-01-01

Leaf ecophysiological traits related to carbon gain and resource use are expected to be under strong selection in desert annuals. We used comparative and phenotypic selection approaches to investigate the importance of leaf ecophysiological traits for Helianthus anomalus, a diploid annual sunflower species of hybrid origin that is endemic to active desert dunes. Comparisons were made within and among five genotypic classes: H. anomalus, its ancestral parent species (H. annuus and H. petiolaris), and two backcrossed populations of the parental species (designated BC2ann and BC2pet) representing putative ancestors of H. anomalus. Seedlings were transplanted into H. anomalus habitat at Little Sahara Dunes, Utah, and followed through a summer growing season for leaf ecophysiological traits, phenology, and fitness estimated as vegetative biomass. Helianthus anomalus had a unique combination of traits when compared to its ancestral parent species, suggesting that lower leaf nitrogen and greater leaf succulence might be adaptive. However, selection on leaf traits in H. anomalus favored larger leaf area and greater nitrogen, which was not consistent with the extreme traits of H. anomalus relative to its ancestral parents. Also contrary to expectation, current selection on the leaf traits in the backcross populations was not consistently similar to, or resulting in evolution toward, the current H. anomalus phenotype. Only the selection for greater leaf succulence in BC2ann and greater water-use efficiency in BC2pet would result in evolution toward the current H. anomalus phenotype. It was surprising that the action of phenotypic selection depended greatly on the genotypic class for these closely related sunflower hybrids grown in a common environment. We speculate that this may be due to either phenotypic correlations between measured and unmeasured but functionally related traits or due to the three genotypic classes experiencing the environment differently as a result of their differing morphology. PMID:15696747

Modeling surgical tool selection patterns as a "traveling salesman problem" for optimizing a modular surgical tool system.

PubMed

Nelson, Carl A; Miller, David J; Oleynikov, Dmitry

2008-01-01

As modular systems come into the forefront of robotic telesurgery, streamlining the process of selecting surgical tools becomes an important consideration. This paper presents a method for optimal queuing of tools in modular surgical tool systems, based on patterns in tool-use sequences, in order to minimize time spent changing tools. The solution approach is to model the set of tools as a graph, with tool-change frequency expressed as edge weights in the graph, and to solve the Traveling Salesman Problem for the graph. In a set of simulations, this method has shown superior performance at optimizing tool arrangements for streamlining surgical procedures.

The Dynamics of Germinal Centre Selection as Measured by Graph-Theoretical Analysis of Mutational Lineage Trees

PubMed Central

Dunn-Walters, Deborah K.; Belelovsky, Alex; Edelman, Hanna; Banerjee, Monica; Mehr, Ramit

2002-01-01

We have developed a rigorous graph-theoretical algorithm for quantifying the shape properties of mutational lineage trees. We show that information about the dynamics of hypermutation and antigen-driven clonal selection during the humoral immune response is contained in the shape of mutational lineage trees deduced from the responding clones. Age and tissue related differences in the selection process can be studied using this method. Thus, tree shape analysis can be used as a means of elucidating humoral immune response dynamics in various situations. PMID:15144020

JavaGenes: Evolving Graphs with Crossover

NASA Technical Reports Server (NTRS)

Globus, Al; Atsatt, Sean; Lawton, John; Wipke, Todd

2000-01-01

Genetic algorithms usually use string or tree representations. We have developed a novel crossover operator for a directed and undirected graph representation, and used this operator to evolve molecules and circuits. Unlike strings or trees, a single point in the representation cannot divide every possible graph into two parts, because graphs may contain cycles. Thus, the crossover operator is non-trivial. A steady-state, tournament selection genetic algorithm code (JavaGenes) was written to implement and test the graph crossover operator. All runs were executed by cycle-scavagging on networked workstations using the Condor batch processing system. The JavaGenes code has evolved pharmaceutical drug molecules and simple digital circuits. Results to date suggest that JavaGenes can evolve moderate sized drug molecules and very small circuits in reasonable time. The algorithm has greater difficulty with somewhat larger circuits, suggesting that directed graphs (circuits) are more difficult to evolve than undirected graphs (molecules), although necessary differences in the crossover operator may also explain the results. In principle, JavaGenes should be able to evolve other graph-representable systems, such as transportation networks, metabolic pathways, and computer networks. However, large graphs evolve significantly slower than smaller graphs, presumably because the space-of-all-graphs explodes combinatorially with graph size. Since the representation strongly affects genetic algorithm performance, adding graphs to the evolutionary programmer's bag-of-tricks should be beneficial. Also, since graph evolution operates directly on the phenotype, the genotype-phenotype translation step, common in genetic algorithm work, is eliminated.

Scenario driven data modelling: a method for integrating diverse sources of data and data streams

DOEpatents

Brettin, Thomas S.; Cottingham, Robert W.; Griffith, Shelton D.; Quest, Daniel J.

2015-09-08

A system and method of integrating diverse sources of data and data streams is presented. The method can include selecting a scenario based on a topic, creating a multi-relational directed graph based on the scenario, identifying and converting resources in accordance with the scenario and updating the multi-directed graph based on the resources, identifying data feeds in accordance with the scenario and updating the multi-directed graph based on the data feeds, identifying analytical routines in accordance with the scenario and updating the multi-directed graph using the analytical routines and identifying data outputs in accordance with the scenario and defining queries to produce the data outputs from the multi-directed graph.

Selection for predation, not female fecundity, explains sexual size dimorphism in the orchid mantises.

PubMed

Svenson, Gavin J; Brannoch, Sydney K; Rodrigues, Henrique M; O'Hanlon, James C; Wieland, Frank

2016-12-01

Here we reconstruct the evolutionary shift towards floral simulation in orchid mantises and suggest female predatory selection as the likely driving force behind the development of extreme sexual size dimorphism. Through analysis of body size data and phylogenetic modelling of trait evolution, we recovered an ancestral shift towards sexual dimorphisms in both size and appearance in a lineage of flower-associated praying mantises. Sedentary female flower mantises dramatically increased in size prior to a transition from camouflaged, ambush predation to a floral simulation strategy, gaining access to, and visually attracting, a novel resource: large pollinating insects. Male flower mantises, however, remained small and mobile to facilitate mate-finding and reproductive success, consistent with ancestral male life strategy. Although moderate sexual size dimorphisms are common in many arthropod lineages, the predominant explanation is female size increase for increased fecundity. However, sex-dependent selective pressures acting outside of female fecundity have been suggested as mechanisms behind niche dimorphisms. Our hypothesised role of predatory selection acting on females to generate both extreme sexual size dimorphism coupled with niche dimorphism is novel among arthropods.

Selection for predation, not female fecundity, explains sexual size dimorphism in the orchid mantises

PubMed Central

Svenson, Gavin J.; Brannoch, Sydney K.; Rodrigues, Henrique M.; O’Hanlon, James C.; Wieland, Frank

2016-01-01

Here we reconstruct the evolutionary shift towards floral simulation in orchid mantises and suggest female predatory selection as the likely driving force behind the development of extreme sexual size dimorphism. Through analysis of body size data and phylogenetic modelling of trait evolution, we recovered an ancestral shift towards sexual dimorphisms in both size and appearance in a lineage of flower-associated praying mantises. Sedentary female flower mantises dramatically increased in size prior to a transition from camouflaged, ambush predation to a floral simulation strategy, gaining access to, and visually attracting, a novel resource: large pollinating insects. Male flower mantises, however, remained small and mobile to facilitate mate-finding and reproductive success, consistent with ancestral male life strategy. Although moderate sexual size dimorphisms are common in many arthropod lineages, the predominant explanation is female size increase for increased fecundity. However, sex-dependent selective pressures acting outside of female fecundity have been suggested as mechanisms behind niche dimorphisms. Our hypothesised role of predatory selection acting on females to generate both extreme sexual size dimorphism coupled with niche dimorphism is novel among arthropods. PMID:27905469

Biogeographic history and high-elevation adaptations inferred from the mitochondrial genome of Glyptosternoid fishes (Sisoridae, Siluriformes) from the southeastern Tibetan Plateau.

PubMed

Ma, Xiuhui; Kang, Jingliang; Chen, Weitao; Zhou, Chuanjiang; He, Shunping

2015-10-28

The distribution of the Chinese Glyptosternoid catfish is limited to the rivers of the Tibetan Plateau and peripheral regions, especially the drainage areas of southeastern Tibet. Therefore, Glyptosternoid fishes are ideal for reconstructing the geological history of the southeastern Tibet drainage patterns and mitochondrial genetic adaptions to high elevations. Our phylogenetic results support the monophyly of the Sisoridae and the Glyptosternoid fishes. The reconstructed ancestral geographical distribution suggests that the ancestral Glyptosternoids was widely distributed throughout the Brahmaputra drainage in the eastern Himalayas and Tibetan area during the Late Miocene (c. 5.5 Ma). We found that the Glyptosternoid fishes lineage had a higher ratio of nonsynonymous to synonymous substitutions than those found in non-Glyptosternoids. In addition, ωpss was estimated to be 10.73, which is significantly higher than 1 (p-value 0.0002), in COX1, which indicates positive selection in the common ancestral branch of Glyptosternoid fishes in China. We also found other signatures of positive selection in the branch of specialized species. These results imply mitochondrial genetic adaptation to high elevations in the Glyptosternoids. We reconstructed a possible scenario for the southeastern Tibetan drainage patterns based on the adaptive geographical distribution of the Chinese Glyptosternoids in this drainage. The Glyptosternoids may have experienced accelerated evolutionary rates in mitochondrial genes that were driven by positive selection to better adapt to the high-elevation environment of the Tibetan Plateau.

Distortions in memory for visual displays

NASA Technical Reports Server (NTRS)

Tversky, Barbara

1989-01-01

Systematic errors in perception and memory present a challenge to theories of perception and memory and to applied psychologists interested in overcoming them as well. A number of systematic errors in memory for maps and graphs are reviewed, and they are accounted for by an analysis of the perceptual processing presumed to occur in comprehension of maps and graphs. Visual stimuli, like verbal stimuli, are organized in comprehension and memory. For visual stimuli, the organization is a consequence of perceptual processing, which is bottom-up or data-driven in its earlier stages, but top-down and affected by conceptual knowledge later on. Segregation of figure from ground is an early process, and figure recognition later; for both, symmetry is a rapidly detected and ecologically valid cue. Once isolated, figures are organized relative to one another and relative to a frame of reference. Both perceptual (e.g., salience) and conceptual factors (e.g., significance) seem likely to affect selection of a reference frame. Consistent with the analysis, subjects perceived and remembered curves in graphs and rivers in maps as more symmetric than they actually were. Symmetry, useful for detecting and recognizing figures, distorts map and graph figures alike. Top-down processes also seem to operate in that calling attention to the symmetry vs. asymmetry of a slightly asymmetric curve yielded memory errors in the direction of the description. Conceptual frame of reference effects were demonstrated in memory for lines embedded in graphs. In earlier work, the orientation of map figures was distorted in memory toward horizontal or vertical. In recent work, graph lines, but not map lines, were remembered as closer to an imaginary 45 deg line than they had been. Reference frames are determined by both perceptual and conceptual factors, leading to selection of the canonical axes as a reference frame in maps, but selection of the imaginary 45 deg as a reference frame in graphs.

Graph-Based Object Class Discovery

NASA Astrophysics Data System (ADS)

Xia, Shengping; Hancock, Edwin R.

We are interested in the problem of discovering the set of object classes present in a database of images using a weakly supervised graph-based framework. Rather than making use of the ”Bag-of-Features (BoF)” approach widely used in current work on object recognition, we represent each image by a graph using a group of selected local invariant features. Using local feature matching and iterative Procrustes alignment, we perform graph matching and compute a similarity measure. Borrowing the idea of query expansion , we develop a similarity propagation based graph clustering (SPGC) method. Using this method class specific clusters of the graphs can be obtained. Such a cluster can be generally represented by using a higher level graph model whose vertices are the clustered graphs, and the edge weights are determined by the pairwise similarity measure. Experiments are performed on a dataset, in which the number of images increases from 1 to 50K and the number of objects increases from 1 to over 500. Some objects have been discovered with total recall and a precision 1 in a single cluster.

Scalariform-to-simple transition in vessel perforation plates triggered by differences in climate during the evolution of Adoxaceae

PubMed Central

Lens, Frederic; Vos, Rutger A.; Charrier, Guillaume; van der Niet, Timo; Merckx, Vincent; Baas, Pieter; Aguirre Gutierrez, Jesus; Jacobs, Bart; Chacon Dória, Larissa; Smets, Erik; Delzon, Sylvain; Janssens, Steven B.

2016-01-01

Background and Aims Angiosperms with simple vessel perforations have evolved many times independently of species having scalariform perforations, but detailed studies to understand why these transitions in wood evolution have happened are lacking. We focus on the striking difference in wood anatomy between two closely related genera of Adoxaceae, Viburnum and Sambucus, and link the anatomical divergence with climatic and physiological insights. Methods After performing wood anatomical observations, we used a molecular phylogenetic framework to estimate divergence times for 127 Adoxaceae species. The conditions under which the genera diversified were estimated using ancestral area reconstruction and optimization of ancestral climates, and xylem-specific conductivity measurements were performed. Key Results Viburnum, characterized by scalariform vessel perforations (ancestral), diversified earlier than Sambucus, having simple perforations (derived). Ancestral climate reconstruction analyses point to cold temperate preference for Viburnum and warm temperate for Sambucus. This is reflected in the xylem-specific conductivity rates of the co-occurring species investigated, showing that Viburnum lantana has rates much lower than Sambucus nigra. Conclusions The lack of selective pressure for high conductive efficiency during early diversification of Viburnum and the potentially adaptive value of scalariform perforations in frost-prone cold temperate climates have led to retention of the ancestral vessel perforation type, while higher temperatures during early diversification of Sambucus have triggered the evolution of simple vessel perforations, allowing more efficient long-distance water transport. PMID:27498812

Postcopulatory sexual selection influences baculum evolution in primates and carnivores.

PubMed

Brindle, Matilda; Opie, Christopher

2016-12-14

The extreme morphological variability of the baculum across mammals is thought to be the result of sexual selection (particularly, high levels of postcopulatory selection). However, the evolutionary trajectory of the mammalian baculum is little studied and evidence for the adaptive function of the baculum has so far been elusive. Here, we use Markov chain Monte Carlo methods implemented in a Bayesian phylogenetic framework to reconstruct baculum evolution across the mammalian class and investigate the rate of baculum length evolution within the primate order. We then test the effects of testes mass (postcopulatory sexual selection), polygamy, seasonal breeding and intromission duration on the baculum in primates and carnivores. The ancestral mammal did not have a baculum, but both ancestral primates and carnivores did. No relationship was found between testes mass and baculum length in either primates or carnivores. Intromission duration correlated with baculum presence over the course of primate evolution, and prolonged intromission predicts significantly longer bacula in extant primates and carnivores. Both polygamous and seasonal breeding systems predict significantly longer bacula in primates. These results suggest the baculum plays an important role in facilitating reproductive strategies in populations with high levels of postcopulatory sexual selection. © 2016 The Authors.

Postcopulatory sexual selection influences baculum evolution in primates and carnivores

PubMed Central

Brindle, Matilda

2016-01-01

The extreme morphological variability of the baculum across mammals is thought to be the result of sexual selection (particularly, high levels of postcopulatory selection). However, the evolutionary trajectory of the mammalian baculum is little studied and evidence for the adaptive function of the baculum has so far been elusive. Here, we use Markov chain Monte Carlo methods implemented in a Bayesian phylogenetic framework to reconstruct baculum evolution across the mammalian class and investigate the rate of baculum length evolution within the primate order. We then test the effects of testes mass (postcopulatory sexual selection), polygamy, seasonal breeding and intromission duration on the baculum in primates and carnivores. The ancestral mammal did not have a baculum, but both ancestral primates and carnivores did. No relationship was found between testes mass and baculum length in either primates or carnivores. Intromission duration correlated with baculum presence over the course of primate evolution, and prolonged intromission predicts significantly longer bacula in extant primates and carnivores. Both polygamous and seasonal breeding systems predict significantly longer bacula in primates. These results suggest the baculum plays an important role in facilitating reproductive strategies in populations with high levels of postcopulatory sexual selection. PMID:27974519

A software tool for dataflow graph scheduling

NASA Technical Reports Server (NTRS)

Jones, Robert L., III

1994-01-01

A graph-theoretic design process and software tool is presented for selecting a multiprocessing scheduling solution for a class of computational problems. The problems of interest are those that can be described using a dataflow graph and are intended to be executed repetitively on multiple processors. The dataflow paradigm is very useful in exposing the parallelism inherent in algorithms. It provides a graphical and mathematical model which describes a partial ordering of algorithm tasks based on data precedence.

Bipartite graphs as models of population structures in evolutionary multiplayer games.

PubMed

Peña, Jorge; Rochat, Yannick

2012-01-01

By combining evolutionary game theory and graph theory, "games on graphs" study the evolutionary dynamics of frequency-dependent selection in population structures modeled as geographical or social networks. Networks are usually represented by means of unipartite graphs, and social interactions by two-person games such as the famous prisoner's dilemma. Unipartite graphs have also been used for modeling interactions going beyond pairwise interactions. In this paper, we argue that bipartite graphs are a better alternative to unipartite graphs for describing population structures in evolutionary multiplayer games. To illustrate this point, we make use of bipartite graphs to investigate, by means of computer simulations, the evolution of cooperation under the conventional and the distributed N-person prisoner's dilemma. We show that several implicit assumptions arising from the standard approach based on unipartite graphs (such as the definition of replacement neighborhoods, the intertwining of individual and group diversity, and the large overlap of interaction neighborhoods) can have a large impact on the resulting evolutionary dynamics. Our work provides a clear example of the importance of construction procedures in games on graphs, of the suitability of bigraphs and hypergraphs for computational modeling, and of the importance of concepts from social network analysis such as centrality, centralization and bipartite clustering for the understanding of dynamical processes occurring on networked population structures.

Variable number of tandem repeat polymorphisms of DRD4: re-evaluation of selection hypothesis and analysis of association with schizophrenia

PubMed Central

Hattori, Eiji; Nakajima, Mizuho; Yamada, Kazuo; Iwayama, Yoshimi; Toyota, Tomoko; Saitou, Naruya; Yoshikawa, Takeo

2009-01-01

Associations have been reported between the variable number of tandem repeat (VNTR) polymorphisms in the exon 3 of dopamine D4 receptor gene gene and multiple psychiatric illnesses/traits. We examined the distribution of VNTR alleles of different length in a Japanese cohort and found that, as reported earlier, the size of allele ‘7R' was much rarer (0.5%) in Japanese than in Caucasian populations (∼20%). This presents a challenge to an earlier proposed hypothesis that positive selection favoring the allele 7R has contributed to its high frequency. To further address the issue of selection, we carried out sequencing of the VNTR region not only from human but also from chimpanzee samples, and made inference on the ancestral repeat motif and haplotype by use of a phylogenetic analysis program. The most common 4R variant was considered to be the ancestral haplotype as earlier proposed. However, in a gene tree of VNTR constructed on the basis of this inferred ancestral haplotype, the allele 7R had five descendent haplotypes in relatively long lineage, where genetic drift can have major influence. We also tested this length polymorphism for association with schizophrenia, studying two Japanese sample sets (one with 570 cases and 570 controls, and the other with 124 pedigrees). No evidence of association between the allele 7R and schizophrenia was found in any of the two data sets. Collectively, this study suggests that the VNTR variation does not have an effect large enough to cause either selection or a detectable association with schizophrenia in a study of samples of moderate size. PMID:19092778

Integer sequence discovery from small graphs

PubMed Central

Hoppe, Travis; Petrone, Anna

2015-01-01

We have exhaustively enumerated all simple, connected graphs of a finite order and have computed a selection of invariants over this set. Integer sequences were constructed from these invariants and checked against the Online Encyclopedia of Integer Sequences (OEIS). 141 new sequences were added and six sequences were extended. From the graph database, we were able to programmatically suggest relationships among the invariants. It will be shown that we can readily visualize any sequence of graphs with a given criteria. The code has been released as an open-source framework for further analysis and the database was constructed to be extensible to invariants not considered in this work. PMID:27034526

Comparative genomics meets topology: a novel view on genome median and halving problems.

PubMed

Alexeev, Nikita; Avdeyev, Pavel; Alekseyev, Max A

2016-11-11

Genome median and genome halving are combinatorial optimization problems that aim at reconstruction of ancestral genomes by minimizing the number of evolutionary events between them and genomes of the extant species. While these problems have been widely studied in past decades, their solutions are often either not efficient or not biologically adequate. These shortcomings have been recently addressed by restricting the problems solution space. We show that the restricted variants of genome median and halving problems are, in fact, closely related. We demonstrate that these problems have a neat topological interpretation in terms of embedded graphs and polygon gluings. We illustrate how such interpretation can lead to solutions to these problems in particular cases. This study provides an unexpected link between comparative genomics and topology, and demonstrates advantages of solving genome median and halving problems within the topological framework.

Chemical graphs, molecular matrices and topological indices in chemoinformatics and quantitative structure-activity relationships.

PubMed

Ivanciuc, Ovidiu

2013-06-01

Chemical and molecular graphs have fundamental applications in chemoinformatics, quantitative structureproperty relationships (QSPR), quantitative structure-activity relationships (QSAR), virtual screening of chemical libraries, and computational drug design. Chemoinformatics applications of graphs include chemical structure representation and coding, database search and retrieval, and physicochemical property prediction. QSPR, QSAR and virtual screening are based on the structure-property principle, which states that the physicochemical and biological properties of chemical compounds can be predicted from their chemical structure. Such structure-property correlations are usually developed from topological indices and fingerprints computed from the molecular graph and from molecular descriptors computed from the three-dimensional chemical structure. We present here a selection of the most important graph descriptors and topological indices, including molecular matrices, graph spectra, spectral moments, graph polynomials, and vertex topological indices. These graph descriptors are used to define several topological indices based on molecular connectivity, graph distance, reciprocal distance, distance-degree, distance-valency, spectra, polynomials, and information theory concepts. The molecular descriptors and topological indices can be developed with a more general approach, based on molecular graph operators, which define a family of graph indices related by a common formula. Graph descriptors and topological indices for molecules containing heteroatoms and multiple bonds are computed with weighting schemes based on atomic properties, such as the atomic number, covalent radius, or electronegativity. The correlation in QSPR and QSAR models can be improved by optimizing some parameters in the formula of topological indices, as demonstrated for structural descriptors based on atomic connectivity and graph distance.

Computational analysis and functional expression of ancestral copepod luciferase.

PubMed

Takenaka, Yasuhiro; Noda-Ogura, Akiko; Imanishi, Tadashi; Yamaguchi, Atsushi; Gojobori, Takashi; Shigeri, Yasushi

2013-10-10

We recently reported the cDNA sequences of 11 copepod luciferases from the superfamily Augaptiloidea in the order Calanoida. They were classified into two groups, Metridinidae and Heterorhabdidae/Lucicutiidae families, by phylogenetic analyses. To elucidate the evolutionary processes, we have now further isolated 12 copepod luciferases from Augaptiloidea species (Metridia asymmetrica, Metridia curticauda, Pleuromamma scutullata, Pleuromamma xiphias, Lucicutia ovaliformis and Heterorhabdus tanneri). Codon-based synonymous/nonsynonymous tests of positive selection for 25 identified copepod luciferases suggested that positive Darwinian selection operated in the evolution of Heterorhabdidae luciferases, whereas two types of Metridinidae luciferases had diversified via neutral mechanism. By in silico analysis of the decoded amino acid sequences of 25 copepod luciferases, we inferred two protein sequences as ancestral copepod luciferases. They were expressed in HEK293 cells where they exhibited notable luciferase activity both in intracellular lysates and cultured media, indicating that the luciferase activity was established before evolutionary diversification of these copepod species. © 2013.

Annotation Graphs: A Graph-Based Visualization for Meta-Analysis of Data Based on User-Authored Annotations.

PubMed

Zhao, Jian; Glueck, Michael; Breslav, Simon; Chevalier, Fanny; Khan, Azam

2017-01-01

User-authored annotations of data can support analysts in the activity of hypothesis generation and sensemaking, where it is not only critical to document key observations, but also to communicate insights between analysts. We present annotation graphs, a dynamic graph visualization that enables meta-analysis of data based on user-authored annotations. The annotation graph topology encodes annotation semantics, which describe the content of and relations between data selections, comments, and tags. We present a mixed-initiative approach to graph layout that integrates an analyst's manual manipulations with an automatic method based on similarity inferred from the annotation semantics. Various visual graph layout styles reveal different perspectives on the annotation semantics. Annotation graphs are implemented within C8, a system that supports authoring annotations during exploratory analysis of a dataset. We apply principles of Exploratory Sequential Data Analysis (ESDA) in designing C8, and further link these to an existing task typology in the visualization literature. We develop and evaluate the system through an iterative user-centered design process with three experts, situated in the domain of analyzing HCI experiment data. The results suggest that annotation graphs are effective as a method of visually extending user-authored annotations to data meta-analysis for discovery and organization of ideas.

Evolutionary Games of Multiplayer Cooperation on Graphs

PubMed Central

Arranz, Jordi; Traulsen, Arne

2016-01-01

There has been much interest in studying evolutionary games in structured populations, often modeled as graphs. However, most analytical results so far have only been obtained for two-player or linear games, while the study of more complex multiplayer games has been usually tackled by computer simulations. Here we investigate evolutionary multiplayer games on graphs updated with a Moran death-Birth process. For cycles, we obtain an exact analytical condition for cooperation to be favored by natural selection, given in terms of the payoffs of the game and a set of structure coefficients. For regular graphs of degree three and larger, we estimate this condition using a combination of pair approximation and diffusion approximation. For a large class of cooperation games, our approximations suggest that graph-structured populations are stronger promoters of cooperation than populations lacking spatial structure. Computer simulations validate our analytical approximations for random regular graphs and cycles, but show systematic differences for graphs with many loops such as lattices. In particular, our simulation results show that these kinds of graphs can even lead to more stringent conditions for the evolution of cooperation than well-mixed populations. Overall, we provide evidence suggesting that the complexity arising from many-player interactions and spatial structure can be captured by pair approximation in the case of random graphs, but that it need to be handled with care for graphs with high clustering. PMID:27513946

A graph algebra for scalable visual analytics.

PubMed

Shaverdian, Anna A; Zhou, Hao; Michailidis, George; Jagadish, Hosagrahar V

2012-01-01

Visual analytics (VA), which combines analytical techniques with advanced visualization features, is fast becoming a standard tool for extracting information from graph data. Researchers have developed many tools for this purpose, suggesting a need for formal methods to guide these tools' creation. Increased data demands on computing requires redesigning VA tools to consider performance and reliability in the context of analysis of exascale datasets. Furthermore, visual analysts need a way to document their analyses for reuse and results justification. A VA graph framework encapsulated in a graph algebra helps address these needs. Its atomic operators include selection and aggregation. The framework employs a visual operator and supports dynamic attributes of data to enable scalable visual exploration of data.

Semantic Drift in Espresso-style Bootstrapping: Graph-theoretic Analysis and Evaluation in Word Sense Disambiguation

NASA Astrophysics Data System (ADS)

Komachi, Mamoru; Kudo, Taku; Shimbo, Masashi; Matsumoto, Yuji

Bootstrapping has a tendency, called semantic drift, to select instances unrelated to the seed instances as the iteration proceeds. We demonstrate the semantic drift of Espresso-style bootstrapping has the same root as the topic drift of Kleinberg's HITS, using a simplified graph-based reformulation of bootstrapping. We confirm that two graph-based algorithms, the von Neumann kernels and the regularized Laplacian, can reduce the effect of semantic drift in the task of word sense disambiguation (WSD) on Senseval-3 English Lexical Sample Task. Proposed algorithms achieve superior performance to Espresso and previous graph-based WSD methods, even though the proposed algorithms have less parameters and are easy to calibrate.

Identifying patients with Alzheimer's disease using resting-state fMRI and graph theory.

PubMed

Khazaee, Ali; Ebrahimzadeh, Ata; Babajani-Feremi, Abbas

2015-11-01

Study of brain network on the basis of resting-state functional magnetic resonance imaging (fMRI) has provided promising results to investigate changes in connectivity among different brain regions because of diseases. Graph theory can efficiently characterize different aspects of the brain network by calculating measures of integration and segregation. In this study, we combine graph theoretical approaches with advanced machine learning methods to study functional brain network alteration in patients with Alzheimer's disease (AD). Support vector machine (SVM) was used to explore the ability of graph measures in diagnosis of AD. We applied our method on the resting-state fMRI data of twenty patients with AD and twenty age and gender matched healthy subjects. The data were preprocessed and each subject's graph was constructed by parcellation of the whole brain into 90 distinct regions using the automated anatomical labeling (AAL) atlas. The graph measures were then calculated and used as the discriminating features. Extracted network-based features were fed to different feature selection algorithms to choose most significant features. In addition to the machine learning approach, statistical analysis was performed on connectivity matrices to find altered connectivity patterns in patients with AD. Using the selected features, we were able to accurately classify patients with AD from healthy subjects with accuracy of 100%. Results of this study show that pattern recognition and graph of brain network, on the basis of the resting state fMRI data, can efficiently assist in the diagnosis of AD. Classification based on the resting-state fMRI can be used as a non-invasive and automatic tool to diagnosis of Alzheimer's disease. Copyright © 2015 International Federation of Clinical Neurophysiology. All rights reserved.

A Graph Summarization Algorithm Based on RFID Logistics

NASA Astrophysics Data System (ADS)

Sun, Yan; Hu, Kongfa; Lu, Zhipeng; Zhao, Li; Chen, Ling

Radio Frequency Identification (RFID) applications are set to play an essential role in object tracking and supply chain management systems. The volume of data generated by a typical RFID application will be enormous as each item will generate a complete history of all the individual locations that it occupied at every point in time. The movement trails of such RFID data form gigantic commodity flowgraph representing the locations and durations of the path stages traversed by each item. In this paper, we use graph to construct a warehouse of RFID commodity flows, and introduce a database-style operation to summarize graphs, which produces a summary graph by grouping nodes based on user-selected node attributes, further allows users to control the hierarchy of summaries. It can cut down the size of graphs, and provide convenience for users to study just on the shrunk graph which they interested. Through extensive experiments, we demonstrate the effectiveness and efficiency of the proposed method.

Contact Graph Routing Enhancements Developed in ION for DTN

NASA Technical Reports Server (NTRS)

Segui, John S.; Burleigh, Scott

2013-01-01

The Interplanetary Overlay Network (ION) software suite is an open-source, flight-ready implementation of networking protocols including the Delay/Disruption Tolerant Networking (DTN) Bundle Protocol (BP), the CCSDS (Consultative Committee for Space Data Systems) File Delivery Protocol (CFDP), and many others including the Contact Graph Routing (CGR) DTN routing system. While DTN offers the capability to tolerate disruption and long signal propagation delays in transmission, without an appropriate routing protocol, no data can be delivered. CGR was built for space exploration networks with scheduled communication opportunities (typically based on trajectories and orbits), represented as a contact graph. Since CGR uses knowledge of future connectivity, the contact graph can grow rather large, and so efficient processing is desired. These enhancements allow CGR to scale to predicted NASA space network complexities and beyond. This software improves upon CGR by adopting an earliest-arrival-time cost metric and using the Dijkstra path selection algorithm. Moving to Dijkstra path selection also enables construction of an earliest- arrival-time tree for multicast routing. The enhancements have been rolled into ION 3.0 available on sourceforge.net.

A Graph Theory Practice on Transformed Image: A Random Image Steganography

PubMed Central

Thanikaiselvan, V.; Arulmozhivarman, P.; Subashanthini, S.; Amirtharajan, Rengarajan

2013-01-01

Modern day information age is enriched with the advanced network communication expertise but unfortunately at the same time encounters infinite security issues when dealing with secret and/or private information. The storage and transmission of the secret information become highly essential and have led to a deluge of research in this field. In this paper, an optimistic effort has been taken to combine graceful graph along with integer wavelet transform (IWT) to implement random image steganography for secure communication. The implementation part begins with the conversion of cover image into wavelet coefficients through IWT and is followed by embedding secret image in the randomly selected coefficients through graph theory. Finally stegoimage is obtained by applying inverse IWT. This method provides a maximum of 44 dB peak signal to noise ratio (PSNR) for 266646 bits. Thus, the proposed method gives high imperceptibility through high PSNR value and high embedding capacity in the cover image due to adaptive embedding scheme and high robustness against blind attack through graph theoretic random selection of coefficients. PMID:24453857

Parallel Geographic Variation in Drosophila melanogaster

PubMed Central

Reinhardt, Josie A.; Kolaczkowski, Bryan; Jones, Corbin D.; Begun, David J.; Kern, Andrew D.

2014-01-01

Drosophila melanogaster, an ancestrally African species, has recently spread throughout the world, associated with human activity. The species has served as the focus of many studies investigating local adaptation relating to latitudinal variation in non-African populations, especially those from the United States and Australia. These studies have documented the existence of shared, genetically determined phenotypic clines for several life history and morphological traits. However, there are no studies designed to formally address the degree of shared latitudinal differentiation at the genomic level. Here we present our comparative analysis of such differentiation. Not surprisingly, we find evidence of substantial, shared selection responses on the two continents, probably resulting from selection on standing ancestral variation. The polymorphic inversion In(3R)P has an important effect on this pattern, but considerable parallelism is also observed across the genome in regions not associated with inversion polymorphism. Interestingly, parallel latitudinal differentiation is observed even for variants that are not particularly strongly differentiated, which suggests that very large numbers of polymorphisms are targets of spatially varying selection in this species. PMID:24610860

Genealogy-based methods for inference of historical recombination and gene flow and their application in Saccharomyces cerevisiae.

PubMed

Jenkins, Paul A; Song, Yun S; Brem, Rachel B

2012-01-01

Genetic exchange between isolated populations, or introgression between species, serves as a key source of novel genetic material on which natural selection can act. While detecting historical gene flow from DNA sequence data is of much interest, many existing methods can be limited by requirements for deep population genomic sampling. In this paper, we develop a scalable genealogy-based method to detect candidate signatures of gene flow into a given population when the source of the alleles is unknown. Our method does not require sequenced samples from the source population, provided that the alleles have not reached fixation in the sampled recipient population. The method utilizes recent advances in algorithms for the efficient reconstruction of ancestral recombination graphs, which encode genealogical histories of DNA sequence data at each site, and is capable of detecting the signatures of gene flow whose footprints are of length up to single genes. Further, we employ a theoretical framework based on coalescent theory to test for statistical significance of certain recombination patterns consistent with gene flow from divergent sources. Implementing these methods for application to whole-genome sequences of environmental yeast isolates, we illustrate the power of our approach to highlight loci with unusual recombination histories. By developing innovative theory and methods to analyze signatures of gene flow from population sequence data, our work establishes a foundation for the continued study of introgression and its evolutionary relevance.

Genealogy-Based Methods for Inference of Historical Recombination and Gene Flow and Their Application in Saccharomyces cerevisiae

PubMed Central

Jenkins, Paul A.; Song, Yun S.; Brem, Rachel B.

2012-01-01

Genetic exchange between isolated populations, or introgression between species, serves as a key source of novel genetic material on which natural selection can act. While detecting historical gene flow from DNA sequence data is of much interest, many existing methods can be limited by requirements for deep population genomic sampling. In this paper, we develop a scalable genealogy-based method to detect candidate signatures of gene flow into a given population when the source of the alleles is unknown. Our method does not require sequenced samples from the source population, provided that the alleles have not reached fixation in the sampled recipient population. The method utilizes recent advances in algorithms for the efficient reconstruction of ancestral recombination graphs, which encode genealogical histories of DNA sequence data at each site, and is capable of detecting the signatures of gene flow whose footprints are of length up to single genes. Further, we employ a theoretical framework based on coalescent theory to test for statistical significance of certain recombination patterns consistent with gene flow from divergent sources. Implementing these methods for application to whole-genome sequences of environmental yeast isolates, we illustrate the power of our approach to highlight loci with unusual recombination histories. By developing innovative theory and methods to analyze signatures of gene flow from population sequence data, our work establishes a foundation for the continued study of introgression and its evolutionary relevance. PMID:23226196

Assembly planning based on subassembly extraction

NASA Technical Reports Server (NTRS)

Lee, Sukhan; Shin, Yeong Gil

1990-01-01

A method is presented for the automatic determination of assembly partial orders from a liaison graph representation of an assembly through the extraction of preferred subassemblies. In particular, the authors show how to select a set of tentative subassemblies by decomposing a liaison graph into a set of subgraphs based on feasibility and difficulty of disassembly, how to evaluate each of the tentative subassemblies in terms of assembly cost using the subassembly selection indices, and how to construct a hierarchical partial order graph (HPOG) as an assembly plan. The method provides an approach to assembly planning by identifying spatial parallelism in assembly as a means of constructing temporal relationships among assembly operations and solves the problem of finding a cost-effective assembly plan in a flexible environment. A case study of the assembly planning of a mechanical assembly is presented.

Bipartite Graphs as Models of Population Structures in Evolutionary Multiplayer Games

PubMed Central

Peña, Jorge; Rochat, Yannick

2012-01-01

By combining evolutionary game theory and graph theory, “games on graphs” study the evolutionary dynamics of frequency-dependent selection in population structures modeled as geographical or social networks. Networks are usually represented by means of unipartite graphs, and social interactions by two-person games such as the famous prisoner’s dilemma. Unipartite graphs have also been used for modeling interactions going beyond pairwise interactions. In this paper, we argue that bipartite graphs are a better alternative to unipartite graphs for describing population structures in evolutionary multiplayer games. To illustrate this point, we make use of bipartite graphs to investigate, by means of computer simulations, the evolution of cooperation under the conventional and the distributed N-person prisoner’s dilemma. We show that several implicit assumptions arising from the standard approach based on unipartite graphs (such as the definition of replacement neighborhoods, the intertwining of individual and group diversity, and the large overlap of interaction neighborhoods) can have a large impact on the resulting evolutionary dynamics. Our work provides a clear example of the importance of construction procedures in games on graphs, of the suitability of bigraphs and hypergraphs for computational modeling, and of the importance of concepts from social network analysis such as centrality, centralization and bipartite clustering for the understanding of dynamical processes occurring on networked population structures. PMID:22970237

Reproducibility of graph metrics of human brain structural networks.

PubMed

Duda, Jeffrey T; Cook, Philip A; Gee, James C

2014-01-01

Recent interest in human brain connectivity has led to the application of graph theoretical analysis to human brain structural networks, in particular white matter connectivity inferred from diffusion imaging and fiber tractography. While these methods have been used to study a variety of patient populations, there has been less examination of the reproducibility of these methods. A number of tractography algorithms exist and many of these are known to be sensitive to user-selected parameters. The methods used to derive a connectivity matrix from fiber tractography output may also influence the resulting graph metrics. Here we examine how these algorithm and parameter choices influence the reproducibility of proposed graph metrics on a publicly available test-retest dataset consisting of 21 healthy adults. The dice coefficient is used to examine topological similarity of constant density subgraphs both within and between subjects. Seven graph metrics are examined here: mean clustering coefficient, characteristic path length, largest connected component size, assortativity, global efficiency, local efficiency, and rich club coefficient. The reproducibility of these network summary measures is examined using the intraclass correlation coefficient (ICC). Graph curves are created by treating the graph metrics as functions of a parameter such as graph density. Functional data analysis techniques are used to examine differences in graph measures that result from the choice of fiber tracking algorithm. The graph metrics consistently showed good levels of reproducibility as measured with ICC, with the exception of some instability at low graph density levels. The global and local efficiency measures were the most robust to the choice of fiber tracking algorithm.

Graph theory as a proxy for spatially explicit population models in conservation planning.

PubMed

Minor, Emily S; Urban, Dean L

2007-09-01

Spatially explicit population models (SEPMs) are often considered the best way to predict and manage species distributions in spatially heterogeneous landscapes. However, they are computationally intensive and require extensive knowledge of species' biology and behavior, limiting their application in many cases. An alternative to SEPMs is graph theory, which has minimal data requirements and efficient algorithms. Although only recently introduced to landscape ecology, graph theory is well suited to ecological applications concerned with connectivity or movement. This paper compares the performance of graph theory to a SEPM in selecting important habitat patches for Wood Thrush (Hylocichla mustelina) conservation. We use both models to identify habitat patches that act as population sources and persistent patches and also use graph theory to identify patches that act as stepping stones for dispersal. Correlations of patch rankings were very high between the two models. In addition, graph theory offers the ability to identify patches that are very important to habitat connectivity and thus long-term population persistence across the landscape. We show that graph theory makes very similar predictions in most cases and in other cases offers insight not available from the SEPM, and we conclude that graph theory is a suitable and possibly preferable alternative to SEPMs for species conservation in heterogeneous landscapes.

Incorporating biological information in sparse principal component analysis with application to genomic data.

PubMed

Li, Ziyi; Safo, Sandra E; Long, Qi

2017-07-11

Sparse principal component analysis (PCA) is a popular tool for dimensionality reduction, pattern recognition, and visualization of high dimensional data. It has been recognized that complex biological mechanisms occur through concerted relationships of multiple genes working in networks that are often represented by graphs. Recent work has shown that incorporating such biological information improves feature selection and prediction performance in regression analysis, but there has been limited work on extending this approach to PCA. In this article, we propose two new sparse PCA methods called Fused and Grouped sparse PCA that enable incorporation of prior biological information in variable selection. Our simulation studies suggest that, compared to existing sparse PCA methods, the proposed methods achieve higher sensitivity and specificity when the graph structure is correctly specified, and are fairly robust to misspecified graph structures. Application to a glioblastoma gene expression dataset identified pathways that are suggested in the literature to be related with glioblastoma. The proposed sparse PCA methods Fused and Grouped sparse PCA can effectively incorporate prior biological information in variable selection, leading to improved feature selection and more interpretable principal component loadings and potentially providing insights on molecular underpinnings of complex diseases.

A global evolutionary and metabolic analysis of human obesity gene risk variants.

PubMed

Castillo, Joseph J; Hazlett, Zachary S; Orlando, Robert A; Garver, William S

2017-09-05

It is generally accepted that the selection of gene variants during human evolution optimized energy metabolism that now interacts with our obesogenic environment to increase the prevalence of obesity. The purpose of this study was to perform a global evolutionary and metabolic analysis of human obesity gene risk variants (110 human obesity genes with 127 nearest gene risk variants) identified using genome-wide association studies (GWAS) to enhance our knowledge of early and late genotypes. As a result of determining the mean frequency of these obesity gene risk variants in 13 available populations from around the world our results provide evidence for the early selection of ancestral risk variants (defined as selection before migration from Africa) and late selection of derived risk variants (defined as selection after migration from Africa). Our results also provide novel information for association of these obesity genes or encoded proteins with diverse metabolic pathways and other human diseases. The overall results indicate a significant differential evolutionary pattern for the selection of obesity gene ancestral and derived risk variants proposed to optimize energy metabolism in varying global environments and complex association with metabolic pathways and other human diseases. These results are consistent with obesity genes that encode proteins possessing a fundamental role in maintaining energy metabolism and survival during the course of human evolution. Copyright © 2017. Published by Elsevier B.V.

The Replicator Equation on Graphs

PubMed Central

Ohtsuki, Hisashi; Nowak, Martin A.

2008-01-01

We study evolutionary games on graphs. Each player is represented by a vertex of the graph. The edges denote who meets whom. A player can use any one of n strategies. Players obtain a payoff from interaction with all their immediate neighbors. We consider three different update rules, called ‘birth-death’, ‘death-birth’ and ‘imitation’. A fourth update rule, ‘pairwise comparison’, is shown to be equivalent to birth-death updating in our model. We use pair-approximation to describe the evolutionary game dynamics on regular graphs of degree k. In the limit of weak selection, we can derive a differential equation which describes how the average frequency of each strategy on the graph changes over time. Remarkably, this equation is a replicator equation with a transformed payoff matrix. Therefore, moving a game from a well-mixed population (the complete graph) onto a regular graph simply results in a transformation of the payoff matrix. The new payoff matrix is the sum of the original payoff matrix plus another matrix, which describes the local competition of strategies. We discuss the application of our theory to four particular examples, the Prisoner’s Dilemma, the Snow-Drift game, a coordination game and the Rock-Scissors-Paper game. PMID:16860343

Reconstruction of the ancestral plastid genome in Geraniaceae reveals a correlation between genome rearrangements, repeats, and nucleotide substitution rates.

PubMed

Weng, Mao-Lun; Blazier, John C; Govindu, Madhumita; Jansen, Robert K

2014-03-01

Geraniaceae plastid genomes are highly rearranged, and each of the four genera already sequenced in the family has a distinct genome organization. This study reports plastid genome sequences of six additional species, Francoa sonchifolia, Melianthus villosus, and Viviania marifolia from Geraniales, and Pelargonium alternans, California macrophylla, and Hypseocharis bilobata from Geraniaceae. These genome sequences, combined with previously published species, provide sufficient taxon sampling to reconstruct the ancestral plastid genome organization of Geraniaceae and the rearrangements unique to each genus. The ancestral plastid genome of Geraniaceae has a 4 kb inversion and a reduced, Pelargonium-like small single copy region. Our ancestral genome reconstruction suggests that a few minor rearrangements occurred in the stem branch of Geraniaceae followed by independent rearrangements in each genus. The genomic comparison demonstrates that a series of inverted repeat boundary shifts and inversions played a major role in shaping genome organization in the family. The distribution of repeats is strongly associated with breakpoints in the rearranged genomes, and the proportion and the number of large repeats (>20 bp and >60 bp) are significantly correlated with the degree of genome rearrangements. Increases in the degree of plastid genome rearrangements are correlated with the acceleration in nonsynonymous substitution rates (dN) but not with synonymous substitution rates (dS). Possible mechanisms that might contribute to this correlation, including DNA repair system and selection, are discussed.

Comparison of Decisions Quality of Heuristic Methods with Limited Depth-First Search Techniques in the Graph Shortest Path Problem

NASA Astrophysics Data System (ADS)

Vatutin, Eduard

2017-12-01

The article deals with the problem of analysis of effectiveness of the heuristic methods with limited depth-first search techniques of decision obtaining in the test problem of getting the shortest path in graph. The article briefly describes the group of methods based on the limit of branches number of the combinatorial search tree and limit of analyzed subtree depth used to solve the problem. The methodology of comparing experimental data for the estimation of the quality of solutions based on the performing of computational experiments with samples of graphs with pseudo-random structure and selected vertices and arcs number using the BOINC platform is considered. It also shows description of obtained experimental results which allow to identify the areas of the preferable usage of selected subset of heuristic methods depending on the size of the problem and power of constraints. It is shown that the considered pair of methods is ineffective in the selected problem and significantly inferior to the quality of solutions that are provided by ant colony optimization method and its modification with combinatorial returns.

Ancestral Components of Admixed Genomes in a Mexican Cohort

PubMed Central

Johnson, Nicholas A.; Coram, Marc A.; Shriver, Mark D.; Romieu, Isabelle; Barsh, Gregory S.; London, Stephanie J.; Tang, Hua

2011-01-01

For most of the world, human genome structure at a population level is shaped by interplay between ancient geographic isolation and more recent demographic shifts, factors that are captured by the concepts of biogeographic ancestry and admixture, respectively. The ancestry of non-admixed individuals can often be traced to a specific population in a precise region, but current approaches for studying admixed individuals generally yield coarse information in which genome ancestry proportions are identified according to continent of origin. Here we introduce a new analytic strategy for this problem that allows fine-grained characterization of admixed individuals with respect to both geographic and genomic coordinates. Ancestry segments from different continents, identified with a probabilistic model, are used to construct and study “virtual genomes” of admixed individuals. We apply this approach to a cohort of 492 parent–offspring trios from Mexico City. The relative contributions from the three continental-level ancestral populations—Africa, Europe, and America—vary substantially between individuals, and the distribution of haplotype block length suggests an admixing time of 10–15 generations. The European and Indigenous American virtual genomes of each Mexican individual can be traced to precise regions within each continent, and they reveal a gradient of Amerindian ancestry between indigenous people of southwestern Mexico and Mayans of the Yucatan Peninsula. This contrasts sharply with the African roots of African Americans, which have been characterized by a uniform mixing of multiple West African populations. We also use the virtual European and Indigenous American genomes to search for the signatures of selection in the ancestral populations, and we identify previously known targets of selection in other populations, as well as new candidate loci. The ability to infer precise ancestral components of admixed genomes will facilitate studies of disease-related phenotypes and will allow new insight into the adaptive and demographic history of indigenous people. PMID:22194699

Coastal Residents, Stingray Style: Selecting the Best Intertidal Creeks for Seasonal Living

ERIC Educational Resources Information Center

Webb, Sarah; Carla Curran, Mary

2017-01-01

Graphing and calculating percentages are integral skills in a STEM curriculum. Teaching students how to create graphs allows them to identify numerical trends and to express results in a clear and concise manner. In this activity, students will remain engaged in the lesson by moving around the room and then work together to generate their own…

Using Social Network Graphs as Visualization Tools to Influence Peer Selection Decision-Making Strategies to Access Information about Complex Socioscientific Issues

ERIC Educational Resources Information Center

Yoon, Susan A.

2011-01-01

This study extends previous research that explores how visualization affordances that computational tools provide and social network analyses that account for individual- and group-level dynamic processes can work in conjunction to improve learning outcomes. The study's main hypothesis is that when social network graphs are used in instruction,…

Introduction to Statistics. Learning Packages in the Policy Sciences Series, PS-26. Revised Edition.

ERIC Educational Resources Information Center

Policy Studies Associates, Croton-on-Hudson, NY.

The primary objective of this booklet is to introduce students to basic statistical skills that are useful in the analysis of public policy data. A few, selected statistical methods are presented, and theory is not emphasized. Chapter 1 provides instruction for using tables, bar graphs, bar graphs with grouped data, trend lines, pie diagrams,…

Function Plotters for Secondary Math Teachers. A MicroSIFT Quarterly Report.

ERIC Educational Resources Information Center

Weaver, Dave; And Others

This report examines mathematical graphing utilities or function plotters for use in introductory algebra classes of more advanced courses. Each product selected for inclusion in this report is able to construct the graph of a given equation on the screen and serves as a utility which may be used by the student for an open-ended exploration of a…

The use of atlas registration and graph cuts for prostate segmentation in magnetic resonance images

DOE Office of Scientific and Technical Information (OSTI.GOV)

Korsager, Anne Sofie, E-mail: asko@hst.aau.dk; Østergaard, Lasse Riis; Fortunati, Valerio

2015-04-15

Purpose: An automatic method for 3D prostate segmentation in magnetic resonance (MR) images is presented for planning image-guided radiotherapy treatment of prostate cancer. Methods: A spatial prior based on intersubject atlas registration is combined with organ-specific intensity information in a graph cut segmentation framework. The segmentation is tested on 67 axial T{sub 2}-weighted MR images in a leave-one-out cross validation experiment and compared with both manual reference segmentations and with multiatlas-based segmentations using majority voting atlas fusion. The impact of atlas selection is investigated in both the traditional atlas-based segmentation and the new graph cut method that combines atlas andmore » intensity information in order to improve the segmentation accuracy. Best results were achieved using the method that combines intensity information, shape information, and atlas selection in the graph cut framework. Results: A mean Dice similarity coefficient (DSC) of 0.88 and a mean surface distance (MSD) of 1.45 mm with respect to the manual delineation were achieved. Conclusions: This approaches the interobserver DSC of 0.90 and interobserver MSD 0f 1.15 mm and is comparable to other studies performing prostate segmentation in MR.« less

Multiresolution analysis over graphs for a motor imagery based online BCI game.

PubMed

Asensio-Cubero, Javier; Gan, John Q; Palaniappan, Ramaswamy

2016-01-01

Multiresolution analysis (MRA) over graph representation of EEG data has proved to be a promising method for offline brain-computer interfacing (BCI) data analysis. For the first time we aim to prove the feasibility of the graph lifting transform in an online BCI system. Instead of developing a pointer device or a wheel-chair controller as test bed for human-machine interaction, we have designed and developed an engaging game which can be controlled by means of imaginary limb movements. Some modifications to the existing MRA analysis over graphs for BCI have also been proposed, such as the use of common spatial patterns for feature extraction at the different levels of decomposition, and sequential floating forward search as a best basis selection technique. In the online game experiment we obtained for three classes an average classification rate of 63.0% for fourteen naive subjects. The application of a best basis selection method helps significantly decrease the computing resources needed. The present study allows us to further understand and assess the benefits of the use of tailored wavelet analysis for processing motor imagery data and contributes to the further development of BCI for gaming purposes. Copyright © 2015 Elsevier Ltd. All rights reserved.

G-Bean: an ontology-graph based web tool for biomedical literature retrieval

PubMed Central

2014-01-01

Background Currently, most people use NCBI's PubMed to search the MEDLINE database, an important bibliographical information source for life science and biomedical information. However, PubMed has some drawbacks that make it difficult to find relevant publications pertaining to users' individual intentions, especially for non-expert users. To ameliorate the disadvantages of PubMed, we developed G-Bean, a graph based biomedical search engine, to search biomedical articles in MEDLINE database more efficiently. Methods G-Bean addresses PubMed's limitations with three innovations: (1) Parallel document index creation: a multithreaded index creation strategy is employed to generate the document index for G-Bean in parallel; (2) Ontology-graph based query expansion: an ontology graph is constructed by merging four major UMLS (Version 2013AA) vocabularies, MeSH, SNOMEDCT, CSP and AOD, to cover all concepts in National Library of Medicine (NLM) database; a Personalized PageRank algorithm is used to compute concept relevance in this ontology graph and the Term Frequency - Inverse Document Frequency (TF-IDF) weighting scheme is used to re-rank the concepts. The top 500 ranked concepts are selected for expanding the initial query to retrieve more accurate and relevant information; (3) Retrieval and re-ranking of documents based on user's search intention: after the user selects any article from the existing search results, G-Bean analyzes user's selections to determine his/her true search intention and then uses more relevant and more specific terms to retrieve additional related articles. The new articles are presented to the user in the order of their relevance to the already selected articles. Results Performance evaluation with 106 OHSUMED benchmark queries shows that G-Bean returns more relevant results than PubMed does when using these queries to search the MEDLINE database. PubMed could not even return any search result for some OHSUMED queries because it failed to form the appropriate Boolean query statement automatically from the natural language query strings. G-Bean is available at http://bioinformatics.clemson.edu/G-Bean/index.php. Conclusions G-Bean addresses PubMed's limitations with ontology-graph based query expansion, automatic document indexing, and user search intention discovery. It shows significant advantages in finding relevant articles from the MEDLINE database to meet the information need of the user. PMID:25474588

G-Bean: an ontology-graph based web tool for biomedical literature retrieval.

PubMed

Wang, James Z; Zhang, Yuanyuan; Dong, Liang; Li, Lin; Srimani, Pradip K; Yu, Philip S

2014-01-01

Currently, most people use NCBI's PubMed to search the MEDLINE database, an important bibliographical information source for life science and biomedical information. However, PubMed has some drawbacks that make it difficult to find relevant publications pertaining to users' individual intentions, especially for non-expert users. To ameliorate the disadvantages of PubMed, we developed G-Bean, a graph based biomedical search engine, to search biomedical articles in MEDLINE database more efficiently. G-Bean addresses PubMed's limitations with three innovations: (1) Parallel document index creation: a multithreaded index creation strategy is employed to generate the document index for G-Bean in parallel; (2) Ontology-graph based query expansion: an ontology graph is constructed by merging four major UMLS (Version 2013AA) vocabularies, MeSH, SNOMEDCT, CSP and AOD, to cover all concepts in National Library of Medicine (NLM) database; a Personalized PageRank algorithm is used to compute concept relevance in this ontology graph and the Term Frequency - Inverse Document Frequency (TF-IDF) weighting scheme is used to re-rank the concepts. The top 500 ranked concepts are selected for expanding the initial query to retrieve more accurate and relevant information; (3) Retrieval and re-ranking of documents based on user's search intention: after the user selects any article from the existing search results, G-Bean analyzes user's selections to determine his/her true search intention and then uses more relevant and more specific terms to retrieve additional related articles. The new articles are presented to the user in the order of their relevance to the already selected articles. Performance evaluation with 106 OHSUMED benchmark queries shows that G-Bean returns more relevant results than PubMed does when using these queries to search the MEDLINE database. PubMed could not even return any search result for some OHSUMED queries because it failed to form the appropriate Boolean query statement automatically from the natural language query strings. G-Bean is available at http://bioinformatics.clemson.edu/G-Bean/index.php. G-Bean addresses PubMed's limitations with ontology-graph based query expansion, automatic document indexing, and user search intention discovery. It shows significant advantages in finding relevant articles from the MEDLINE database to meet the information need of the user.

A Constraint-Based Planner for Data Production

NASA Technical Reports Server (NTRS)

Pang, Wanlin; Golden, Keith

2005-01-01

This paper presents a graph-based backtracking algorithm designed to support constrain-tbased planning in data production domains. This algorithm performs backtracking at two nested levels: the outer- backtracking following the structure of the planning graph to select planner subgoals and actions to achieve them and the inner-backtracking inside a subproblem associated with a selected action to find action parameter values. We show this algorithm works well in a planner applied to automating data production in an ecological forecasting system. We also discuss how the idea of multi-level backtracking may improve efficiency of solving semi-structured constraint problems.

Selection for Protein Kinetic Stability Connects Denaturation Temperatures to Organismal Temperatures and Provides Clues to Archaean Life

PubMed Central

Romero-Romero, M. Luisa; Risso, Valeria A.; Martinez-Rodriguez, Sergio; Gaucher, Eric A.; Ibarra-Molero, Beatriz; Sanchez-Ruiz, Jose M.

2016-01-01

The relationship between the denaturation temperatures of proteins (Tm values) and the living temperatures of their host organisms (environmental temperatures: TENV values) is poorly understood. Since different proteins in the same organism may show widely different Tm’s, no simple universal relationship between Tm and TENV should hold, other than Tm≥TENV. Yet, when analyzing a set of homologous proteins from different hosts, Tm’s are oftentimes found to correlate with TENV’s but this correlation is shifted upward on the Tm axis. Supporting this trend, we recently reported Tm’s for resurrected Precambrian thioredoxins that mirror a proposed environmental cooling over long geological time, while remaining a shocking ~50°C above the proposed ancestral ocean temperatures. Here, we show that natural selection for protein kinetic stability (denaturation rate) can produce a Tm↔TENV correlation with a large upward shift in Tm. A model for protein stability evolution suggests a link between the Tm shift and the in vivo lifetime of a protein and, more specifically, allows us to estimate ancestral environmental temperatures from experimental denaturation rates for resurrected Precambrian thioredoxins. The TENV values thus obtained match the proposed ancestral ocean cooling, support comparatively high Archaean temperatures, and are consistent with a recent proposal for the environmental temperature (above 75°C) that hosted the last universal common ancestor. More generally, this work provides a framework for understanding how features of protein stability reflect the environmental temperatures of the host organisms. PMID:27253436

Time of travel of solutes in selected reaches of the Sandusky River Basin, Ohio, 1972 and 1973

USGS Publications Warehouse

Westfall, Arthur O.

1976-01-01

A time of travel study of a 106-mile (171-kilometer) reach of the Sandusky River and a 39-mile (63-kilometer) reach of Tymochtee Creek was made to determine the time required for water released from Killdeer Reservoir on Tymochtee Creek to reach selected downstream points. In general, two dye sample runs were made through each subreach to define the time-discharge relation for approximating travel times at selected discharges within the measured range, and time-discharge graphs are presented for 38 subreaches. Graphs of dye dispersion and variation in relation to time are given for three selected sampling sites. For estimating travel time and velocities between points in the study reach, tables for selected flow durations are given. Duration curves of daily discharge for four index stations are presented to indicate the lo-flow characteristics and for use in shaping downward extensions of the time-discharge curves.

A Random Walk Approach to Query Informative Constraints for Clustering.

PubMed

Abin, Ahmad Ali

2017-08-09

This paper presents a random walk approach to the problem of querying informative constraints for clustering. The proposed method is based on the properties of the commute time, that is the expected time taken for a random walk to travel between two nodes and return, on the adjacency graph of data. Commute time has the nice property of that, the more short paths connect two given nodes in a graph, the more similar those nodes are. Since computing the commute time takes the Laplacian eigenspectrum into account, we use this property in a recursive fashion to query informative constraints for clustering. At each recursion, the proposed method constructs the adjacency graph of data and utilizes the spectral properties of the commute time matrix to bipartition the adjacency graph. Thereafter, the proposed method benefits from the commute times distance on graph to query informative constraints between partitions. This process iterates for each partition until the stop condition becomes true. Experiments on real-world data show the efficiency of the proposed method for constraints selection.

Computing Strongly Connected Components in the Streaming Model

NASA Astrophysics Data System (ADS)

Laura, Luigi; Santaroni, Federico

In this paper we present the first algorithm to compute the Strongly Connected Components of a graph in the datastream model (W-Stream), where the graph is represented by a stream of edges and we are allowed to produce intermediate output streams. The algorithm is simple, effective, and can be implemented with few lines of code: it looks at each edge in the stream, and selects the appropriate action with respect to a tree T, representing the graph connectivity seen so far. We analyze the theoretical properties of the algorithm: correctness, memory occupation (O(n logn)), per item processing time (bounded by the current height of T), and number of passes (bounded by the maximal height of T). We conclude by presenting a brief experimental evaluation of the algorithm against massive synthetic and real graphs that confirms its effectiveness: with graphs with up to 100M nodes and 4G edges, only few passes are needed, and millions of edges per second are processed.

HOW TO STUDY ADAPTATION (AND WHY TO DO IT THAT WAY).

PubMed

Olson, Mark E; Arroyo-Santos, Alfonso

2015-06-01

Some adaptationist explanations are regarded as maximally solid and others fanciful just-so stories. Just-so stories are explanations based on very little evidence. Lack of evidence leads to circular-sounding reasoning: "this trait was shaped by selection in unseen ancestral populations and this selection must have occurred because the trait is present." Well-supported adaptationist explanations include evidence that is not only abundant but selected from comparative, populational, and optimality perspectives, the three adaptationist subdisciplines. Each subdiscipline obtains its broad relevance in evolutionary biology via assumptions that can only be tested with the methods of the other subdisciplines. However, even in the best-supported explanations, assumptions regarding variation, heritability, and fitness in unseen ancestral populations are always present. These assumptions are accepted given how well they would explain the data if they were true. This means that some degree of "circularity" is present in all evolutionary explanations. Evolutionary explanation corresponds not to a deductive structure, as biologists usually assert, but instead to ones such as abduction or Bayesianism. With these structures in mind, we show the way to a healthier view of "circularity" in evolutionary biology and why integration across the comparative, populational, and optimality approaches is necessary.

Photic niche invasions: phylogenetic history of the dim-light foraging augochlorine bees (Halictidae)

PubMed Central

Tierney, Simon M.; Sanjur, Oris; Grajales, Grethel G.; Santos, Leandro M.; Bermingham, Eldredge; Wcislo, William T.

2012-01-01

Most bees rely on flowering plants and hence are diurnal foragers. From this ancestral state, dim-light foraging in bees requires significant adaptations to a new photic environment. We used DNA sequences to evaluate the phylogenetic history of the most diverse clade of Apoidea that is adapted to dim-light environments (Augochlorini: Megalopta, Megaloptidia and Megommation). The most speciose lineage, Megalopta, is distal to the remaining dim-light genera, and its closest diurnal relative (Xenochlora) is recovered as a lineage that has secondarily reverted to diurnal foraging. Tests for adaptive protein evolution indicate that long-wavelength opsin shows strong evidence of stabilizing selection, with no more than five codons (2%) under positive selection, depending on analytical procedure. In the branch leading to Megalopta, the amino acid of the single positively selected codon is conserved among ancestral Halictidae examined, and is homologous to codons known to influence molecular structure at the chromophore-binding pocket. Theoretically, such mutations can shift photopigment λmax sensitivity and enable visual transduction in alternate photic environments. Results are discussed in light of the available evidence on photopigment structure, morphological specialization and biogeographic distributions over geological time. PMID:21795273

Photic niche invasions: phylogenetic history of the dim-light foraging augochlorine bees (Halictidae).

PubMed

Tierney, Simon M; Sanjur, Oris; Grajales, Grethel G; Santos, Leandro M; Bermingham, Eldredge; Wcislo, William T

2012-02-22

Most bees rely on flowering plants and hence are diurnal foragers. From this ancestral state, dim-light foraging in bees requires significant adaptations to a new photic environment. We used DNA sequences to evaluate the phylogenetic history of the most diverse clade of Apoidea that is adapted to dim-light environments (Augochlorini: Megalopta, Megaloptidia and Megommation). The most speciose lineage, Megalopta, is distal to the remaining dim-light genera, and its closest diurnal relative (Xenochlora) is recovered as a lineage that has secondarily reverted to diurnal foraging. Tests for adaptive protein evolution indicate that long-wavelength opsin shows strong evidence of stabilizing selection, with no more than five codons (2%) under positive selection, depending on analytical procedure. In the branch leading to Megalopta, the amino acid of the single positively selected codon is conserved among ancestral Halictidae examined, and is homologous to codons known to influence molecular structure at the chromophore-binding pocket. Theoretically, such mutations can shift photopigment λ(max) sensitivity and enable visual transduction in alternate photic environments. Results are discussed in light of the available evidence on photopigment structure, morphological specialization and biogeographic distributions over geological time.

eHUGS: Enhanced Hierarchical Unbiased Graph Shrinkage for Efficient Groupwise Registration

PubMed Central

Wu, Guorong; Peng, Xuewei; Ying, Shihui; Wang, Qian; Yap, Pew-Thian; Shen, Dan; Shen, Dinggang

2016-01-01

Effective and efficient spatial normalization of a large population of brain images is critical for many clinical and research studies, but it is technically very challenging. A commonly used approach is to choose a certain image as the template and then align all other images in the population to this template by applying pairwise registration. To avoid the potential bias induced by the inappropriate template selection, groupwise registration methods have been proposed to simultaneously register all images to a latent common space. However, current groupwise registration methods do not make full use of image distribution information for more accurate registration. In this paper, we present a novel groupwise registration method that harnesses the image distribution information by capturing the image distribution manifold using a hierarchical graph with its nodes representing the individual images. More specifically, a low-level graph describes the image distribution in each subgroup, and a high-level graph encodes the relationship between representative images of subgroups. Given the graph representation, we can register all images to the common space by dynamically shrinking the graph on the image manifold. The topology of the entire image distribution is always maintained during graph shrinkage. Evaluations on two datasets, one for 80 elderly individuals and one for 285 infants, indicate that our method can yield promising results. PMID:26800361

A graph lattice approach to maintaining and learning dense collections of subgraphs as image features.

PubMed

Saund, Eric

2013-10-01

Effective object and scene classification and indexing depend on extraction of informative image features. This paper shows how large families of complex image features in the form of subgraphs can be built out of simpler ones through construction of a graph lattice—a hierarchy of related subgraphs linked in a lattice. Robustness is achieved by matching many overlapping and redundant subgraphs, which allows the use of inexpensive exact graph matching, instead of relying on expensive error-tolerant graph matching to a minimal set of ideal model graphs. Efficiency in exact matching is gained by exploitation of the graph lattice data structure. Additionally, the graph lattice enables methods for adaptively growing a feature space of subgraphs tailored to observed data. We develop the approach in the domain of rectilinear line art, specifically for the practical problem of document forms recognition. We are especially interested in methods that require only one or very few labeled training examples per category. We demonstrate two approaches to using the subgraph features for this purpose. Using a bag-of-words feature vector we achieve essentially single-instance learning on a benchmark forms database, following an unsupervised clustering stage. Further performance gains are achieved on a more difficult dataset using a feature voting method and feature selection procedure.

Employing the therapeutic operating characteristic (TOC) graph for individualised dose prescription.

PubMed

Hoffmann, Aswin L; Huizenga, Henk; Kaanders, Johannes H A M

2013-03-07

In current practice, patients scheduled for radiotherapy are treated according to 'rigid' protocols with predefined dose prescriptions that do not consider risk-taking preferences of individuals. The therapeutic operating characteristic (TOC) graph is applied as a decision-aid to assess the trade-off between treatment benefit and morbidity to facilitate dose prescription customisation. Historical dose-response data from prostate cancer patient cohorts treated with 3D-conformal radiotherapy is used to construct TOC graphs. Next, intensity-modulated (IMRT) plans are generated by optimisation based on dosimetric criteria and dose-response relationships. TOC graphs are constructed for dose-scaling of the optimised IMRT plan and individualised dose prescription. The area under the TOC curve (AUC) is estimated to measure the therapeutic power of these plans. On a continuous scale, the TOC graph directly visualises treatment benefit and morbidity risk of physicians' or patients' choices for dose (de-)escalation. The trade-off between these probabilities facilitates the selection of an individualised dose prescription. TOC graphs show broader therapeutic window and higher AUCs with increasing target dose heterogeneity. The TOC graph gives patients and physicians access to a decision-aid and read-out of the trade-off between treatment benefit and morbidity risks for individualised dose prescription customisation over a continuous range of dose levels.

Employing the therapeutic operating characteristic (TOC) graph for individualised dose prescription

PubMed Central

2013-01-01

Background In current practice, patients scheduled for radiotherapy are treated according to ‘rigid’ protocols with predefined dose prescriptions that do not consider risk-taking preferences of individuals. The therapeutic operating characteristic (TOC) graph is applied as a decision-aid to assess the trade-off between treatment benefit and morbidity to facilitate dose prescription customisation. Methods Historical dose-response data from prostate cancer patient cohorts treated with 3D-conformal radiotherapy is used to construct TOC graphs. Next, intensity-modulated (IMRT) plans are generated by optimisation based on dosimetric criteria and dose-response relationships. TOC graphs are constructed for dose-scaling of the optimised IMRT plan and individualised dose prescription. The area under the TOC curve (AUC) is estimated to measure the therapeutic power of these plans. Results On a continuous scale, the TOC graph directly visualises treatment benefit and morbidity risk of physicians’ or patients’ choices for dose (de-)escalation. The trade-off between these probabilities facilitates the selection of an individualised dose prescription. TOC graphs show broader therapeutic window and higher AUCs with increasing target dose heterogeneity. Conclusions The TOC graph gives patients and physicians access to a decision-aid and read-out of the trade-off between treatment benefit and morbidity risks for individualised dose prescription customisation over a continuous range of dose levels. PMID:23497640

--No Title--

Science.gov Websites

; } input:hover { background:#ACF7AF; } select { cursor:pointer; } table.data td table.noborders, table.data td ; } table.controls th { padding:10px; } table.controls select { margin-top:.3em; } table.controls, table.graphs

Conceptualizing the autism spectrum in terms of natural selection and behavioral ecology: the solitary forager hypothesis.

PubMed

Reser, Jared Edward

2011-05-21

This article reviews etiological and comparative evidence supporting the hypothesis that some genes associated with the autism spectrum were naturally selected and represent the adaptive benefits of being cognitively suited for solitary foraging. People on the autism spectrum are conceptualized here as ecologically competent individuals that could have been adept at learning and implementing hunting and gathering skills in the ancestral environment. Upon independence from their mothers, individuals on the autism spectrum may have been psychologically predisposed toward a different life-history strategy, common among mammals and even some primates, to hunt and gather primarily on their own. Many of the behavioral and cognitive tendencies that autistic individuals exhibit are viewed here as adaptations that would have complemented a solitary lifestyle. For example, the obsessive, repetitive and systemizing tendencies in autism, which can be mistakenly applied toward activities such as block stacking today, may have been focused by hunger and thirst toward successful food procurement in the ancestral past. Both solitary mammals and autistic individuals are low on measures of gregariousness, socialization, direct gazing, eye contact, facial expression, facial recognition, emotional engagement, affiliative need and other social behaviors. The evolution of the neurological tendencies in solitary species that predispose them toward being introverted and reclusive may hold important clues for the evolution of the autism spectrum and the natural selection of autism genes. Solitary animals are thought to eschew unnecessary social contact as part of a foraging strategy often due to scarcity and wide dispersal of food in their native environments. It is thought that the human ancestral environment was often nutritionally sparse as well, and this may have driven human parties to periodically disband. Inconsistencies in group size must have led to inconsistencies in the manner in which natural selection fashioned the social minds of humans, which in turn may well be responsible for the large variation in social abilities seen in human populations. This article emphasizes that individuals on the autism spectrum may have only been partially solitary, that natural selection may have only favored subclinical autistic traits and that the most severe cases of autism may be due to assortative mating.

A Selectivity based approach to Continuous Pattern Detection in Streaming Graphs

DOE Office of Scientific and Technical Information (OSTI.GOV)

Choudhury, Sutanay; Holder, Larry; Chin, George

2015-05-27

Cyber security is one of the most significant technical challenges in current times. Detecting adversarial activities, prevention of theft of intellectual properties and customer data is a high priority for corporations and government agencies around the world. Cyber defenders need to analyze massive-scale, high-resolution network flows to identify, categorize, and mitigate attacks involving networks spanning institutional and national boundaries. Many of the cyber attacks can be described as subgraph patterns, with prominent examples being insider infiltrations (path queries), denial of service (parallel paths) and malicious spreads (tree queries). This motivates us to explore subgraph matching on streaming graphs in amore » continuous setting. The novelty of our work lies in using the subgraph distributional statistics collected from the streaming graph to determine the query processing strategy. We introduce a ``Lazy Search" algorithm where the search strategy is decided on a vertex-to-vertex basis depending on the likelihood of a match in the vertex neighborhood. We also propose a metric named ``Relative Selectivity" that is used to select between different query processing strategies. Our experiments performed on real online news, network traffic stream and a synthetic social network benchmark demonstrate 10-100x speedups over non-incremental, selectivity agnostic approaches.« less

Speed of evolution on graphs

NASA Astrophysics Data System (ADS)

Sui, Xiukai; Wu, Bin; Wang, Long

2015-12-01

The likelihood that a mutant fixates in the wild population, i.e., fixation probability, has been intensively studied in evolutionary game theory, where individuals' fitness is frequency dependent. However, it is of limited interest when it takes long to take over. Thus the speed of evolution becomes an important issue. In general, it is still unclear how fixation times are affected by the population structure, although the fixation times have already been addressed in the well-mixed populations. Here we theoretically address this issue by pair approximation and diffusion approximation on regular graphs. It is shown (i) that under neutral selection, both unconditional and conditional fixation time are shortened by increasing the number of neighbors; (ii) that under weak selection, for the simplified prisoner's dilemma game, if benefit-to-cost ratio exceeds the degree of the graph, then the unconditional fixation time of a single cooperator is slower than that in the neutral case; and (iii) that under weak selection, for the conditional fixation time, limited neighbor size dilutes the counterintuitive stochastic slowdown which was found in well-mixed populations. Interestingly, we find that all of our results can be interpreted as that in the well-mixed population with a transformed payoff matrix. This interpretation is also valid for both death-birth and birth-death processes on graphs. This interpretation bridges the fixation time in the structured population and that in the well-mixed population. Thus it opens the avenue to investigate the challenging fixation time in structured populations by the known results in well-mixed populations.

Optional games on cycles and complete graphs.

PubMed

Jeong, Hyeong-Chai; Oh, Seung-Yoon; Allen, Benjamin; Nowak, Martin A

2014-09-07

We study stochastic evolution of optional games on simple graphs. There are two strategies, A and B, whose interaction is described by a general payoff matrix. In addition, there are one or several possibilities to opt out from the game by adopting loner strategies. Optional games lead to relaxed social dilemmas. Here we explore the interaction between spatial structure and optional games. We find that increasing the number of loner strategies (or equivalently increasing mutational bias toward loner strategies) facilitates evolution of cooperation both in well-mixed and in structured populations. We derive various limits for weak selection and large population size. For some cases we derive analytic results for strong selection. We also analyze strategy selection numerically for finite selection intensity and discuss combined effects of optionality and spatial structure. Copyright © 2014 Elsevier Ltd. All rights reserved.

[A retrieval method of drug molecules based on graph collapsing].

PubMed

Qu, J W; Lv, X Q; Liu, Z M; Liao, Y; Sun, P H; Wang, B; Tang, Z

2018-04-18

To establish a compact and efficient hypergraph representation and a graph-similarity-based retrieval method of molecules to achieve effective and efficient medicine information retrieval. Chemical structural formula (CSF) was a primary search target as a unique and precise identifier for each compound at the molecular level in the research field of medicine information retrieval. To retrieve medicine information effectively and efficiently, a complete workflow of the graph-based CSF retrieval system was introduced. This system accepted the photos taken from smartphones and the sketches drawn on tablet personal computers as CSF inputs, and formalized the CSFs with the corresponding graphs. Then this paper proposed a compact and efficient hypergraph representation for molecules on the basis of analyzing factors that directly affected the efficiency of graph matching. According to the characteristics of CSFs, a hierarchical collapsing method combining graph isomorphism and frequent subgraph mining was adopted. There was yet a fundamental challenge, subgraph overlapping during the collapsing procedure, which hindered the method from establishing the correct compact hypergraph of an original CSF graph. Therefore, a graph-isomorphism-based algorithm was proposed to select dominant acyclic subgraphs on the basis of overlapping analysis. Finally, the spatial similarity among graphical CSFs was evaluated by multi-dimensional measures of similarity. To evaluate the performance of the proposed method, the proposed system was firstly compared with Wikipedia Chemical Structure Explorer (WCSE), the state-of-the-art system that allowed CSF similarity searching within Wikipedia molecules dataset, on retrieval accuracy. The system achieved higher values on mean average precision, discounted cumulative gain, rank-biased precision, and expected reciprocal rank than WCSE from the top-2 to the top-10 retrieved results. Specifically, the system achieved 10%, 1.41, 6.42%, and 1.32% higher than WCSE on these metrics for top-10 retrieval results, respectively. Moreover, several retrieval cases were presented to intuitively compare with WCSE. The results of the above comparative study demonstrated that the proposed method outperformed the existing method with regard to accuracy and effectiveness. This paper proposes a graph-similarity-based retrieval approach for medicine information. To obtain satisfactory retrieval results, an isomorphism-based algorithm is proposed for dominant subgraph selection based on the subgraph overlapping analysis, as well as an effective and efficient hypergraph representation of molecules. Experiment results demonstrate the effectiveness of the proposed approach.

Diagrams: A Visual Survey of Graphs, Maps, Charts and Diagrams for the Graphic Designer.

ERIC Educational Resources Information Center

Lockwood, Arthur

Since the ultimate success of any diagram rests in its clarity, it is important that the designer select a method of presentation which will achieve this aim. He should be aware of the various ways in which statistics can be shown diagrammatically, how information can be incorporated in maps, and how events can be plotted in chart or graph form.…

Information Selection in Intelligence Processing

DTIC Science & Technology

2011-12-01

given. Edges connecting nodes representing irrelevant persons with either relevant or irrelevant persons are added randomly, as in an Erdos- Renyi ...graph (Erdos at Renyi , 1959): For each irrelevant node i , and another node j (either relevant or irrelevant) there is a predetermined probability that...statistics for engineering and the sciences (7th ed.). Boston: Duxbury Press. Erdos, P., & Renyi , A. (1959). “On Random Graphs,” Publicationes

Sampling Large Graphs for Anticipatory Analytics

DTIC Science & Technology

2015-05-15

low. C. Random Area Sampling Random area sampling [8] is a “ snowball ” sampling method in which a set of random seed vertices are selected and areas... Sampling Large Graphs for Anticipatory Analytics Lauren Edwards, Luke Johnson, Maja Milosavljevic, Vijay Gadepally, Benjamin A. Miller Lincoln...systems, greater human-in-the-loop involvement, or through complex algorithms. We are investigating the use of sampling to mitigate these challenges

The existence of species rests on a metastable equilibrium between inbreeding and outbreeding. An essay on the close relationship between speciation, inbreeding and recessive mutations

PubMed Central

2011-01-01

Background Speciation corresponds to the progressive establishment of reproductive barriers between groups of individuals derived from an ancestral stock. Since Darwin did not believe that reproductive barriers could be selected for, he proposed that most events of speciation would occur through a process of separation and divergence, and this point of view is still shared by most evolutionary biologists today. Results I do, however, contend that, if so much speciation occurs, the most likely explanation is that there must be conditions where reproductive barriers can be directly selected for. In other words, situations where it is advantageous for individuals to reproduce preferentially within a small group and reduce their breeding with the rest of the ancestral population. This leads me to propose a model whereby new species arise not by populations splitting into separate branches, but by small inbreeding groups "budding" from an ancestral stock. This would be driven by several advantages of inbreeding, and mainly by advantageous recessive phenotypes, which could only be retained in the context of inbreeding. Reproductive barriers would thus not arise as secondary consequences of divergent evolution in populations isolated from one another, but under the direct selective pressure of ancestral stocks. Many documented cases of speciation in natural populations appear to fit the model proposed, with more speciation occurring in populations with high inbreeding coefficients, and many recessive characters identified as central to the phenomenon of speciation, with these recessive mutations expected to be surrounded by patterns of limited genomic diversity. Conclusions Whilst adaptive evolution would correspond to gains of function that would, most of the time, be dominant, this type of speciation by budding would thus be driven by mutations resulting in the advantageous loss of certain functions since recessive mutations very often correspond to the inactivation of a gene. A very important further advantage of inbreeding is that it reduces the accumulation of recessive mutations in genomes. A consequence of the model proposed is that the existence of species would correspond to a metastable equilibrium between inbreeding and outbreeding, with excessive inbreeding promoting speciation, and excessive outbreeding resulting in irreversible accumulation of recessive mutations that could ultimately only lead to extinction. Reviewer names Eugene V. Koonin, Patrick Nosil (nominated by Dr Jerzy Jurka), Pierre Pontarotti PMID:22152499

SpectralNET – an application for spectral graph analysis and visualization

PubMed Central

Forman, Joshua J; Clemons, Paul A; Schreiber, Stuart L; Haggarty, Stephen J

2005-01-01

Background Graph theory provides a computational framework for modeling a variety of datasets including those emerging from genomics, proteomics, and chemical genetics. Networks of genes, proteins, small molecules, or other objects of study can be represented as graphs of nodes (vertices) and interactions (edges) that can carry different weights. SpectralNET is a flexible application for analyzing and visualizing these biological and chemical networks. Results Available both as a standalone .NET executable and as an ASP.NET web application, SpectralNET was designed specifically with the analysis of graph-theoretic metrics in mind, a computational task not easily accessible using currently available applications. Users can choose either to upload a network for analysis using a variety of input formats, or to have SpectralNET generate an idealized random network for comparison to a real-world dataset. Whichever graph-generation method is used, SpectralNET displays detailed information about each connected component of the graph, including graphs of degree distribution, clustering coefficient by degree, and average distance by degree. In addition, extensive information about the selected vertex is shown, including degree, clustering coefficient, various distance metrics, and the corresponding components of the adjacency, Laplacian, and normalized Laplacian eigenvectors. SpectralNET also displays several graph visualizations, including a linear dimensionality reduction for uploaded datasets (Principal Components Analysis) and a non-linear dimensionality reduction that provides an elegant view of global graph structure (Laplacian eigenvectors). Conclusion SpectralNET provides an easily accessible means of analyzing graph-theoretic metrics for data modeling and dimensionality reduction. SpectralNET is publicly available as both a .NET application and an ASP.NET web application from . Source code is available upon request. PMID:16236170

SpectralNET--an application for spectral graph analysis and visualization.

PubMed

Forman, Joshua J; Clemons, Paul A; Schreiber, Stuart L; Haggarty, Stephen J

2005-10-19

Graph theory provides a computational framework for modeling a variety of datasets including those emerging from genomics, proteomics, and chemical genetics. Networks of genes, proteins, small molecules, or other objects of study can be represented as graphs of nodes (vertices) and interactions (edges) that can carry different weights. SpectralNET is a flexible application for analyzing and visualizing these biological and chemical networks. Available both as a standalone .NET executable and as an ASP.NET web application, SpectralNET was designed specifically with the analysis of graph-theoretic metrics in mind, a computational task not easily accessible using currently available applications. Users can choose either to upload a network for analysis using a variety of input formats, or to have SpectralNET generate an idealized random network for comparison to a real-world dataset. Whichever graph-generation method is used, SpectralNET displays detailed information about each connected component of the graph, including graphs of degree distribution, clustering coefficient by degree, and average distance by degree. In addition, extensive information about the selected vertex is shown, including degree, clustering coefficient, various distance metrics, and the corresponding components of the adjacency, Laplacian, and normalized Laplacian eigenvectors. SpectralNET also displays several graph visualizations, including a linear dimensionality reduction for uploaded datasets (Principal Components Analysis) and a non-linear dimensionality reduction that provides an elegant view of global graph structure (Laplacian eigenvectors). SpectralNET provides an easily accessible means of analyzing graph-theoretic metrics for data modeling and dimensionality reduction. SpectralNET is publicly available as both a .NET application and an ASP.NET web application from http://chembank.broad.harvard.edu/resources/. Source code is available upon request.

The subthalamic nucleus during decision-making with multiple alternatives.

PubMed

Keuken, Max C; Van Maanen, Leendert; Bogacz, Rafal; Schäfer, Andreas; Neumann, Jane; Turner, Robert; Forstmann, Birte U

2015-10-01

Several prominent neurocomputational models predict that an increase of choice alternatives is modulated by increased activity in the subthalamic nucleus (STN). In turn, increased STN activity allows prolonged accumulation of information. At the same time, areas in the medial frontal cortex such as the anterior cingulate cortex (ACC) and the pre-SMA are hypothesized to influence the information processing in the STN. This study set out to test concrete predictions of STN activity in multiple-alternative decision-making using a multimodal combination of 7 Tesla structural and functional Magnetic Resonance Imaging, and ancestral graph (AG) modeling. The results are in line with the predictions in that increased STN activity was found with an increasing amount of choice alternatives. In addition, our study shows that activity in the ACC is correlated with activity in the STN without directly modulating it. This result sheds new light on the information processing streams between medial frontal cortex and the basal ganglia. © 2015 Wiley Periodicals, Inc.

Maintenance and Loss of Duplicated Genes by Dosage Subfunctionalization.

PubMed

Gout, Jean-Francois; Lynch, Michael

2015-08-01

Whole-genome duplications (WGDs) have contributed to gene-repertoire enrichment in many eukaryotic lineages. However, most duplicated genes are eventually lost and it is still unclear why some duplicated genes are evolutionary successful whereas others quickly turn to pseudogenes. Here, we show that dosage constraints are major factors opposing post-WGD gene loss in several Paramecium species that share a common ancestral WGD. We propose a model where a majority of WGD-derived duplicates preserve their ancestral function and are retained to produce enough of the proteins performing this same ancestral function. Under this model, the expression level of individual duplicated genes can evolve neutrally as long as they maintain a roughly constant summed expression, and this allows random genetic drift toward uneven contributions of the two copies to total expression. Our analysis suggests that once a high level of imbalance is reached, which can require substantial lengths of time, the copy with the lowest expression level contributes a small enough fraction of the total expression that selection no longer opposes its loss. Extension of our analysis to yeast species sharing a common ancestral WGD yields similar results, suggesting that duplicated-gene retention for dosage constraints followed by divergence in expression level and eventual deterministic gene loss might be a universal feature of post-WGD evolution. © The Author 2015. Published by Oxford University Press on behalf of the Society for Molecular Biology and Evolution. All rights reserved. For permissions, please e-mail: journals.permissions@oup.com.

Adaptive Memory: Is Survival Processing Special?

ERIC Educational Resources Information Center

Nairne, James S.; Pandeirada, Josefa N. S.

2008-01-01

Do the operating characteristics of memory continue to bear the imprints of ancestral selection pressures? Previous work in our laboratory has shown that human memory may be specially tuned to retain information processed in terms of its survival relevance. A few seconds of survival processing in an incidental learning context can produce recall…

Oryza rufipogon introgressions improve yield in the U.S. cultivar Jefferson

USDA-ARS?s Scientific Manuscript database

An advanced backcross (BC2) population was developed to explore the breeding value of the wild ancestral species O. rufipogon (IRGC 105491) in a cross with the tropical japonica US variety, cv Jefferson. Early generation selection eliminated lines which possessed undesirable traits such as dormancy,...

Design tool for multiprocessor scheduling and evaluation of iterative dataflow algorithms

NASA Technical Reports Server (NTRS)

Jones, Robert L., III

1995-01-01

A graph-theoretic design process and software tool is defined for selecting a multiprocessing scheduling solution for a class of computational problems. The problems of interest are those that can be described with a dataflow graph and are intended to be executed repetitively on a set of identical processors. Typical applications include signal processing and control law problems. Graph-search algorithms and analysis techniques are introduced and shown to effectively determine performance bounds, scheduling constraints, and resource requirements. The software tool applies the design process to a given problem and includes performance optimization through the inclusion of additional precedence constraints among the schedulable tasks.

Graph Theory-Based Pinning Synchronization of Stochastic Complex Dynamical Networks.

PubMed

Li, Xiao-Jian; Yang, Guang-Hong

2017-02-01

This paper is concerned with the adaptive pinning synchronization problem of stochastic complex dynamical networks (CDNs). Based on algebraic graph theory and Lyapunov theory, pinning controller design conditions are derived, and the rigorous convergence analysis of synchronization errors in the probability sense is also conducted. Compared with the existing results, the topology structures of stochastic CDN are allowed to be unknown due to the use of graph theory. In particular, it is shown that the selection of nodes for pinning depends on the unknown lower bounds of coupling strengths. Finally, an example on a Chua's circuit network is given to validate the effectiveness of the theoretical results.

The Crossing Number of Graphs: Theory and Computation

NASA Astrophysics Data System (ADS)

Mutzel, Petra

This survey concentrates on selected theoretical and computational aspects of the crossing number of graphs. Starting with its introduction by Turán, we will discuss known results for complete and complete bipartite graphs. Then we will focus on some historical confusion on the crossing number that has been brought up by Pach and Tóth as well as Székely. A connection to computational geometry is made in the section on the geometric version, namely the rectilinear crossing number. We will also mention some applications of the crossing number to geometrical problems. This review ends with recent results on approximation and exact computations.

On Effective Graphic Communication of Health Inequality: Considerations for Health Policy Researchers.

PubMed

Asada, Yukiko; Abel, Hannah; Skedgel, Chris; Warner, Grace

2017-12-01

Policy Points: Effective graphs can be a powerful tool in communicating health inequality. The choice of graphs is often based on preferences and familiarity rather than science. According to the literature on graph perception, effective graphs allow human brains to decode visual cues easily. Dot charts are easier to decode than bar charts, and thus they are more effective. Dot charts are a flexible and versatile way to display information about health inequality. Consistent with the health risk communication literature, the captions accompanying health inequality graphs should provide a numerical, explicitly calculated description of health inequality, expressed in absolute and relative terms, from carefully thought-out perspectives. Graphs are an essential tool for communicating health inequality, a key health policy concern. The choice of graphs is often driven by personal preferences and familiarity. Our article is aimed at health policy researchers developing health inequality graphs for policy and scientific audiences and seeks to (1) raise awareness of the effective use of graphs in communicating health inequality; (2) advocate for a particular type of graph (ie, dot charts) to depict health inequality; and (3) suggest key considerations for the captions accompanying health inequality graphs. Using composite review methods, we selected the prevailing recommendations for improving graphs in scientific reporting. To find the origins of these recommendations, we reviewed the literature on graph perception and then applied what we learned to the context of health inequality. In addition, drawing from the numeracy literature in health risk communication, we examined numeric and verbal formats to explain health inequality graphs. Many disciplines offer commonsense recommendations for visually presenting quantitative data. The literature on graph perception, which defines effective graphs as those allowing the easy decoding of visual cues in human brains, shows that with their more accurate and easier-to-decode visual cues, dot charts are more effective than bar charts. Dot charts can flexibly present a large amount of information in limited space. They also can easily accommodate typical health inequality information to describe a health variable (eg, life expectancy) by an inequality domain (eg, income) with domain groups (eg, poor and rich) in a population (eg, Canada) over time periods (eg, 2010 and 2017). The numeracy literature suggests that a health inequality graph's caption should provide a numerical, explicitly calculated description of health inequality expressed in absolute and relative terms, from carefully thought-out perspectives. Given the ubiquity of graphs, the health inequality field should learn from the vibrant multidisciplinary literature how to construct effective graphic communications, especially by considering to use dot charts. © 2017 Milbank Memorial Fund.

Coalescent Inference Using Serially Sampled, High-Throughput Sequencing Data from Intrahost HIV Infection

PubMed Central

Dialdestoro, Kevin; Sibbesen, Jonas Andreas; Maretty, Lasse; Raghwani, Jayna; Gall, Astrid; Kellam, Paul; Pybus, Oliver G.; Hein, Jotun; Jenkins, Paul A.

2016-01-01

Human immunodeficiency virus (HIV) is a rapidly evolving pathogen that causes chronic infections, so genetic diversity within a single infection can be very high. High-throughput “deep” sequencing can now measure this diversity in unprecedented detail, particularly since it can be performed at different time points during an infection, and this offers a potentially powerful way to infer the evolutionary dynamics of the intrahost viral population. However, population genomic inference from HIV sequence data is challenging because of high rates of mutation and recombination, rapid demographic changes, and ongoing selective pressures. In this article we develop a new method for inference using HIV deep sequencing data, using an approach based on importance sampling of ancestral recombination graphs under a multilocus coalescent model. The approach further extends recent progress in the approximation of so-called conditional sampling distributions, a quantity of key interest when approximating coalescent likelihoods. The chief novelties of our method are that it is able to infer rates of recombination and mutation, as well as the effective population size, while handling sampling over different time points and missing data without extra computational difficulty. We apply our method to a data set of HIV-1, in which several hundred sequences were obtained from an infected individual at seven time points over 2 years. We find mutation rate and effective population size estimates to be comparable to those produced by the software BEAST. Additionally, our method is able to produce local recombination rate estimates. The software underlying our method, Coalescenator, is freely available. PMID:26857628

Individualized Selection of Beam Angles and Treatment Isocenter in Tangential Breast Intensity Modulated Radiation Therapy

DOE Office of Scientific and Technical Information (OSTI.GOV)

Penninkhof, Joan, E-mail: j.penninkhof@erasmusmc.nl; Spadola, Sara; Department of Physics and Astronomy, Alma Mater Studiorum, University of Bologna, Bologna

Purpose and Objective: Propose a novel method for individualized selection of beam angles and treatment isocenter in tangential breast intensity modulated radiation therapy (IMRT). Methods and Materials: For each patient, beam and isocenter selection starts with the fully automatic generation of a large database of IMRT plans (up to 847 in this study); each of these plans belongs to a unique combination of isocenter position, lateral beam angle, and medial beam angle. The imposed hard planning constraint on patient maximum dose may result in plans with unacceptable target dose delivery. Such plans are excluded from further analyses. Owing to differencesmore » in beam setup, database plans differ in mean doses to organs at risk (OARs). These mean doses are used to construct 2-dimensional graphs, showing relationships between: (1) contralateral breast dose and ipsilateral lung dose; and (2) contralateral breast dose and heart dose (analyzed only for left-sided). The graphs can be used for selection of the isocenter and beam angles with the optimal, patient-specific tradeoffs between the mean OAR doses. For 30 previously treated patients (15 left-sided and 15 right-sided tumors), graphs were generated considering only the clinically applied isocenter with 121 tangential beam angle pairs. For 20 of the 30 patients, 6 alternative isocenters were also investigated. Results: Computation time for automatic generation of 121 IMRT plans took on average 30 minutes. The generated graphs demonstrated large variations in tradeoffs between conflicting OAR objectives, depending on beam angles and patient anatomy. For patients with isocenter optimization, 847 IMRT plans were considered. Adding isocenter position optimization next to beam angle optimization had a small impact on the final plan quality. Conclusion: A method is proposed for individualized selection of beam angles in tangential breast IMRT. This may be especially important for patients with cardiac risk factors or an enhanced risk for the development of contralateral breast cancer.« less

Automatic system for detecting pornographic images

NASA Astrophysics Data System (ADS)

Ho, Kevin I. C.; Chen, Tung-Shou; Ho, Jun-Der

2002-09-01

Due to the dramatic growth of network and multimedia technology, people can more easily get variant information by using Internet. Unfortunately, it also makes the diffusion of illegal and harmful content much easier. So, it becomes an important topic for the Internet society to protect and safeguard Internet users from these content that may be encountered while surfing on the Net, especially children. Among these content, porno graphs cause more serious harm. Therefore, in this study, we propose an automatic system to detect still colour porno graphs. Starting from this result, we plan to develop an automatic system to search porno graphs or to filter porno graphs. Almost all the porno graphs possess one common characteristic that is the ratio of the size of skin region and non-skin region is high. Based on this characteristic, our system first converts the colour space from RGB colour space to HSV colour space so as to segment all the possible skin-colour regions from scene background. We also apply the texture analysis on the selected skin-colour regions to separate the skin regions from non-skin regions. Then, we try to group the adjacent pixels located in skin regions. If the ratio is over a given threshold, we can tell if the given image is a possible porno graph. Based on our experiment, less than 10% of non-porno graphs are classified as pornography, and over 80% of the most harmful porno graphs are classified correctly.

Rapid adaptation to a novel host in a seed beetle (Callosobruchus maculatus): the role of sexual selection.

PubMed

Fricke, Claudia; Arnqvist, Göran

2007-02-01

Rapid diversification is common among herbivorous insects and is often the result of host shifts, leading to the exploitation of novel food sources. This, in turn, is associated with adaptive evolution of female oviposition behavior and larval feeding biology. Although natural selection is the typical driver of such adaptation, the role of sexual selection is less clear. In theory, sexual selection can either accelerate or impede adaptation. To assess the independent effects of natural and sexual selection on the rate of adaptation, we performed a laboratory natural selection experiment in a herbivorous bruchid beetle (Callosobruchus maculatus). We established replicated selection lines where we varied natural (food type) and sexual (mating system) selection in a 2 x 2 orthogonal design, and propagated our lines for 35 generations. In half of the lines, we induced a host shift whereas the other half was kept on the ancestral host. We experimentally enforced monogamy in half of the lines, whereas the other half remained polygamous. The beetles rapidly adapted to the novel host, which primarily involved increased host acceptance by females and an accelerated rate of larval development. We also found that our mating system treatment affected the rate of adaptation, but that this effect was contingent upon food type. As beetles adapted to the novel host, sexual selection reinforced natural selection whereas populations residing close to their adaptive peak (i.e., those using their ancestral host) exhibited higher fitness in the absence of sexual selection. We discuss our findings in light of current sexual selection theory and suggest that the net evolutionary effect of reproductive competition may critically depend on natural selection. Sexual selection may commonly accelerate adaptation under directional natural selection whereas sexual selection, and the associated load brought by sexual conflict, may tend to depress population fitness under stabilizing natural selection.

Robust Joint Graph Sparse Coding for Unsupervised Spectral Feature Selection.

PubMed

Zhu, Xiaofeng; Li, Xuelong; Zhang, Shichao; Ju, Chunhua; Wu, Xindong

2017-06-01

In this paper, we propose a new unsupervised spectral feature selection model by embedding a graph regularizer into the framework of joint sparse regression for preserving the local structures of data. To do this, we first extract the bases of training data by previous dictionary learning methods and, then, map original data into the basis space to generate their new representations, by proposing a novel joint graph sparse coding (JGSC) model. In JGSC, we first formulate its objective function by simultaneously taking subspace learning and joint sparse regression into account, then, design a new optimization solution to solve the resulting objective function, and further prove the convergence of the proposed solution. Furthermore, we extend JGSC to a robust JGSC (RJGSC) via replacing the least square loss function with a robust loss function, for achieving the same goals and also avoiding the impact of outliers. Finally, experimental results on real data sets showed that both JGSC and RJGSC outperformed the state-of-the-art algorithms in terms of k -nearest neighbor classification performance.

Stream gage descriptions and streamflow statistics for sites in the Tigris River and Euphrates River Basins, Iraq

USGS Publications Warehouse

Saleh, Dina K.

2010-01-01

Statistical summaries of streamflow data for all long-term streamflow-gaging stations in the Tigris River and Euphrates River Basins in Iraq are presented in this report. The summaries for each streamflow-gaging station include (1) a station description, (2) a graph showing annual mean discharge for the period of record, (3) a table of extremes and statistics for monthly and annual mean discharge, (4) a graph showing monthly maximum, minimum, and mean discharge, (5) a table of monthly and annual mean discharges for the period of record, (6) a graph showing annual flow duration, (7) a table of monthly and annual flow duration, (8) a table of high-flow frequency data (maximum mean discharge for 3-, 7-, 15-, and 30-day periods for selected exceedance probabilities), and (9) a table of low-flow frequency data (minimum mean discharge for 3-, 7-, 15-, 30-, 60-, 90-, and 183-day periods for selected non-exceedance probabilities).

Communicating patient-reported outcome scores using graphic formats: results from a mixed-methods evaluation.

PubMed

Brundage, Michael D; Smith, Katherine C; Little, Emily A; Bantug, Elissa T; Snyder, Claire F

2015-10-01

Patient-reported outcomes (PROs) promote patient-centered care by using PRO research results ("group-level data") to inform decision making and by monitoring individual patient's PROs ("individual-level data") to inform care. We investigated the interpretability of current PRO data presentation formats. This cross-sectional mixed-methods study randomized purposively sampled cancer patients and clinicians to evaluate six group-data or four individual-data formats. A self-directed exercise assessed participants' interpretation accuracy and ratings of ease-of-understanding and usefulness (0 = least to 10 = most) of each format. Semi-structured qualitative interviews explored helpful and confusing format attributes. We reached thematic saturation with 50 patients (44 % < college graduate) and 20 clinicians. For group-level data, patients rated simple line graphs highest for ease-of-understanding and usefulness (median 8.0; 33 % selected for easiest to understand/most useful) and clinicians rated simple line graphs highest for ease-of-understanding and usefulness (median 9.0, 8.5) but most often selected line graphs with confidence limits or norms (30 % for each format for easiest to understand/most useful). Qualitative results support that clinicians value confidence intervals, norms, and p values, but patients find them confusing. For individual-level data, both patients and clinicians rated line graphs highest for ease-of-understanding (median 8.0 patients, 8.5 clinicians) and usefulness (median 8.0, 9.0) and selected them as easiest to understand (50, 70 %) and most useful (62, 80 %). The qualitative interviews supported highlighting scores requiring clinical attention and providing reference values. This study has identified preferences and opportunities for improving on current formats for PRO presentation and will inform development of best practices for PRO presentation. Both patients and clinicians prefer line graphs across group-level data and individual-level data formats, but clinicians prefer greater detail (e.g., statistical details) for group-level data.

Ancestral state reconstruction infers phytopathogenic origins of sooty blotch and flyspeck fungi on apple.

PubMed

Ismail, Siti Izera; Batzer, Jean Carlson; Harrington, Thomas C; Crous, Pedro W; Lavrov, Dennis V; Li, Huanyu; Gleason, Mark L

2016-01-01

Members of the sooty blotch and flyspeck (SBFS) complex are epiphytic fungi in the Ascomycota that cause economically damaging blemishes of apples worldwide. SBFS fungi are polyphyletic, but approx. 96% of SBFS species are in the Capnodiales. Evolutionary origins of SBFS fungi remain unclear, so we attempted to infer their origins by means of ancestral state reconstruction on a phylogenetic tree built utilizing genes for the nuc 28S rDNA (approx. 830 bp from near the 59 end) and the second largest subunit of RNA polymerase II (RPB2). The analyzed taxa included the well-known genera of SBFS as well as non-SBFS fungi from seven families within the Capnodiales. The non-SBFS taxa were selected based on their distinct ecological niches, including plant-parasitic and saprophytic species. The phylogenetic analyses revealed that most SBFS species in the Capnodiales are closely related to plant-parasitic fungi. Ancestral state reconstruction provided strong evidence that plant-parasitic fungi were the ancestors of the major SBFS lineages. Knowledge gained from this study may help to better understand the ecology and evolution of epiphytic fungi. © 2016 by The Mycological Society of America.

The evolution of genes encoding for green fluorescent proteins: insights from cephalochordates (amphioxus)

NASA Astrophysics Data System (ADS)

Yue, Jia-Xing; Holland, Nicholas D.; Holland, Linda Z.; Deheyn, Dimitri D.

2016-06-01

Green Fluorescent Protein (GFP) was originally found in cnidarians, and later in copepods and cephalochordates (amphioxus) (Branchiostoma spp). Here, we looked for GFP-encoding genes in Asymmetron, an early-diverged cephalochordate lineage, and found two such genes closely related to some of the Branchiostoma GFPs. Dim fluorescence was found throughout the body in adults of Asymmetron lucayanum, and, as in Branchiostoma floridae, was especially intense in the ripe ovaries. Spectra of the fluorescence were similar between Asymmetron and Branchiostoma. Lineage-specific expansion of GFP-encoding genes in the genus Branchiostoma was observed, largely driven by tandem duplications. Despite such expansion, purifying selection has strongly shaped the evolution of GFP-encoding genes in cephalochordates, with apparent relaxation for highly duplicated clades. All cephalochordate GFP-encoding genes are quite different from those of copepods and cnidarians. Thus, the ancestral cephalochordates probably had GFP, but since GFP appears to be lacking in more early-diverged deuterostomes (echinoderms, hemichordates), it is uncertain whether the ancestral cephalochordates (i.e. the common ancestor of Asymmetron and Branchiostoma) acquired GFP by horizontal gene transfer (HGT) from copepods or cnidarians or inherited it from the common ancestor of copepods and deuterostomes, i.e. the ancestral bilaterians.

Adaptive Memory: Is There a Reproduction-Processing Effect?

PubMed

Seitz, Benjamin M; Polack, Cody W; Miller, Ralph R

2017-12-14

Like all biological systems, human memory is likely to have been influenced by evolutionary processes, and its abilities have been subjected to selective mechanisms. Consequently, human memory should be primed to better remember information relevant to one's evolutionary fitness. Supporting this view, participants asked to rate words based on their relevance to an imaginary survival situation better recall those words (even the words rated low in relevancy) than the same words rated with respect to non-survival situations. This mnemonic advantage is called the "survival-processing effect," and presumably it was selected for because it contributed to evolutionary fitness. The same reasoning suggests that there should be an advantage for recall of information that has been rated for relevancy to reproduction and/or mate seeking, although little evidence has existed to assess this proposition. We used an experimental design similar to that in the original survival-processing effect study (Nairne, Thompson, & Pandeirada, 2007) and across 3 experiments tested several newly designed scenarios to determine whether a reproduction-processing effect could be found in an ancestral environment, a modern mating environment, and an ancestral environment in which the emphasis was on raising offspring as opposed to finding a mate. Our results replicated the survival-processing effect but provided no evidence of a reproduction-processing effect when the scenario emphasized finding a mate. However, when rating items on their relevancy to raising one's offspring in an ancestral environment, a mnemonic advantage comparable to that of the survival-processing effect was found. (PsycINFO Database Record (c) 2017 APA, all rights reserved).

Heterogeneity of phenotypic characteristics of the modern and ancestral Beijing strains of Mycobacterium tuberculosis.

PubMed

Faksri, Kiatichai; Chaiprasert, Angkana; Pardieu, Clarie; Casali, Nicola; Palaga, Tanapat; Prammananan, Therdsak; Palittapongarnpim, Prasit; Prayoonwiwat, Naraporn; Drobniewski, Francis

2014-06-01

The Beijing strain of Mycobacterium tuberculosis (MTB) is of great concern because this hypervirulent strain has caused numerous tuberculosis outbreaks. However, the mechanisms that allow the MTB Beijing strain to be highly pathogenic remain unclear and previous studies have revealed heterogeneity within this family. To determine the association between some phenotypic characteristics and phylogroups of the Beijing strain of MTB. Eight Beijing strains, 5 modern and 3 ancestral sublineages, were selected from the phylogroups of MTB. The selection was based on copy number of IS6110 at NTF, region of differences, and single nucleotide polymorphisms. The abilities of these strains to grow intracellularly in THP-1 macrophages, to induce apoptosis, necrosis, and cytokines production were examined using quantitative real-time PCR and commercially available ELISA kits, respectively. There were some significant differences between the two sublineages of the Beijing strain of MTB. The ancestral Beijing sublineages showed higher intracellular growth rates (p < 0.05) and necrosis induction rates (p < 0.01) than the modern Beijing sublineages. By contrast, the modern Beijing sublineages induced lower apoptosis and protective cytokine responses, i.e., TNF-α (p < 0.05) and IL-6 (p < 0.01) and higher non-protective IL-10 response. The modern Beijing sublineages may have evolved so that they have greater ability to diminish host defense mechanisms. The slower growth rate and reduced necrosis induction in host cells might allow the bacteria to cause a persistent infection. The results revealed a phylogroup-associated heterogeneity of phenotypes among MTB Beijing sublineages.

Fingerprint recognition system by use of graph matching

NASA Astrophysics Data System (ADS)

Shen, Wei; Shen, Jun; Zheng, Huicheng

2001-09-01

Fingerprint recognition is an important subject in biometrics to identify or verify persons by physiological characteristics, and has found wide applications in different domains. In the present paper, we present a finger recognition system that combines singular points and structures. The principal steps of processing in our system are: preprocessing and ridge segmentation, singular point extraction and selection, graph representation, and finger recognition by graphs matching. Our fingerprint recognition system is implemented and tested for many fingerprint images and the experimental result are satisfactory. Different techniques are used in our system, such as fast calculation of orientation field, local fuzzy dynamical thresholding, algebraic analysis of connections and fingerprints representation and matching by graphs. Wed find that for fingerprint database that is not very large, the recognition rate is very high even without using a prior coarse category classification. This system works well for both one-to-few and one-to-many problems.

Browsing schematics: Query-filtered graphs with context nodes

NASA Technical Reports Server (NTRS)

Ciccarelli, Eugene C.; Nardi, Bonnie A.

1988-01-01

The early results of a research project to create tools for building interfaces to intelligent systems on the NASA Space Station are reported. One such tool is the Schematic Browser which helps users engaged in engineering problem solving find and select schematics from among a large set. Users query for schematics with certain components, and the Schematic Browser presents a graph whose nodes represent the schematics with those components. The query greatly reduces the number of choices presented to the user, filtering the graph to a manageable size. Users can reformulate and refine the query serially until they locate the schematics of interest. To help users maintain orientation as they navigate a large body of data, the graph also includes nodes that are not matches but provide global and local context for the matching nodes. Context nodes include landmarks, ancestors, siblings, children and previous matches.

GE-17ALTERATION OF THE p53 PATHWAY AND ANCESTRAL PROGENITORS ARE ASSOCIATED WITH TUMOR RECURRENCE IN GLIOBLASTOMA

PubMed Central

Kim, Hoon; Zheng, Siyuan; Amini, Seyed; Virk, Selene; Mikkelsen, Tom; Brat, Daniel; Sougnez, Carrie; Muller, Florian; Hu, Jian; Sloan, Andrew; Cohen, Mark; Van Meir, Erwin; Scarpace, Lisa; Lander, Eric; Gabriel, Stacey; Getz, Gad; Meyerson, Matthew; Chin, Lynda; Barnholtz-Sloan, Jill; Verhaak, Roel

2014-01-01

To evaluate evolutionary patterns of GBM recurrence, we analyzed whole genome sequencing (WGS) and multi-sector exome sequencing data from pairs of primary and posttreatment GBM. WGS on ten primary-recurrent pairs detected a median number of 12,214 mutations which we utilized to uncover clonal structures, by analyzing the distribution of mutation cellular frequencies (the fraction of tumor cells harboring a mutation). On average, 41 % of the mutations were shared by primary and recurrence. The majority of shared mutations were clonal in both primary and recurrence, but we also observed many clonal mutations that were uniquely detected in either the primary or the recurrence. This raises the intriguing possibility that major tumor clones in the primary tumor and disease relapse both evolved from a shared ancestral tumor cell population. At least one subclone was identified in the majority of WGS samples, and we observed groups of mutations that were at low cancer cell fractions in both primary and recurrence, suggesting that both subclones evolved from the same ancestral tumor cells separate from the major clone ancestral cells. To address the possibility that the lack of overlap between subsequent tumors was due to intratumoral heterogeneity, we analyzed exome sequencing from a second tumor sector of seven primary and six recurrent tumors. We found that the majority of "second biopsy" mutations were not conserved between time points, suggesting that intratumoral heterogeneity did not explain the large number of mutations uniquely detected in primary and recurrence. The limited overlap of mutations in primary and recurrence provides evidence for ancestral tumor cell populations that could not be eradicated by therapy, while offspring cell populations contained unique mutations, were selectively killed by treatment and could therefore no longer be detected after disease relapse. This study has provided new insights into patterns and dynamics of tumor evolution.

Mechanisms for the Evolution of a Derived Function in the Ancestral Glucocorticoid Receptor

PubMed Central

Carroll, Sean Michael; Ortlund, Eric A.; Thornton, Joseph W.

2011-01-01

Understanding the genetic, structural, and biophysical mechanisms that caused protein functions to evolve is a central goal of molecular evolutionary studies. Ancestral sequence reconstruction (ASR) offers an experimental approach to these questions. Here we use ASR to shed light on the earliest functions and evolution of the glucocorticoid receptor (GR), a steroid-activated transcription factor that plays a key role in the regulation of vertebrate physiology. Prior work showed that GR and its paralog, the mineralocorticoid receptor (MR), duplicated from a common ancestor roughly 450 million years ago; the ancestral functions were largely conserved in the MR lineage, but the functions of GRs—reduced sensitivity to all hormones and increased selectivity for glucocorticoids—are derived. Although the mechanisms for the evolution of glucocorticoid specificity have been identified, how reduced sensitivity evolved has not yet been studied. Here we report on the reconstruction of the deepest ancestor in the GR lineage (AncGR1) and demonstrate that GR's reduced sensitivity evolved before the acquisition of restricted hormone specificity, shortly after the GR–MR split. Using site-directed mutagenesis, X-ray crystallography, and computational analyses of protein stability to recapitulate and determine the effects of historical mutations, we show that AncGR1's reduced ligand sensitivity evolved primarily due to three key substitutions. Two large-effect mutations weakened hydrogen bonds and van der Waals interactions within the ancestral protein, reducing its stability. The degenerative effect of these two mutations is extremely strong, but a third permissive substitution, which has no apparent effect on function in the ancestral background and is likely to have occurred first, buffered the effects of the destabilizing mutations. Taken together, our results highlight the potentially creative role of substitutions that partially degrade protein structure and function and reinforce the importance of permissive mutations in protein evolution. PMID:21698144

Mechanisms for the Evolution of a Derived Function in the Ancestral Glucocorticoid Receptor

DOE Office of Scientific and Technical Information (OSTI.GOV)

Carroll, Sean Michael; Ortlund, Eric A; Thornton, Joseph W.

2012-03-16

Understanding the genetic, structural, and biophysical mechanisms that caused protein functions to evolve is a central goal of molecular evolutionary studies. Ancestral sequence reconstruction (ASR) offers an experimental approach to these questions. Here we use ASR to shed light on the earliest functions and evolution of the glucocorticoid receptor (GR), a steroid-activated transcription factor that plays a key role in the regulation of vertebrate physiology. Prior work showed that GR and its paralog, the mineralocorticoid receptor (MR), duplicated from a common ancestor roughly 450 million years ago; the ancestral functions were largely conserved in the MR lineage, but the functionsmore » of GRs - reduced sensitivity to all hormones and increased selectivity for glucocorticoids - are derived. Although the mechanisms for the evolution of glucocorticoid specificity have been identified, how reduced sensitivity evolved has not yet been studied. Here we report on the reconstruction of the deepest ancestor in the GR lineage (AncGR1) and demonstrate that GR's reduced sensitivity evolved before the acquisition of restricted hormone specificity, shortly after the GR-MR split. Using site-directed mutagenesis, X-ray crystallography, and computational analyses of protein stability to recapitulate and determine the effects of historical mutations, we show that AncGR1's reduced ligand sensitivity evolved primarily due to three key substitutions. Two large-effect mutations weakened hydrogen bonds and van der Waals interactions within the ancestral protein, reducing its stability. The degenerative effect of these two mutations is extremely strong, but a third permissive substitution, which has no apparent effect on function in the ancestral background and is likely to have occurred first, buffered the effects of the destabilizing mutations. Taken together, our results highlight the potentially creative role of substitutions that partially degrade protein structure and function and reinforce the importance of permissive mutations in protein evolution.« less

An abbreviated SNP panel for ancestry assignment of honeybees (Apis mellifera)

USDA-ARS?s Scientific Manuscript database

This paper examines whether an abbreviated panel of 37 single nucleotide polymorphisms (SNPs) has the same power as a larger and more expensive panel of 95 SNPs to assign ancestry of honeybees (Apis mellifera) to three ancestral lineages. We selected 37 SNPs from the original 95 SNP panel using alle...

Object segmentation using graph cuts and active contours in a pyramidal framework

NASA Astrophysics Data System (ADS)

Subudhi, Priyambada; Mukhopadhyay, Susanta

2018-03-01

Graph cuts and active contours are two very popular interactive object segmentation techniques in the field of computer vision and image processing. However, both these approaches have their own well-known limitations. Graph cut methods perform efficiently giving global optimal segmentation result for smaller images. However, for larger images, huge graphs need to be constructed which not only takes an unacceptable amount of memory but also increases the time required for segmentation to a great extent. On the other hand, in case of active contours, initial contour selection plays an important role in the accuracy of the segmentation. So a proper selection of initial contour may improve the complexity as well as the accuracy of the result. In this paper, we have tried to combine these two approaches to overcome their above-mentioned drawbacks and develop a fast technique of object segmentation. Here, we have used a pyramidal framework and applied the mincut/maxflow algorithm on the lowest resolution image with the least number of seed points possible which will be very fast due to the smaller size of the image. Then, the obtained segmentation contour is super-sampled and and worked as the initial contour for the next higher resolution image. As the initial contour is very close to the actual contour, so fewer number of iterations will be required for the convergence of the contour. The process is repeated for all the high-resolution images and experimental results show that our approach is faster as well as memory efficient as compare to both graph cut or active contour segmentation alone.

Similarity-balanced discriminant neighbor embedding and its application to cancer classification based on gene expression data.

PubMed

Zhang, Li; Qian, Liqiang; Ding, Chuntao; Zhou, Weida; Li, Fanzhang

2015-09-01

The family of discriminant neighborhood embedding (DNE) methods is typical graph-based methods for dimension reduction, and has been successfully applied to face recognition. This paper proposes a new variant of DNE, called similarity-balanced discriminant neighborhood embedding (SBDNE) and applies it to cancer classification using gene expression data. By introducing a novel similarity function, SBDNE deals with two data points in the same class and the different classes with different ways. The homogeneous and heterogeneous neighbors are selected according to the new similarity function instead of the Euclidean distance. SBDNE constructs two adjacent graphs, or between-class adjacent graph and within-class adjacent graph, using the new similarity function. According to these two adjacent graphs, we can generate the local between-class scatter and the local within-class scatter, respectively. Thus, SBDNE can maximize the between-class scatter and simultaneously minimize the within-class scatter to find the optimal projection matrix. Experimental results on six microarray datasets show that SBDNE is a promising method for cancer classification. Copyright © 2015 Elsevier Ltd. All rights reserved.

Spectral Upscaling for Graph Laplacian Problems with Application to Reservoir Simulation

DOE PAGES

Barker, Andrew T.; Lee, Chak S.; Vassilevski, Panayot S.

2017-10-26

Here, we consider coarsening procedures for graph Laplacian problems written in a mixed saddle-point form. In that form, in addition to the original (vertex) degrees of freedom (dofs), we also have edge degrees of freedom. We extend previously developed aggregation-based coarsening procedures applied to both sets of dofs to now allow more than one coarse vertex dof per aggregate. Those dofs are selected as certain eigenvectors of local graph Laplacians associated with each aggregate. Additionally, we coarsen the edge dofs by using traces of the discrete gradients of the already constructed coarse vertex dofs. These traces are defined on themore » interface edges that connect any two adjacent aggregates. The overall procedure is a modification of the spectral upscaling procedure developed in for the mixed finite element discretization of diffusion type PDEs which has the important property of maintaining inf-sup stability on coarse levels and having provable approximation properties. We consider applications to partitioning a general graph and to a finite volume discretization interpreted as a graph Laplacian, developing consistent and accurate coarse-scale models of a fine-scale problem.« less

Disconnection of network hubs and cognitive impairment after traumatic brain injury.

PubMed

Fagerholm, Erik D; Hellyer, Peter J; Scott, Gregory; Leech, Robert; Sharp, David J

2015-06-01

Traumatic brain injury affects brain connectivity by producing traumatic axonal injury. This disrupts the function of large-scale networks that support cognition. The best way to describe this relationship is unclear, but one elegant approach is to view networks as graphs. Brain regions become nodes in the graph, and white matter tracts the connections. The overall effect of an injury can then be estimated by calculating graph metrics of network structure and function. Here we test which graph metrics best predict the presence of traumatic axonal injury, as well as which are most highly associated with cognitive impairment. A comprehensive range of graph metrics was calculated from structural connectivity measures for 52 patients with traumatic brain injury, 21 of whom had microbleed evidence of traumatic axonal injury, and 25 age-matched controls. White matter connections between 165 grey matter brain regions were defined using tractography, and structural connectivity matrices calculated from skeletonized diffusion tensor imaging data. This technique estimates injury at the centre of tract, but is insensitive to damage at tract edges. Graph metrics were calculated from the resulting connectivity matrices and machine-learning techniques used to select the metrics that best predicted the presence of traumatic brain injury. In addition, we used regularization and variable selection via the elastic net to predict patient behaviour on tests of information processing speed, executive function and associative memory. Support vector machines trained with graph metrics of white matter connectivity matrices from the microbleed group were able to identify patients with a history of traumatic brain injury with 93.4% accuracy, a result robust to different ways of sampling the data. Graph metrics were significantly associated with cognitive performance: information processing speed (R(2) = 0.64), executive function (R(2) = 0.56) and associative memory (R(2) = 0.25). These results were then replicated in a separate group of patients without microbleeds. The most influential graph metrics were betweenness centrality and eigenvector centrality, which provide measures of the extent to which a given brain region connects other regions in the network. Reductions in betweenness centrality and eigenvector centrality were particularly evident within hub regions including the cingulate cortex and caudate. Our results demonstrate that betweenness centrality and eigenvector centrality are reduced within network hubs, due to the impact of traumatic axonal injury on network connections. The dominance of betweenness centrality and eigenvector centrality suggests that cognitive impairment after traumatic brain injury results from the disconnection of network hubs by traumatic axonal injury. © The Author (2015). Published by Oxford University Press on behalf of the Guarantors of Brain.

Ancestral Variations in the Shape and Size of the Zygoma.

PubMed

Oettlé, Anna C; Demeter, Fabrice P; L'abbé, Ericka N

2017-01-01

The variable development of the zygoma, dictating its shape and size variations among ancestral groups, has important clinical implications and valuable anthropological and evolutionary inferences. The purpose of the study was to review the literature regarding the variations in the zygoma with ancestry. Ancestral variation in the zygoma reflects genetic variations because of genetic drift as well as natural selection and epigenetic changes to adapt to diet and climate variations with possible intensification by isolation. Prominence of the zygoma, zygomaxillary tuberosity, and malar tubercle have been associated with Eastern Asian populations in whom these features intensified. Prominence of the zygoma is also associated with groups from Eastern Europe and the rest of Asia. Diffusion of these traits occurred across the Behring Sea to the Arctic areas and to North and South America. The greatest zygomatic projections are exhibited in Arctic groups as an adaptation to extreme cold conditions, while Native South American groups also present with other features of facial robusticity. Groups from Australia, Malaysia, and Oceania show prominence of the zygoma to a certain extent, possibly because of archaic occupations by undifferentiated Southeast Asian populations. More recent interactions with Chinese groups might explain the prominent cheekbones noted in certain South African groups. Many deductions regarding evolutionary processes and diversifications of early groups have been made. Cognisance of these ancestral variations also have implications for forensic anthropological assessments as well as plastic and reconstructive surgery. More studies are needed to improve accuracy of forensic anthropological identification techniques. Anat Rec, 300:196-208, 2017. © 2016 Wiley Periodicals, Inc. © 2016 Wiley Periodicals, Inc.

Reduction of Ethanol Yield and Improvement of Glycerol Formation by Adaptive Evolution of the Wine Yeast Saccharomyces cerevisiae under Hyperosmotic Conditions

PubMed Central

Tilloy, Valentin; Ortiz-Julien, Anne

2014-01-01

There is a strong demand from the wine industry for methodologies to reduce the alcohol content of wine without compromising wine's sensory characteristics. We assessed the potential of adaptive laboratory evolution strategies under hyperosmotic stress for generation of Saccharomyces cerevisiae wine yeast strains with enhanced glycerol and reduced ethanol yields. Experimental evolution on KCl resulted, after 200 generations, in strains that had higher glycerol and lower ethanol production than the ancestral strain. This major metabolic shift was accompanied by reduced fermentative capacities, suggesting a trade-off between high glycerol production and fermentation rate. Several evolved strains retaining good fermentation performance were selected. These strains produced more succinate and 2,3-butanediol than the ancestral strain and did not accumulate undesirable organoleptic compounds, such as acetate, acetaldehyde, or acetoin. They survived better under osmotic stress and glucose starvation conditions than the ancestral strain, suggesting that the forces that drove the redirection of carbon fluxes involved a combination of osmotic and salt stresses and carbon limitation. To further decrease the ethanol yield, a breeding strategy was used, generating intrastrain hybrids that produced more glycerol than the evolved strain. Pilot-scale fermentation on Syrah using evolved and hybrid strains produced wine with 0.6% (vol/vol) and 1.3% (vol/vol) less ethanol, more glycerol and 2,3-butanediol, and less acetate than the ancestral strain. This work demonstrates that the combination of adaptive evolution and breeding is a valuable alternative to rational design for remodeling the yeast metabolic network. PMID:24532067

Changes in exon–intron structure during vertebrate evolution affect the splicing pattern of exons

PubMed Central

Gelfman, Sahar; Burstein, David; Penn, Osnat; Savchenko, Anna; Amit, Maayan; Schwartz, Schraga; Pupko, Tal; Ast, Gil

2012-01-01

Exon–intron architecture is one of the major features directing the splicing machinery to the short exons that are located within long flanking introns. However, the evolutionary dynamics of exon–intron architecture and its impact on splicing is largely unknown. Using a comparative genomic approach, we analyzed 17 vertebrate genomes and reconstructed the ancestral motifs of both 3′ and 5′ splice sites, as also the ancestral length of exons and introns. Our analyses suggest that vertebrate introns increased in length from the shortest ancestral introns to the longest primate introns. An evolutionary analysis of splice sites revealed that weak splice sites act as a restrictive force keeping introns short. In contrast, strong splice sites allow recognition of exons flanked by long introns. Reconstruction of the ancestral state suggests these phenomena were not prevalent in the vertebrate ancestor, but appeared during vertebrate evolution. By calculating evolutionary rate shifts in exons, we identified cis-acting regulatory sequences that became fixed during the transition from early vertebrates to mammals. Experimental validations performed on a selection of these hexamers confirmed their regulatory function. We additionally revealed many features of exons that can discriminate alternative from constitutive exons. These features were integrated into a machine-learning approach to predict whether an exon is alternative. Our algorithm obtains very high predictive power (AUC of 0.91), and using these predictions we have identified and successfully validated novel alternatively spliced exons. Overall, we provide novel insights regarding the evolutionary constraints acting upon exons and their recognition by the splicing machinery. PMID:21974994

High-performance analysis of filtered semantic graphs

DOE Office of Scientific and Technical Information (OSTI.GOV)

Buluc, Aydin; Fox, Armando; Gilbert, John R.

2012-01-01

High performance is a crucial consideration when executing a complex analytic query on a massive semantic graph. In a semantic graph, vertices and edges carry "attributes" of various types. Analytic queries on semantic graphs typically depend on the values of these attributes; thus, the computation must either view the graph through a filter that passes only those individual vertices and edges of interest, or else must first materialize a subgraph or subgraphs consisting of only the vertices and edges of interest. The filtered approach is superior due to its generality, ease of use, and memory efficiency, but may carry amore » performance cost. In the Knowledge Discovery Toolbox (KDT), a Python library for parallel graph computations, the user writes filters in a high-level language, but those filters result in relatively low performance due to the bottleneck of having to call into the Python interpreter for each edge. In this work, we use the Selective Embedded JIT Specialization (SEJITS) approach to automatically translate filters defined by programmers into a lower-level efficiency language, bypassing the upcall into Python. We evaluate our approach by comparing it with the high-performance C++ /MPI Combinatorial BLAS engine, and show that the productivity gained by using a high-level filtering language comes without sacrificing performance.« less

Scaling Up Graph-Based Semisupervised Learning via Prototype Vector Machines

PubMed Central

Zhang, Kai; Lan, Liang; Kwok, James T.; Vucetic, Slobodan; Parvin, Bahram

2014-01-01

When the amount of labeled data are limited, semi-supervised learning can improve the learner's performance by also using the often easily available unlabeled data. In particular, a popular approach requires the learned function to be smooth on the underlying data manifold. By approximating this manifold as a weighted graph, such graph-based techniques can often achieve state-of-the-art performance. However, their high time and space complexities make them less attractive on large data sets. In this paper, we propose to scale up graph-based semisupervised learning using a set of sparse prototypes derived from the data. These prototypes serve as a small set of data representatives, which can be used to approximate the graph-based regularizer and to control model complexity. Consequently, both training and testing become much more efficient. Moreover, when the Gaussian kernel is used to define the graph affinity, a simple and principled method to select the prototypes can be obtained. Experiments on a number of real-world data sets demonstrate encouraging performance and scaling properties of the proposed approach. It also compares favorably with models learned via ℓ1-regularization at the same level of model sparsity. These results demonstrate the efficacy of the proposed approach in producing highly parsimonious and accurate models for semisupervised learning. PMID:25720002

Multifield-graphs: an approach to visualizing correlations in multifield scalar data.

PubMed

Sauber, Natascha; Theisel, Holger; Seidel, Hans-Peter

2006-01-01

We present an approach to visualizing correlations in 3D multifield scalar data. The core of our approach is the computation of correlation fields, which are scalar fields containing the local correlations of subsets of the multiple fields. While the visualization of the correlation fields can be done using standard 3D volume visualization techniques, their huge number makes selection and handling a challenge. We introduce the Multifield-Graph to give an overview of which multiple fields correlate and to show the strength of their correlation. This information guides the selection of informative correlation fields for visualization. We use our approach to visually analyze a number of real and synthetic multifield datasets.

Property Graph vs RDF Triple Store: A Comparison on Glycan Substructure Search

PubMed Central

Alocci, Davide; Mariethoz, Julien; Horlacher, Oliver; Bolleman, Jerven T.; Campbell, Matthew P.; Lisacek, Frederique

2015-01-01

Resource description framework (RDF) and Property Graph databases are emerging technologies that are used for storing graph-structured data. We compare these technologies through a molecular biology use case: glycan substructure search. Glycans are branched tree-like molecules composed of building blocks linked together by chemical bonds. The molecular structure of a glycan can be encoded into a direct acyclic graph where each node represents a building block and each edge serves as a chemical linkage between two building blocks. In this context, Graph databases are possible software solutions for storing glycan structures and Graph query languages, such as SPARQL and Cypher, can be used to perform a substructure search. Glycan substructure searching is an important feature for querying structure and experimental glycan databases and retrieving biologically meaningful data. This applies for example to identifying a region of the glycan recognised by a glycan binding protein (GBP). In this study, 19,404 glycan structures were selected from GlycomeDB (www.glycome-db.org) and modelled for being stored into a RDF triple store and a Property Graph. We then performed two different sets of searches and compared the query response times and the results from both technologies to assess performance and accuracy. The two implementations produced the same results, but interestingly we noted a difference in the query response times. Qualitative measures such as portability were also used to define further criteria for choosing the technology adapted to solving glycan substructure search and other comparable issues. PMID:26656740

Evolution of cooperation in a finite homogeneous graph.

PubMed

Taylor, Peter D; Day, Troy; Wild, Geoff

2007-05-24

Recent theoretical studies of selection in finite structured populations have worked with one of two measures of selective advantage of an allele: fixation probability and inclusive fitness. Each approach has its own analytical strengths, but given certain assumptions they provide equivalent results. In most instances the structure of the population can be specified by a network of nodes connected by edges (that is, a graph), and much of the work here has focused on a continuous-time model of evolution, first described by ref. 11. Working in this context, we provide an inclusive fitness analysis to derive a surprisingly simple analytical condition for the selective advantage of a cooperative allele in any graph for which the structure satisfies a general symmetry condition ('bi-transitivity'). Our results hold for a broad class of population structures, including most of those analysed previously, as well as some for which a direct calculation of fixation probability has appeared intractable. Notably, under some forms of population regulation, the ability of a cooperative allele to invade is seen to be independent of the nature of population structure (and in particular of how game partnerships are specified) and is identical to that for an unstructured population. For other types of population regulation our results reveal that cooperation can invade if players choose partners along relatively 'high-weight' edges.

Comprehensive phylogenetic analysis of all species of swordtails and platies (Pisces: Genus Xiphophorus) uncovers a hybrid origin of a swordtail fish, Xiphophorus monticolus, and demonstrates that the sexually selected sword originated in the ancestral lineage of the genus, but was lost again secondarily.

PubMed

Kang, Ji Hyoun; Schartl, Manfred; Walter, Ronald B; Meyer, Axel

2013-01-29

Males in some species of the genus Xiphophorus, small freshwater fishes from Meso-America, have an extended caudal fin, or sword - hence their common name "swordtails". Longer swords are preferred by females from both sworded and - surprisingly also, non-sworded (platyfish) species that belong to the same genus. Swordtails have been studied widely as models in research on sexual selection. Specifically, the pre-existing bias hypothesis was interpreted to best explain the observed bias of females in presumed ancestral lineages of swordless species that show a preference for assumed derived males with swords over their conspecific swordless males. However, many of the phylogenetic relationships within this genus still remained unresolved. Here we construct a comprehensive molecular phylogeny of all 26 known Xiphophorus species, including the four recently described species (X. kallmani, X. mayae, X. mixei and X. monticolus). We use two mitochondrial and six new nuclear markers in an effort to increase the understanding of the evolutionary relationships among the species in this genus. Based on the phylogeny, the evolutionary history and character state evolution of the sword was reconstructed and found to have originated in the common ancestral lineage of the genus Xiphophorus and that it was lost again secondarily. We estimated the evolutionary relationships among all known species of the genus Xiphophorus based on the largest set of DNA markers so far. The phylogeny indicates that one of the newly described swordtail species, Xiphophorus monticolus, is likely to have arisen through hybridization since it is placed with the southern platyfish in the mitochondrial phylogeny, but with the southern swordtails in the nuclear phylogeny. Such discordance between these two types of markers is a strong indication for a hybrid origin. Additionally, by using a maximum likelihood approach the possession of the sexually selected sword trait is shown to be the most likely ancestral state for the genus Xiphophorus. Further, we provide a well supported estimation of the phylogenetic relationships between the previously unresolved northern swordtail groups. This comprehensive molecular phylogeny of the entire genus Xiphophorus provides evidence that a second swordtail species, X. monticolus, arose through hybridization. Previously, we demonstrated that X. clemenciae, another southern swordtail species, arose via hybridization. These findings highlight the potential key role of hybridization in the evolution of this genus and suggest the need for further investigations into how hybridization contributes to speciation more generally.

Determining the Effect of Natural Selection on Linked Neutral Divergence across Species

PubMed Central

Phung, Tanya N.; Lohmueller, Kirk E.

2016-01-01

A major goal in evolutionary biology is to understand how natural selection has shaped patterns of genetic variation across genomes. Studies in a variety of species have shown that neutral genetic diversity (intra-species differences) has been reduced at sites linked to those under direct selection. However, the effect of linked selection on neutral sequence divergence (inter-species differences) remains ambiguous. While empirical studies have reported correlations between divergence and recombination, which is interpreted as evidence for natural selection reducing linked neutral divergence, theory argues otherwise, especially for species that have diverged long ago. Here we address these outstanding issues by examining whether natural selection can affect divergence between both closely and distantly related species. We show that neutral divergence between closely related species (e.g. human-primate) is negatively correlated with functional content and positively correlated with human recombination rate. We also find that neutral divergence between distantly related species (e.g. human-rodent) is negatively correlated with functional content and positively correlated with estimates of background selection from primates. These patterns persist after accounting for the confounding factors of hypermutable CpG sites, GC content, and biased gene conversion. Coalescent models indicate that even when the contribution of ancestral polymorphism to divergence is small, background selection in the ancestral population can still explain a large proportion of the variance in divergence across the genome, generating the observed correlations. Our findings reveal that, contrary to previous intuition, natural selection can indirectly affect linked neutral divergence between both closely and distantly related species. Though we cannot formally exclude the possibility that the direct effects of purifying selection drive some of these patterns, such a scenario would be possible only if more of the genome is under purifying selection than currently believed. Our work has implications for understanding the evolution of genomes and interpreting patterns of genetic variation. PMID:27508305

Determining the Effect of Natural Selection on Linked Neutral Divergence across Species.

PubMed

Phung, Tanya N; Huber, Christian D; Lohmueller, Kirk E

2016-08-01

A major goal in evolutionary biology is to understand how natural selection has shaped patterns of genetic variation across genomes. Studies in a variety of species have shown that neutral genetic diversity (intra-species differences) has been reduced at sites linked to those under direct selection. However, the effect of linked selection on neutral sequence divergence (inter-species differences) remains ambiguous. While empirical studies have reported correlations between divergence and recombination, which is interpreted as evidence for natural selection reducing linked neutral divergence, theory argues otherwise, especially for species that have diverged long ago. Here we address these outstanding issues by examining whether natural selection can affect divergence between both closely and distantly related species. We show that neutral divergence between closely related species (e.g. human-primate) is negatively correlated with functional content and positively correlated with human recombination rate. We also find that neutral divergence between distantly related species (e.g. human-rodent) is negatively correlated with functional content and positively correlated with estimates of background selection from primates. These patterns persist after accounting for the confounding factors of hypermutable CpG sites, GC content, and biased gene conversion. Coalescent models indicate that even when the contribution of ancestral polymorphism to divergence is small, background selection in the ancestral population can still explain a large proportion of the variance in divergence across the genome, generating the observed correlations. Our findings reveal that, contrary to previous intuition, natural selection can indirectly affect linked neutral divergence between both closely and distantly related species. Though we cannot formally exclude the possibility that the direct effects of purifying selection drive some of these patterns, such a scenario would be possible only if more of the genome is under purifying selection than currently believed. Our work has implications for understanding the evolution of genomes and interpreting patterns of genetic variation.

Enriching mission planning approach with state transition graph heuristics for deep space exploration

NASA Astrophysics Data System (ADS)

Jin, Hao; Xu, Rui; Xu, Wenming; Cui, Pingyuan; Zhu, Shengying

2017-10-01

As to support the mission of Mars exploration in China, automated mission planning is required to enhance security and robustness of deep space probe. Deep space mission planning requires modeling of complex operations constraints and focus on the temporal state transitions of involved subsystems. Also, state transitions are ubiquitous in physical systems, but have been elusive for knowledge description. We introduce a modeling approach to cope with these difficulties that takes state transitions into consideration. The key technique we build on is the notion of extended states and state transition graphs. Furthermore, a heuristics that based on state transition graphs is proposed to avoid redundant work. Finally, we run comprehensive experiments on selected domains and our techniques present an excellent performance.

Network Security Risk Assessment System Based on Attack Graph and Markov Chain

NASA Astrophysics Data System (ADS)

Sun, Fuxiong; Pi, Juntao; Lv, Jin; Cao, Tian

2017-10-01

Network security risk assessment technology can be found in advance of the network problems and related vulnerabilities, it has become an important means to solve the problem of network security. Based on attack graph and Markov chain, this paper provides a Network Security Risk Assessment Model (NSRAM). Based on the network infiltration tests, NSRAM generates the attack graph by the breadth traversal algorithm. Combines with the international standard CVSS, the attack probability of atomic nodes are counted, and then the attack transition probabilities of ones are calculated by Markov chain. NSRAM selects the optimal attack path after comprehensive measurement to assessment network security risk. The simulation results show that NSRAM can reflect the actual situation of network security objectively.

Enhanced Contact Graph Routing (ECGR) MACHETE Simulation Model

NASA Technical Reports Server (NTRS)

Segui, John S.; Jennings, Esther H.; Clare, Loren P.

2013-01-01

Contact Graph Routing (CGR) for Delay/Disruption Tolerant Networking (DTN) space-based networks makes use of the predictable nature of node contacts to make real-time routing decisions given unpredictable traffic patterns. The contact graph will have been disseminated to all nodes before the start of route computation. CGR was designed for space-based networking environments where future contact plans are known or are independently computable (e.g., using known orbital dynamics). For each data item (known as a bundle in DTN), a node independently performs route selection by examining possible paths to the destination. Route computation could conceivably run thousands of times a second, so computational load is important. This work refers to the simulation software model of Enhanced Contact Graph Routing (ECGR) for DTN Bundle Protocol in JPL's MACHETE simulation tool. The simulation model was used for performance analysis of CGR and led to several performance enhancements. The simulation model was used to demonstrate the improvements of ECGR over CGR as well as other routing methods in space network scenarios. ECGR moved to using earliest arrival time because it is a global monotonically increasing metric that guarantees the safety properties needed for the solution's correctness since route re-computation occurs at each node to accommodate unpredicted changes (e.g., traffic pattern, link quality). Furthermore, using earliest arrival time enabled the use of the standard Dijkstra algorithm for path selection. The Dijkstra algorithm for path selection has a well-known inexpensive computational cost. These enhancements have been integrated into the open source CGR implementation. The ECGR model is also useful for route metric experimentation and comparisons with other DTN routing protocols particularly when combined with MACHETE's space networking models and Delay Tolerant Link State Routing (DTLSR) model.

The evolution of autodigestion in the mushroom family Psathyrellaceae (Agaricales) inferred from Maximum Likelihood and Bayesian methods.

PubMed

Nagy, László G; Urban, Alexander; Orstadius, Leif; Papp, Tamás; Larsson, Ellen; Vágvölgyi, Csaba

2010-12-01

Recently developed comparative phylogenetic methods offer a wide spectrum of applications in evolutionary biology, although it is generally accepted that their statistical properties are incompletely known. Here, we examine and compare the statistical power of the ML and Bayesian methods with regard to selection of best-fit models of fruiting-body evolution and hypothesis testing of ancestral states on a real-life data set of a physiological trait (autodigestion) in the family Psathyrellaceae. Our phylogenies are based on the first multigene data set generated for the family. Two different coding regimes (binary and multistate) and two data sets differing in taxon sampling density are examined. The Bayesian method outperformed Maximum Likelihood with regard to statistical power in all analyses. This is particularly evident if the signal in the data is weak, i.e. in cases when the ML approach does not provide support to choose among competing hypotheses. Results based on binary and multistate coding differed only modestly, although it was evident that multistate analyses were less conclusive in all cases. It seems that increased taxon sampling density has favourable effects on inference of ancestral states, while model parameters are influenced to a smaller extent. The model best fitting our data implies that the rate of losses of deliquescence equals zero, although model selection in ML does not provide proper support to reject three of the four candidate models. The results also support the hypothesis that non-deliquescence (lack of autodigestion) has been ancestral in Psathyrellaceae, and that deliquescent fruiting bodies represent the preferred state, having evolved independently several times during evolution. Copyright © 2010 Elsevier Inc. All rights reserved.

"I Ulu No Ka Lala I Ke Kumu", The Branches Grow Because of the Trunk: Ancestral Knowledge as Refusal

ERIC Educational Resources Information Center

Chandler, Kapua L.

2018-01-01

This paper will discuss the ways that Native Hawaiian scholars are engaging in innovative strategies that incorporate ancestral knowledges into the academy. Ancestral knowledges are highly valued as Indigenous communities strive to pass on such wisdom and lessons from generation to generation. Ancestral knowledges are all around us no matter where…

Characterization of Reconstructed Ancestral Proteins Suggests a Change in Temperature of the Ancient Biosphere.

PubMed

Akanuma, Satoshi

2017-08-06

Understanding the evolution of ancestral life, and especially the ability of some organisms to flourish in the variable environments experienced in Earth's early biosphere, requires knowledge of the characteristics and the environment of these ancestral organisms. Information about early life and environmental conditions has been obtained from fossil records and geological surveys. Recent advances in phylogenetic analysis, and an increasing number of protein sequences available in public databases, have made it possible to infer ancestral protein sequences possessed by ancient organisms. However, the in silico studies that assess the ancestral base content of ribosomal RNAs, the frequency of each amino acid in ancestral proteins, and estimate the environmental temperatures of ancient organisms, show conflicting results. The characterization of ancestral proteins reconstructed in vitro suggests that ancient organisms had very thermally stable proteins, and therefore were thermophilic or hyperthermophilic. Experimental data supports the idea that only thermophilic ancestors survived the catastrophic increase in temperature of the biosphere that was likely associated with meteorite impacts during the early history of Earth. In addition, by expanding the timescale and including more ancestral proteins for reconstruction, it appears as though the Earth's surface temperature gradually decreased over time, from Archean to present.

Graph-based layout analysis for PDF documents

NASA Astrophysics Data System (ADS)

Xu, Canhui; Tang, Zhi; Tao, Xin; Li, Yun; Shi, Cao

2013-03-01

To increase the flexibility and enrich the reading experience of e-book on small portable screens, a graph based method is proposed to perform layout analysis on Portable Document Format (PDF) documents. Digital born document has its inherent advantages like representing texts and fractional images in explicit form, which can be straightforwardly exploited. To integrate traditional image-based document analysis and the inherent meta-data provided by PDF parser, the page primitives including text, image and path elements are processed to produce text and non text layer for respective analysis. Graph-based method is developed in superpixel representation level, and page text elements corresponding to vertices are used to construct an undirected graph. Euclidean distance between adjacent vertices is applied in a top-down manner to cut the graph tree formed by Kruskal's algorithm. And edge orientation is then used in a bottom-up manner to extract text lines from each sub tree. On the other hand, non-textual objects are segmented by connected component analysis. For each segmented text and non-text composite, a 13-dimensional feature vector is extracted for labelling purpose. The experimental results on selected pages from PDF books are presented.

Information extraction and knowledge graph construction from geoscience literature

NASA Astrophysics Data System (ADS)

Wang, Chengbin; Ma, Xiaogang; Chen, Jianguo; Chen, Jingwen

2018-03-01

Geoscience literature published online is an important part of open data, and brings both challenges and opportunities for data analysis. Compared with studies of numerical geoscience data, there are limited works on information extraction and knowledge discovery from textual geoscience data. This paper presents a workflow and a few empirical case studies for that topic, with a focus on documents written in Chinese. First, we set up a hybrid corpus combining the generic and geology terms from geology dictionaries to train Chinese word segmentation rules of the Conditional Random Fields model. Second, we used the word segmentation rules to parse documents into individual words, and removed the stop-words from the segmentation results to get a corpus constituted of content-words. Third, we used a statistical method to analyze the semantic links between content-words, and we selected the chord and bigram graphs to visualize the content-words and their links as nodes and edges in a knowledge graph, respectively. The resulting graph presents a clear overview of key information in an unstructured document. This study proves the usefulness of the designed workflow, and shows the potential of leveraging natural language processing and knowledge graph technologies for geoscience.

Placental invasion, preeclampsia risk and adaptive molecular evolution at the origin of the great apes: evidence from genome-wide analyses.

PubMed

Crosley, E J; Elliot, M G; Christians, J K; Crespi, B J

2013-02-01

Recent evidence from chimpanzees and gorillas has raised doubts that preeclampsia is a uniquely human disease. The deep extravillous trophoblast (EVT) invasion and spiral artery remodeling that characterizes our placenta (and is abnormal in preeclampsia) is shared within great apes, setting Homininae apart from Hylobatidae and Old World Monkeys, which show much shallower trophoblast invasion and limited spiral artery remodeling. We hypothesize that the evolution of a more invasive placenta in the lineage ancestral to the great apes involved positive selection on genes crucial to EVT invasion and spiral artery remodeling. Furthermore, identification of placentally-expressed genes under selection in this lineage may identify novel genes involved in placental development. We tested for positive selection in approximately 18,000 genes using the ratio of non-synonymous to synonymous amino acid substitution for protein-coding DNA. DAVID Bioinformatics Resources identified biological processes enriched in positively selected genes, including processes related to EVT invasion and spiral artery remodeling. Analyses revealed 295 and 264 genes under significant positive selection on the branches ancestral to Hominidae (Human, Chimp, Gorilla, Orangutan) and Homininae (Human, Chimp, Gorilla), respectively. Gene ontology analysis of these gene sets demonstrated significant enrichments for several functional gene clusters relevant to preeclampsia risk, and sets of placentally-expressed genes that have been linked with preeclampsia and/or trophoblast invasion in other studies. Our study represents a novel approach to the identification of candidate genes and amino acid residues involved in placental pathologies by implicating them in the evolution of highly-invasive placenta. Copyright © 2012 Elsevier Ltd. All rights reserved.

Mitochondrial genetic codes evolve to match amino acid requirements of proteins.

PubMed

Swire, Jonathan; Judson, Olivia P; Burt, Austin

2005-01-01

Mitochondria often use genetic codes different from the standard genetic code. Now that many mitochondrial genomes have been sequenced, these variant codes provide the first opportunity to examine empirically the processes that produce new genetic codes. The key question is: Are codon reassignments the sole result of mutation and genetic drift? Or are they the result of natural selection? Here we present an analysis of 24 phylogenetically independent codon reassignments in mitochondria. Although the mutation-drift hypothesis can explain reassignments from stop to an amino acid, we found that it cannot explain reassignments from one amino acid to another. In particular--and contrary to the predictions of the mutation-drift hypothesis--the codon involved in such a reassignment was not rare in the ancestral genome. Instead, such reassignments appear to take place while the codon is in use at an appreciable frequency. Moreover, the comparison of inferred amino acid usage in the ancestral genome with the neutral expectation shows that the amino acid gaining the codon was selectively favored over the amino acid losing the codon. These results are consistent with a simple model of weak selection on the amino acid composition of proteins in which codon reassignments are selected because they compensate for multiple slightly deleterious mutations throughout the mitochondrial genome. We propose that the selection pressure is for reduced protein synthesis cost: most reassignments give amino acids that are less expensive to synthesize. Taken together, our results strongly suggest that mitochondrial genetic codes evolve to match the amino acid requirements of proteins.

Extensive shared polymorphism at non-MHC immune genes in recently diverged North American prairie grouse

USGS Publications Warehouse

Minias, Piotr; Bateson, Zachary W.; Whittingham, Linda A.; Johnson, Jeff A.; Oyler-McCance, Sara J.; Dunn, Peter O.

2018-01-01

Gene polymorphisms shared between recently diverged species are thought to be widespread and most commonly reflect introgression from hybridization or retention of ancestral polymorphism through incomplete lineage sorting. Shared genetic diversity resulting from incomplete lineage sorting is usually maintained for a relatively short period of time, but under strong balancing selection it may persist for millions of years beyond species divergence (balanced trans-species polymorphism), as in the case of the major histocompatibility complex (MHC) genes. However, balancing selection is much less likely to act on non-MHC immune genes. The aim of this study was to investigate the patterns of shared polymorphism and selection at non-MHC immune genes in five grouse species from Centrocercus and Tympanuchus genera. For this purpose, we genotyped five non-MHC immune genes that do not interact directly with pathogens, but are involved in signaling and regulate immune cell growth. In contrast to previous studies with MHC, we found no evidence for balancing selection or balanced trans-species polymorphism among the non-MHC immune genes. No haplotypes were shared between genera and in most cases more similar allelic variants sorted by genus. Between species within genera, however, we found extensive shared polymorphism, which was most likely attributable to introgression or incomplete lineage sorting following recent divergence and large ancestral effective population size (i.e., weak genetic drift). Our study suggests that North American prairie grouse may have attained relatively low degree of reciprocal monophyly at nuclear loci and reinforces the rarity of balancing selection in non-MHC immune genes.

Silicon and Titanium Correlation in Selected Rocks at Gale Crater, Mars

NASA Image and Video Library

2015-12-17

The yellow triangles on this graph indicate concentrations of the elements titanium and silicon in selected rock targets with high silica content analyzed by the Alpha Particle X-ray Spectrometer (APXS) instrument on NASA's Curiosity rover in Mars' Gale Crater. The pattern shows a correlation between enriched silicon content and enriched titanium content. Titanium is difficult to mobilize in weathering environments, and this correlation suggests that both titanium and silicon remain as the residue of acidic weathering. Ongoing research aims to distinguish between that possible explanation for silicon enrichment and an alternative of mobilized silicon being added to the site (see PIA20275). As a general comparison with these selected high-silica targets in Gale Crater, the gray dots in the graph show the range of titanium and silicon concentrations in all Martian targets analyzed by APXS instruments on three Mars rovers at three different areas of Mars. http://photojournal.jpl.nasa.gov/catalog/PIA20274

Evolutionary dynamics on any population structure

NASA Astrophysics Data System (ADS)

Allen, Benjamin; Lippner, Gabor; Chen, Yu-Ting; Fotouhi, Babak; Momeni, Naghmeh; Yau, Shing-Tung; Nowak, Martin A.

2017-03-01

Evolution occurs in populations of reproducing individuals. The structure of a population can affect which traits evolve. Understanding evolutionary game dynamics in structured populations remains difficult. Mathematical results are known for special structures in which all individuals have the same number of neighbours. The general case, in which the number of neighbours can vary, has remained open. For arbitrary selection intensity, the problem is in a computational complexity class that suggests there is no efficient algorithm. Whether a simple solution for weak selection exists has remained unanswered. Here we provide a solution for weak selection that applies to any graph or network. Our method relies on calculating the coalescence times of random walks. We evaluate large numbers of diverse population structures for their propensity to favour cooperation. We study how small changes in population structure—graph surgery—affect evolutionary outcomes. We find that cooperation flourishes most in societies that are based on strong pairwise ties.

Enhancing PC Cluster-Based Parallel Branch-and-Bound Algorithms for the Graph Coloring Problem

NASA Astrophysics Data System (ADS)

Taoka, Satoshi; Takafuji, Daisuke; Watanabe, Toshimasa

A branch-and-bound algorithm (BB for short) is the most general technique to deal with various combinatorial optimization problems. Even if it is used, computation time is likely to increase exponentially. So we consider its parallelization to reduce it. It has been reported that the computation time of a parallel BB heavily depends upon node-variable selection strategies. And, in case of a parallel BB, it is also necessary to prevent increase in communication time. So, it is important to pay attention to how many and what kind of nodes are to be transferred (called sending-node selection strategy). In this paper, for the graph coloring problem, we propose some sending-node selection strategies for a parallel BB algorithm by adopting MPI for parallelization and experimentally evaluate how these strategies affect computation time of a parallel BB on a PC cluster network.

Multispectral determination of soil moisture-2. [Guymon, Oklahoma and Dalhart, Texas

NASA Technical Reports Server (NTRS)

Estes, J. E.; Simonett, D. S. (Principal Investigator); Hajic, E. J.; Hilton, B. M.; Lees, R. D.

1982-01-01

Soil moisture data obtained using scatterometers, modular multispectral scanners and passive microwave radiometers were revised and grouped into four field cover types for statistical anaysis. Guymon data are grouped as alfalfa, bare, milo with rows perpendicular to the field view, and milo viewed parallel to the field of view. Dalhart data are grouped as bare combo, stubble, disked stubble, and corn field. Summary graphs combine selected analyses to compare the effects of field cover. The analysis for each of the cover types is presented in tables and graphs. Other tables show elementary statistics, correlation matrices, and single variable regressions. Selected eigenvectors and factor analyses are included and the highest correlating sensor typs for each location are summarized.

Simulation of streamflows and basin-wide hydrologic variables over several climate-change scenarios, Methow River basin, Washington

USGS Publications Warehouse

Voss, Frank D.; Mastin, Mark C.

2012-01-01

A database was developed to automate model execution and to provide users with Internet access to voluminous data products ranging from summary figures to model output timeseries. Database-enabled Internet tools were developed to allow users to create interactive graphs of output results based on their analysis needs. For example, users were able to create graphs by selecting time intervals, greenhouse gas emission scenarios, general circulation models, and specific hydrologic variables.

Finding paths in tree graphs with a quantum walk

NASA Astrophysics Data System (ADS)

Koch, Daniel; Hillery, Mark

2018-01-01

We analyze the potential for different types of searches using the formalism of scattering random walks on quantum computers. Given a particular type of graph consisting of nodes and connections, a "tree maze," we would like to find a selected final node as quickly as possible, faster than any classical search algorithm. We show that this can be done using a quantum random walk, both through numerical calculations as well as by using the eigenvectors and eigenvalues of the quantum system.

Estimation of the net acid load of the diet of ancestral preagricultural Homo sapiens and their hominid ancestors.

PubMed

Sebastian, Anthony; Frassetto, Lynda A; Sellmeyer, Deborah E; Merriam, Renée L; Morris, R Curtis

2002-12-01

Natural selection has had < 1% of hominid evolutionary time to eliminate the inevitable maladaptations consequent to the profound transformation of the human diet resulting from the inventions of agriculture and animal husbandry. The objective was to estimate the net systemic load of acid (net endogenous acid production; NEAP) from retrojected ancestral preagricultural diets and to compare it with that of contemporary diets, which are characterized by an imbalance of nutrient precursors of hydrogen and bicarbonate ions that induces a lifelong, low-grade, pathogenically significant systemic metabolic acidosis. Using established computational methods, we computed NEAP for a large number of retrojected ancestral preagricultural diets and compared them with computed and measured values for typical American diets. The mean (+/- SD) NEAP for 159 retrojected preagricultural diets was -88 +/- 82 mEq/d; 87% were net base-producing. The computational model predicted NEAP for the average American diet (as recorded in the third National Health and Nutrition Examination Survey) as 48 mEq/d, within a few percentage points of published measured values for free-living Americans; the model, therefore, was not biased toward generating negative NEAP values. The historical shift from negative to positive NEAP was accounted for by the displacement of high-bicarbonate-yielding plant foods in the ancestral diet by cereal grains and energy-dense, nutrient-poor foods in the contemporary diet-neither of which are net base-producing. The findings suggest that diet-induced metabolic acidosis and its sequelae in humans eating contemporary diets reflect a mismatch between the nutrient composition of the diet and genetically determined nutritional requirements for optimal systemic acid-base status.

Are adaptation costs necessary to build up a local adaptation pattern?

PubMed

Magalhães, Sara; Blanchet, Elodie; Egas, Martijn; Olivieri, Isabelle

2009-08-03

Ecological specialization is pervasive in phytophagous arthropods. In such specialization mode, limits to host range are imposed by trade-offs preventing adaptation to several hosts. The occurrence of such trade-offs is inferred by a pattern of local adaptation, i.e., a negative correlation between relative performance on different hosts. To establish a causal link between local adaptation and trade-offs, we performed experimental evolution of spider mites on cucumber, tomato and pepper, starting from a population adapted to cucumber. Spider mites adapted to each novel host within 15 generations and no further evolution was observed at generation 25. A pattern of local adaptation was found, as lines evolving on a novel host performed better on that host than lines evolving on other hosts. However, costs of adaptation were absent. Indeed, lines adapted to tomato had similar or higher performance on pepper than lines evolving on the ancestral host (which represent the initial performance of all lines) and the converse was also true, e.g. negatively correlated responses were not observed on the alternative novel host. Moreover, adapting to novel hosts did not result in decreased performance on the ancestral host. Adaptation did not modify host ranking, as all lines performed best on the ancestral host. Furthermore, mites from all lines preferred the ancestral to novel hosts. Mate choice experiments indicated that crosses between individuals from the same or from a different selection regime were equally likely, hence development of reproductive isolation among lines adapted to different hosts is unlikely. Therefore, performance and preference are not expected to impose limits to host range in our study species. Our results show that the evolution of a local adaptation pattern is not necessarily associated with the evolution of an adaptation cost.

Colour pattern homology and evolution in Vanessa butterflies (Nymphalidae: Nymphalini): eyespot characters.

PubMed

Abbasi, R; Marcus, J M

2015-11-01

Ocelli are serially repeated colour patterns on the wings of many butterflies. Eyespots are elaborate ocelli that function in predator avoidance and deterrence as well as in mate choice. A phylogenetic approach was used to study ocelli and eyespot evolution in Vanessa butterflies, a genus exhibiting diverse phenotypes among these serial homologs. Forty-four morphological characters based on eyespot number, arrangement, shape and the number of elements in each eyespot were defined and scored. Ocelli from eight wing cells on the dorsal and ventral surfaces of the forewing and hindwing were evaluated. The evolution of these characters was traced over a phylogeny of Vanessa based on 7750 DNA base pairs from 10 genes. Our reconstruction predicts that the ancestral Vanessa had 5 serially arranged ocelli on all four wing surfaces. The ancestral state on the dorsal forewing and ventral hindwing was ocelli arranged in two heterogeneous groups. On the dorsal hindwing, the ancestral state was either homogenous or ocelli arranged in two heterogeneous groups. On the ventral forewing, we determined that the ancestral state was organized into three heterogeneous groups. In Vanessa, almost all ocelli are individuated and capable of independent evolution relative to other colour patterns except for the ocelli in cells -1 and 0 on the dorsal and ventral forewings, which appear to be constrained to evolve in parallel. The genus Vanessa is a good model system for the study of serial homology and the interaction of selective forces with developmental architecture to produce diversity in butterfly colour patterns. © 2015 European Society For Evolutionary Biology. Journal of Evolutionary Biology © 2015 European Society For Evolutionary Biology.

Cloning, expression of, and evidence of positive selection for, the prolactin receptor gene in Chinese giant salamander (Andrias davidianus).

PubMed

Hu, Qiaomu; Meng, Yan; Tian, Haifeng; Chen, Songlin; Xiao, Hanbing

2015-12-01

Prolactin receptor (PRLR) is a protein associated with reproduction in mammals and with osmoregulation in fish. In this study, the complete length of Chinese giant salamander Andrias davidianus prolactin receptor (AD-prlr) was cloned. Andrias davidianus prlr expression was high in the kidney, pituitary, and ovary and low in other examined tissues. The AD-prlr levels were higher in ovary than in testis, and increased in ovaries with age from 1 to 6 years. To determine effect of exogenous androgen and aromatase inhibitor on AD-prlr expression, methyltestosterone (MT) and letrozole (LE) were injected, resulting in decreased AD-prlr in both brain and ovary, with MT repressing prlr transcription more rapidly than did LE. The molecular evolution of prlr was assessed, and found to have undergone a complex evolution process. The obranch-site test detected four positively selected sites in ancestral lineages prior to the separation of mammals and birds. Fourteen sites underwent positive selection in ancestral lineages of birds and six were positively selected in amphibians. The site model showed that 16, 7, and 30 sites underwent positive selection in extant mammals, amphibians, and birds, respectively. The positively selected sites in amphibians were located outside the transmembrane domain, with four in the extracellular and three in the intracellular domain, indicating that the transmembrane region might be conserved and essential for protein function. Our findings provide a basis for further studies of AD-prlr function and molecular evolution in Chinese giant salamander. J. Exp. Zool. (Mol. Dev. Evol.) 324B: 707-719, 2015. © 2015 Wiley Periodicals, Inc. © 2015 Wiley Periodicals, Inc.

The effect of choir formation on the acoustical attributes of the singing voice

NASA Astrophysics Data System (ADS)

Atkinson, Debra Sue

Research shows that many things can influence choral tone and choral blend. Some of these are vowel uniformity, vibrato, choral formation, strategic placement of singers, and spacing between singers. This study sought to determine the effect that changes in choral formation and spacing between singers would have on four randomly selected voices of an ensemble as revealed through long-term average spectra (LTAS) of the individual singers. All members of the ensemble were given the opportunity to express their preferences for each of the choral formations and the four randomly selected choristers were asked specific questions regarding the differences between choral singing and solo singing. The results indicated that experienced singers preferred singing in a mixed-spread choral formation. However, the graphs of the choral excerpts as compared to the solo recordings revealed that the choral graphs for the soprano and bass were very similar to the graphs of their solos, but the graphs of the tenor and the alto were different from their solo graphs. It is obvious from the results of this study that the four selected singers did sing with slightly different techniques in the choral formations than they did while singing their solos. The members of this ensemble were accustomed to singing in many different formations. Therefore, it was easy for them to consciously think about how they sang in each of the four formations (mixed-close, mixed-spread, sectional-close, and sectional-spread) and answer the questionnaire accordingly. This would not be as easy for a group that never changed choral formations. Therefore, the results of this study cannot be generalized to choirs who only sing in sectional formation. As researchers learn more about choral acoustics and the effects of choral singing on the voice, choral conductors will be able to make better decisions about the methods used to achieve their desired choral blend. It is up to the choral conductors to glean the knowledge from the research that is taking place and use it for the betterment of choral music.

Exotic ecosystems: where root disease is not a beneficial component of temperate conifer forests

Treesearch

William J. Otrosina

2003-01-01

Forest tree species and ecosystems ahve evolved under climatic, geological, and biological forces over eons of time. The present flora represents the sum of these selective forces that have acted upon ancestral and modern species. Adaptations to climatic factors, soils, insects, diseases, and a host of disturbance events, operating at a variety of scales, ahve forged...

On the Number of Non-equivalent Ancestral Configurations for Matching Gene Trees and Species Trees.

PubMed

Disanto, Filippo; Rosenberg, Noah A

2017-09-14

An ancestral configuration is one of the combinatorially distinct sets of gene lineages that, for a given gene tree, can reach a given node of a specified species tree. Ancestral configurations have appeared in recursive algebraic computations of the conditional probability that a gene tree topology is produced under the multispecies coalescent model for a given species tree. For matching gene trees and species trees, we study the number of ancestral configurations, considered up to an equivalence relation introduced by Wu (Evolution 66:763-775, 2012) to reduce the complexity of the recursive probability computation. We examine the largest number of non-equivalent ancestral configurations possible for a given tree size n. Whereas the smallest number of non-equivalent ancestral configurations increases polynomially with n, we show that the largest number increases with [Formula: see text], where k is a constant that satisfies [Formula: see text]. Under a uniform distribution on the set of binary labeled trees with a given size n, the mean number of non-equivalent ancestral configurations grows exponentially with n. The results refine an earlier analysis of the number of ancestral configurations considered without applying the equivalence relation, showing that use of the equivalence relation does not alter the exponential nature of the increase with tree size.

ARG-walker: inference of individual specific strengths of meiotic recombination hotspots by population genomics analysis.

PubMed

Chen, Hao; Yang, Peng; Guo, Jing; Kwoh, Chee Keong; Przytycka, Teresa M; Zheng, Jie

2015-01-01

Meiotic recombination hotspots play important roles in various aspects of genomics, but the underlying mechanisms for regulating the locations and strengths of recombination hotspots are not yet fully revealed. Most existing algorithms for estimating recombination rates from sequence polymorphism data can only output average recombination rates of a population, although there is evidence for the heterogeneity in recombination rates among individuals. For genome-wide association studies (GWAS) of recombination hotspots, an efficient algorithm that estimates the individualized strengths of recombination hotspots is highly desirable. In this work, we propose a novel graph mining algorithm named ARG-walker, based on random walks on ancestral recombination graphs (ARG), to estimate individual-specific recombination hotspot strengths. Extensive simulations demonstrate that ARG-walker is able to distinguish the hot allele of a recombination hotspot from the cold allele. Integrated with output of ARG-walker, we performed GWAS on the phased haplotype data of the 22 autosome chromosomes of the HapMap Asian population samples of Chinese and Japanese (JPT+CHB). Significant cis-regulatory signals have been detected, which is corroborated by the enrichment of the well-known 13-mer motif CCNCCNTNNCCNC of PRDM9 protein. Moreover, two new DNA motifs have been identified in the flanking regions of the significantly associated SNPs (single nucleotide polymorphisms), which are likely to be new cis-regulatory elements of meiotic recombination hotspots of the human genome. Our results on both simulated and real data suggest that ARG-walker is a promising new method for estimating the individual recombination variations. In the future, it could be used to uncover the mechanisms of recombination regulation and human diseases related with recombination hotspots.

Variation in the Intensity of Selection on Codon Bias over Time Causes Contrasting Patterns of Base Composition Evolution in Drosophila

PubMed Central

Jackson, Benjamin C.; Campos, José L.; Haddrill, Penelope R.; Charlesworth, Brian

2017-01-01

Four-fold degenerate coding sites form a major component of the genome, and are often used to make inferences about selection and demography, so that understanding their evolution is important. Despite previous efforts, many questions regarding the causes of base composition changes at these sites in Drosophila remain unanswered. To shed further light on this issue, we obtained a new whole-genome polymorphism data set from D. simulans. We analyzed samples from the putatively ancestral range of D. simulans, as well as an existing polymorphism data set from an African population of D. melanogaster. By using D. yakuba as an outgroup, we found clear evidence for selection on 4-fold sites along both lineages over a substantial period, with the intensity of selection increasing with GC content. Based on an explicit model of base composition evolution, we suggest that the observed AT-biased substitution pattern in both lineages is probably due to an ancestral reduction in selection intensity, and is unlikely to be the result of an increase in mutational bias towards AT alone. By using two polymorphism-based methods for estimating selection coefficients over different timescales, we show that the selection intensity on codon usage has been rather stable in D. simulans in the recent past, but the long-term estimates in D. melanogaster are much higher than the short-term ones, indicating a continuing decline in selection intensity, to such an extent that the short-term estimates suggest that selection is only active in the most GC-rich parts of the genome. Finally, we provide evidence for complex evolutionary patterns in the putatively neutral short introns, which cannot be explained by the standard GC-biased gene conversion model. These results reveal a dynamic picture of base composition evolution. PMID:28082609

Reconstructing Ancient Forms of Life

NASA Technical Reports Server (NTRS)

Benner, Steven A.

1998-01-01

Progress in the past three months has occurred in two areas, reconstruction of ancestral proteins and improved understanding of chemical features that are likely to be universal in generic matter regardless of its genesis. Ancestral ribonucleases have been reconstructed, and an example has been developed that shows how physiological function can be assigned to in vitro behaviors observed in biological systems. Sequence data have been collected to permit the reconstruction of src homology 2 domains that underwent radiative divergence at the time of the radiative divergence of chordates. New studies have been completed that show how genetic matter (or its remnants) might be detected on Mars (or other non-terrean locations.) Last, the first in vitro selection experiments have been completed using a nucleoside library carrying positively charged functionality, illustrating the importance of non-standard nucleotides to those attempting to obtain evidence for an "RNA world" as an early episode of life on earth.

Genetic structure characterization of Chileans reflects historical immigration patterns.

PubMed

Eyheramendy, Susana; Martinez, Felipe I; Manevy, Federico; Vial, Cecilia; Repetto, Gabriela M

2015-03-17

Identifying the ancestral components of genomes of admixed individuals helps uncovering the genetic basis of diseases and understanding the demographic history of populations. We estimate local ancestry on 313 Chileans and assess the contribution from three continental populations. The distribution of ancestry block-length suggests an average admixing time around 10 generations ago. Sex-chromosome analyses confirm imbalanced contribution of European men and Native-American women. Previously known genes under selection contain SNPs showing large difference in allele frequencies. Furthermore, we show that assessing ancestry is harder at SNPs with higher recombination rates and easier at SNPs with large difference in allele frequencies at the ancestral populations. Two observations, that African ancestry proportions systematically decrease from North to South, and that European ancestry proportions are highest in central regions, show that the genetic structure of Chileans is under the influence of a diffusion process leading to an ancestry gradient related to geography.

Genetic structure characterization of Chileans reflects historical immigration patterns

PubMed Central

Eyheramendy, Susana; Martinez, Felipe I.; Manevy, Federico; Vial, Cecilia; Repetto, Gabriela M.

2015-01-01

Identifying the ancestral components of genomes of admixed individuals helps uncovering the genetic basis of diseases and understanding the demographic history of populations. We estimate local ancestry on 313 Chileans and assess the contribution from three continental populations. The distribution of ancestry block-length suggests an average admixing time around 10 generations ago. Sex-chromosome analyses confirm imbalanced contribution of European men and Native-American women. Previously known genes under selection contain SNPs showing large difference in allele frequencies. Furthermore, we show that assessing ancestry is harder at SNPs with higher recombination rates and easier at SNPs with large difference in allele frequencies at the ancestral populations. Two observations, that African ancestry proportions systematically decrease from North to South, and that European ancestry proportions are highest in central regions, show that the genetic structure of Chileans is under the influence of a diffusion process leading to an ancestry gradient related to geography. PMID:25778948

Effects of number of training generations on genomic prediction for various traits in a layer chicken population.

PubMed

Weng, Ziqing; Wolc, Anna; Shen, Xia; Fernando, Rohan L; Dekkers, Jack C M; Arango, Jesus; Settar, Petek; Fulton, Janet E; O'Sullivan, Neil P; Garrick, Dorian J

2016-03-19

Genomic estimated breeding values (GEBV) based on single nucleotide polymorphism (SNP) genotypes are widely used in animal improvement programs. It is typically assumed that the larger the number of animals is in the training set, the higher is the prediction accuracy of GEBV. The aim of this study was to quantify genomic prediction accuracy depending on the number of ancestral generations included in the training set, and to determine the optimal number of training generations for different traits in an elite layer breeding line. Phenotypic records for 16 traits on 17,793 birds were used. All parents and some selection candidates from nine non-overlapping generations were genotyped for 23,098 segregating SNPs. An animal model with pedigree relationships (PBLUP) and the BayesB genomic prediction model were applied to predict EBV or GEBV at each validation generation (progeny of the most recent training generation) based on varying numbers of immediately preceding ancestral generations. Prediction accuracy of EBV or GEBV was assessed as the correlation between EBV and phenotypes adjusted for fixed effects, divided by the square root of trait heritability. The optimal number of training generations that resulted in the greatest prediction accuracy of GEBV was determined for each trait. The relationship between optimal number of training generations and heritability was investigated. On average, accuracies were higher with the BayesB model than with PBLUP. Prediction accuracies of GEBV increased as the number of closely-related ancestral generations included in the training set increased, but reached an asymptote or slightly decreased when distant ancestral generations were used in the training set. The optimal number of training generations was 4 or more for high heritability traits but less than that for low heritability traits. For less heritable traits, limiting the training datasets to individuals closely related to the validation population resulted in the best predictions. The effect of adding distant ancestral generations in the training set on prediction accuracy differed between traits and the optimal number of necessary training generations is associated with the heritability of traits.

Sensor Selection from Independence Graphs using Submodularity

DTIC Science & Technology

2017-02-01

Krause , B. McMahan, Guestrin C., and Gupta A., “Robust sub- modular observation selection,” Journal of Machine Learning Research (JMLR), vol. 9, pp. 2761...235–257. Springer Berlin Heidelberg, 1983. [10] A. Krause , “SFO: A toolbox for submodular function optimization,” J. Mach. Learn. Res., vol. 11, pp

Recreating a functional ancestral archosaur visual pigment.

PubMed

Chang, Belinda S W; Jönsson, Karolina; Kazmi, Manija A; Donoghue, Michael J; Sakmar, Thomas P

2002-09-01

The ancestors of the archosaurs, a major branch of the diapsid reptiles, originated more than 240 MYA near the dawn of the Triassic Period. We used maximum likelihood phylogenetic ancestral reconstruction methods and explored different models of evolution for inferring the amino acid sequence of a putative ancestral archosaur visual pigment. Three different types of maximum likelihood models were used: nucleotide-based, amino acid-based, and codon-based models. Where possible, within each type of model, likelihood ratio tests were used to determine which model best fit the data. Ancestral reconstructions of the ancestral archosaur node using the best-fitting models of each type were found to be in agreement, except for three amino acid residues at which one reconstruction differed from the other two. To determine if these ancestral pigments would be functionally active, the corresponding genes were chemically synthesized and then expressed in a mammalian cell line in tissue culture. The expressed artificial genes were all found to bind to 11-cis-retinal to yield stable photoactive pigments with lambda(max) values of about 508 nm, which is slightly redshifted relative to that of extant vertebrate pigments. The ancestral archosaur pigments also activated the retinal G protein transducin, as measured in a fluorescence assay. Our results show that ancestral genes from ancient organisms can be reconstructed de novo and tested for function using a combination of phylogenetic and biochemical methods.

Ancestral gene reconstruction and synthesis of ancient rhodopsins in the laboratory.

PubMed

Chang, Belinda S W

2003-08-01

Laboratory synthesis of ancestral proteins offers an intriguing opportunity to study the past directly. The development of Bayesian methods to infer ancestral sequences, combined with advances in models of molecular evolution, and synthetic gene technology make this an increasingly promising approach in evolutionary studies of molecular function. Visual pigments form the first step in the biochemical cascade of events in the retina in all animals known to possess visual capabilities. In vertebrates, the necessity of spanning a dynamic range of light intensities of many orders of magnitude has given rise to two different types of photoreceptors, rods specialized for dim-light conditions, and cones for daylight and color vision. These photoreceptors contain different types of visual pigment genes. Reviewed here are methods of inferring ancestral sequences, chemical synthesis of artificial ancestral genes in the laboratory, and applications to the evolution of vertebrate visual systems and the experimental recreation of an archosaur rod visual pigment. The ancestral archosaurs gave rise to several notable lineages of diapsid reptiles, including the birds and the dinosaurs, and would have existed over 200 MYA. What little is known of their physiology comes from fossil remains, and inference based on the biology of their living descendants. Despite its age, an ancestral archosaur pigment was successfully recreated in the lab, and showed interesting properties of its wavelength sensitivity that may have implications for the visual capabilities of the ancestral archosaurs in dim light.

Understanding regulatory networks requires more than computing a multitude of graph statistics. Comment on "Drivers of structural features in gene regulatory networks: From biophysical constraints to biological function" by O.C. Martin et al.

NASA Astrophysics Data System (ADS)

Tkačik, Gašper

2016-07-01

The article by O. Martin and colleagues provides a much needed systematic review of a body of work that relates the topological structure of genetic regulatory networks to evolutionary selection for function. This connection is very important. Using the current wealth of genomic data, statistical features of regulatory networks (e.g., degree distributions, motif composition, etc.) can be quantified rather easily; it is, however, often unclear how to interpret the results. On a graph theoretic level the statistical significance of the results can be evaluated by comparing observed graphs to ;randomized; ones (bravely ignoring the issue of how precisely to randomize!) and comparing the frequency of appearance of a particular network structure relative to a randomized null expectation. While this is a convenient operational test for statistical significance, its biological meaning is questionable. In contrast, an in-silico genotype-to-phenotype model makes explicit the assumptions about the network function, and thus clearly defines the expected network structures that can be compared to the case of no selection for function and, ultimately, to data.

A study of the dynamics of multi-player games on small networks using territorial interactions.

PubMed

Broom, Mark; Lafaye, Charlotte; Pattni, Karan; Rychtář, Jan

2015-12-01

Recently, the study of structured populations using models of evolutionary processes on graphs has begun to incorporate a more general type of interaction between individuals, allowing multi-player games to be played among the population. In this paper, we develop a birth-death dynamics for use in such models and consider the evolution of populations for special cases of very small graphs where we can easily identify all of the population states and carry out exact analyses. To do so, we study two multi-player games, a Hawk-Dove game and a public goods game. Our focus is on finding the fixation probability of an individual from one type, cooperator or defector in the case of the public goods game, within a population of the other type. We compare this value for both games on several graphs under different parameter values and assumptions, and identify some interesting general features of our model. In particular there is a very close relationship between the fixation probability and the mean temperature, with high temperatures helping fitter individuals and punishing unfit ones and so enhancing selection, whereas low temperatures give a levelling effect which suppresses selection.

Integration of biological data by kernels on graph nodes allows prediction of new genes involved in mitotic chromosome condensation

PubMed Central

Hériché, Jean-Karim; Lees, Jon G.; Morilla, Ian; Walter, Thomas; Petrova, Boryana; Roberti, M. Julia; Hossain, M. Julius; Adler, Priit; Fernández, José M.; Krallinger, Martin; Haering, Christian H.; Vilo, Jaak; Valencia, Alfonso; Ranea, Juan A.; Orengo, Christine; Ellenberg, Jan

2014-01-01

The advent of genome-wide RNA interference (RNAi)–based screens puts us in the position to identify genes for all functions human cells carry out. However, for many functions, assay complexity and cost make genome-scale knockdown experiments impossible. Methods to predict genes required for cell functions are therefore needed to focus RNAi screens from the whole genome on the most likely candidates. Although different bioinformatics tools for gene function prediction exist, they lack experimental validation and are therefore rarely used by experimentalists. To address this, we developed an effective computational gene selection strategy that represents public data about genes as graphs and then analyzes these graphs using kernels on graph nodes to predict functional relationships. To demonstrate its performance, we predicted human genes required for a poorly understood cellular function—mitotic chromosome condensation—and experimentally validated the top 100 candidates with a focused RNAi screen by automated microscopy. Quantitative analysis of the images demonstrated that the candidates were indeed strongly enriched in condensation genes, including the discovery of several new factors. By combining bioinformatics prediction with experimental validation, our study shows that kernels on graph nodes are powerful tools to integrate public biological data and predict genes involved in cellular functions of interest. PMID:24943848

Visualizing risks in cancer communication: A systematic review of computer-supported visual aids.

PubMed

Stellamanns, Jan; Ruetters, Dana; Dahal, Keshav; Schillmoeller, Zita; Huebner, Jutta

2017-08-01

Health websites are becoming important sources for cancer information. Lay users, patients and carers seek support for critical decisions, but they are prone to common biases when quantitative information is presented. Graphical representations of risk data can facilitate comprehension, and interactive visualizations are popular. This review summarizes the evidence on computer-supported graphs that present risk data and their effects on various measures. The systematic literature search was conducted in several databases, including MEDLINE, EMBASE and CINAHL. Only studies with a controlled design were included. Relevant publications were carefully selected and critically appraised by two reviewers. Thirteen studies were included. Ten studies evaluated static graphs and three dynamic formats. Most decision scenarios were hypothetical. Static graphs could improve accuracy, comprehension, and behavioural intention. But the results were heterogeneous and inconsistent among the studies. Dynamic formats were not superior or even impaired performance compared to static formats. Static graphs show promising but inconsistent results, while research on dynamic visualizations is scarce and must be interpreted cautiously due to methodical limitations. Well-designed and context-specific static graphs can support web-based cancer risk communication in particular populations. The application of dynamic formats cannot be recommended and needs further research. Copyright © 2017 Elsevier B.V. All rights reserved.

The historical biogeography of Mammalia

PubMed Central

Springer, Mark S.; Meredith, Robert W.; Janecka, Jan E.; Murphy, William J.

2011-01-01

Palaeobiogeographic reconstructions are underpinned by phylogenies, divergence times and ancestral area reconstructions, which together yield ancestral area chronograms that provide a basis for proposing and testing hypotheses of dispersal and vicariance. Methods for area coding include multi-state coding with a single character, binary coding with multiple characters and string coding. Ancestral reconstruction methods are divided into parsimony versus Bayesian/likelihood approaches. We compared nine methods for reconstructing ancestral areas for placental mammals. Ambiguous reconstructions were a problem for all methods. Important differences resulted from coding areas based on the geographical ranges of extant species versus the geographical provenance of the oldest fossil for each lineage. Africa and South America were reconstructed as the ancestral areas for Afrotheria and Xenarthra, respectively. Most methods reconstructed Eurasia as the ancestral area for Boreoeutheria, Euarchontoglires and Laurasiatheria. The coincidence of molecular dates for the separation of Afrotheria and Xenarthra at approximately 100 Ma with the plate tectonic sundering of Africa and South America hints at the importance of vicariance in the early history of Placentalia. Dispersal has also been important including the origins of Madagascar's endemic mammal fauna. Further studies will benefit from increased taxon sampling and the application of new ancestral area reconstruction methods. PMID:21807730

Building dynamic population graph for accurate correspondence detection.

PubMed

Du, Shaoyi; Guo, Yanrong; Sanroma, Gerard; Ni, Dong; Wu, Guorong; Shen, Dinggang

2015-12-01

In medical imaging studies, there is an increasing trend for discovering the intrinsic anatomical difference across individual subjects in a dataset, such as hand images for skeletal bone age estimation. Pair-wise matching is often used to detect correspondences between each individual subject and a pre-selected model image with manually-placed landmarks. However, the large anatomical variability across individual subjects can easily compromise such pair-wise matching step. In this paper, we present a new framework to simultaneously detect correspondences among a population of individual subjects, by propagating all manually-placed landmarks from a small set of model images through a dynamically constructed image graph. Specifically, we first establish graph links between models and individual subjects according to pair-wise shape similarity (called as forward step). Next, we detect correspondences for the individual subjects with direct links to any of model images, which is achieved by a new multi-model correspondence detection approach based on our recently-published sparse point matching method. To correct those inaccurate correspondences, we further apply an error detection mechanism to automatically detect wrong correspondences and then update the image graph accordingly (called as backward step). After that, all subject images with detected correspondences are included into the set of model images, and the above two steps of graph expansion and error correction are repeated until accurate correspondences for all subject images are established. Evaluations on real hand X-ray images demonstrate that our proposed method using a dynamic graph construction approach can achieve much higher accuracy and robustness, when compared with the state-of-the-art pair-wise correspondence detection methods as well as a similar method but using static population graph. Copyright © 2015 Elsevier B.V. All rights reserved.

Random Walk Graph Laplacian-Based Smoothness Prior for Soft Decoding of JPEG Images.

PubMed

Liu, Xianming; Cheung, Gene; Wu, Xiaolin; Zhao, Debin

2017-02-01

Given the prevalence of joint photographic experts group (JPEG) compressed images, optimizing image reconstruction from the compressed format remains an important problem. Instead of simply reconstructing a pixel block from the centers of indexed discrete cosine transform (DCT) coefficient quantization bins (hard decoding), soft decoding reconstructs a block by selecting appropriate coefficient values within the indexed bins with the help of signal priors. The challenge thus lies in how to define suitable priors and apply them effectively. In this paper, we combine three image priors-Laplacian prior for DCT coefficients, sparsity prior, and graph-signal smoothness prior for image patches-to construct an efficient JPEG soft decoding algorithm. Specifically, we first use the Laplacian prior to compute a minimum mean square error initial solution for each code block. Next, we show that while the sparsity prior can reduce block artifacts, limiting the size of the overcomplete dictionary (to lower computation) would lead to poor recovery of high DCT frequencies. To alleviate this problem, we design a new graph-signal smoothness prior (desired signal has mainly low graph frequencies) based on the left eigenvectors of the random walk graph Laplacian matrix (LERaG). Compared with the previous graph-signal smoothness priors, LERaG has desirable image filtering properties with low computation overhead. We demonstrate how LERaG can facilitate recovery of high DCT frequencies of a piecewise smooth signal via an interpretation of low graph frequency components as relaxed solutions to normalized cut in spectral clustering. Finally, we construct a soft decoding algorithm using the three signal priors with appropriate prior weights. Experimental results show that our proposal outperforms the state-of-the-art soft decoding algorithms in both objective and subjective evaluations noticeably.

A reverse genetic approach identifies an ancestral frameshift mutation in RP1 causing recessive progressive retinal degeneration in European cattle breeds.

PubMed

Michot, Pauline; Chahory, Sabine; Marete, Andrew; Grohs, Cécile; Dagios, Dimitri; Donzel, Elise; Aboukadiri, Abdelhak; Deloche, Marie-Christine; Allais-Bonnet, Aurélie; Chambrial, Matthieu; Barbey, Sarah; Genestout, Lucie; Boussaha, Mekki; Danchin-Burge, Coralie; Fritz, Sébastien; Boichard, Didier; Capitan, Aurélien

2016-08-10

Domestication and artificial selection have resulted in strong genetic drift, relaxation of purifying selection and accumulation of deleterious mutations. As a consequence, bovine breeds experience regular outbreaks of recessive genetic defects which might represent only the tip of the iceberg since their detection depends on the observation of affected animals with distinctive symptoms. Thus, recessive mutations resulting in embryonic mortality or in non-specific symptoms are likely to be missed. The increasing availability of whole-genome sequences has opened new research avenues such as reverse genetics for their investigation. Our aim was to characterize the genetic load of 15 European breeds using data from the 1000 bull genomes consortium and prove that widespread harmful mutations remain to be detected. We listed 2489 putative deleterious variants (in 1923 genes) segregating at a minimal frequency of 5 % in at least one of the breeds studied. Gene enrichment analysis showed major enrichment for genes related to nervous, visual and auditory systems, and moderate enrichment for genes related to cardiovascular and musculoskeletal systems. For verification purposes, we investigated the phenotypic consequences of a frameshift variant in the retinitis pigmentosa-1 gene segregating in several breeds and at a high frequency (27 %) in Normande cattle. As described in certain human patients, clinical and histological examination revealed that this mutation causes progressive degeneration of photoreceptors leading to complete blindness in homozygotes. We established that the deleterious allele was even more frequent in the Normande breed before 1975 (>40 %) and has been progressively counter-selected likely because of its associated negative effect on udder morphology. Finally, using identity-by-descent analysis we demonstrated that this mutation resulted from a unique ancestral event that dates back to ~2800 to 4000 years. We provide a list of mutations that likely represent a substantial part of the genetic load of domestication in European cattle. We demonstrate that they accumulated non-randomly and that genes related to cognition and sensory functions are particularly affected. Finally, we describe an ancestral deleterious variant segregating in different breeds causing progressive retinal degeneration and irreversible blindness in adult animals.

A limited number of Y chromosome lineages is present in North American Holsteins.

PubMed

Yue, Xiang-Peng; Dechow, Chad; Liu, Wan-Sheng

2015-04-01

Holsteins are the most numerous dairy cattle breed in North America and the breed has undergone intensive selection for improving milk production and conformation. Theoretically, this intensive selection could lead to a reduction of the effective population size and reduced genetic diversity. The objective of this study was to investigate the effective population size of the Holstein Y chromosome and the effects of limited Y chromosome lineages on male reproduction and the future of the breed. Paternal pedigree information of 62,897 Holstein bulls born between 1950 and 2013 in North America and 220,872 bulls evaluated by multiple-trait across-country genetic evaluations of Interbull (Uppsala, Sweden) were collected and analyzed. The results indicated that the number of Y chromosome lineages in Holsteins has undergone a dramatic decrease during the past 50 years because of artificial selection and the application of artificial insemination (AI) technology. All current Holstein AI bulls in North America are the descendants of only 2 ancestors (Hulleman and Neptune H) born in 1880. These 2 ancestral Y-lineages are continued through 3 dominant pedigrees from the 1960s; namely, Pawnee Farm Arlinda Chief, Round Oak Rag Apple Elevation, and Penstate Ivanhoe Star, with a contribution of 48.78, 51.06, and 0.16% to the Holstein bull population in the 2010s, respectively. The Y-lineage of Penstate Ivanhoe Star is almost eliminated from the breed. The genetic variations in the 2 ancestral Y-lineages were evaluated among 257 bulls by determining the copy number variations (CNV) of 3 Y-linked gene families: PRAMEY, HSFY, and ZNF280BY, which are spread along the majority (95%) of the bovine Y chromosome male-specific region (MSY). No significant difference was found between the 2 ancestral Y-lineages, although large CNV were observed within each lineage. This study suggests minimal genetic diversity on the Y chromosome in Holsteins and provides a starting point for investigating the effect of the extremely limited number of Y-lineages on male reproduction and other traits important for the future of the Holstein breed. Copyright © 2015 American Dairy Science Association. Published by Elsevier Inc. All rights reserved.

Migration and the evolution of sexual dichromatism: evolutionary loss of female coloration with migration among wood-warblers.

PubMed

Simpson, Richard K; Johnson, Michele A; Murphy, Troy G

2015-06-22

The mechanisms underlying evolutionary changes in sexual dimorphism have long been of interest to biologists. A striking gradient in sexual dichromatism exists among songbirds in North America, including the wood-warblers (Parulidae): males are generally more colourful than females at northern latitudes, while the sexes are similarly ornamented at lower latitudes. We use phylogenetically controlled comparative analysis to test three non-mutually exclusive hypotheses for the evolution of sexual dichromatism among wood-warblers. The first two hypotheses focus on the loss of female coloration with the evolution of migration, either owing to the costs imposed by visual predators during migration, or owing to the relaxation of selection for female social signalling at higher latitudes. The third hypothesis focuses on whether sexual dichromatism evolved owing to changes in male ornamentation as the strength of sexual selection increases with breeding latitude. To test these hypotheses, we compared sexual dichromatism to three variables: the presence of migration, migration distance, and breeding latitude. We found that the presence of migration and migration distance were both positively correlated with sexual dichromatism, but models including breeding latitude alone were not strongly supported. Ancestral state reconstruction supports the hypothesis that the ancestral wood-warblers were monochromatic, with both colourful males and females. Combined, these results are consistent with the hypotheses that the evolution of migration is associated with the relaxation of selection for social signalling among females and that there are increased predatory costs along longer migratory routes for colourful females. These results suggest that loss of female ornamentation can be a driver of sexual dichromatism and that social or natural selection may be a stronger contributor to variation in dichromatism than sexual selection. © 2015 The Author(s) Published by the Royal Society. All rights reserved.

Migration and the evolution of sexual dichromatism: evolutionary loss of female coloration with migration among wood-warblers

PubMed Central

Simpson, Richard K.; Johnson, Michele A.; Murphy, Troy G.

2015-01-01

The mechanisms underlying evolutionary changes in sexual dimorphism have long been of interest to biologists. A striking gradient in sexual dichromatism exists among songbirds in North America, including the wood-warblers (Parulidae): males are generally more colourful than females at northern latitudes, while the sexes are similarly ornamented at lower latitudes. We use phylogenetically controlled comparative analysis to test three non-mutually exclusive hypotheses for the evolution of sexual dichromatism among wood-warblers. The first two hypotheses focus on the loss of female coloration with the evolution of migration, either owing to the costs imposed by visual predators during migration, or owing to the relaxation of selection for female social signalling at higher latitudes. The third hypothesis focuses on whether sexual dichromatism evolved owing to changes in male ornamentation as the strength of sexual selection increases with breeding latitude. To test these hypotheses, we compared sexual dichromatism to three variables: the presence of migration, migration distance, and breeding latitude. We found that the presence of migration and migration distance were both positively correlated with sexual dichromatism, but models including breeding latitude alone were not strongly supported. Ancestral state reconstruction supports the hypothesis that the ancestral wood-warblers were monochromatic, with both colourful males and females. Combined, these results are consistent with the hypotheses that the evolution of migration is associated with the relaxation of selection for social signalling among females and that there are increased predatory costs along longer migratory routes for colourful females. These results suggest that loss of female ornamentation can be a driver of sexual dichromatism and that social or natural selection may be a stronger contributor to variation in dichromatism than sexual selection. PMID:26019159

GASP: Gapped Ancestral Sequence Prediction for proteins

PubMed Central

Edwards, Richard J; Shields, Denis C

2004-01-01

Background The prediction of ancestral protein sequences from multiple sequence alignments is useful for many bioinformatics analyses. Predicting ancestral sequences is not a simple procedure and relies on accurate alignments and phylogenies. Several algorithms exist based on Maximum Parsimony or Maximum Likelihood methods but many current implementations are unable to process residues with gaps, which may represent insertion/deletion (indel) events or sequence fragments. Results Here we present a new algorithm, GASP (Gapped Ancestral Sequence Prediction), for predicting ancestral sequences from phylogenetic trees and the corresponding multiple sequence alignments. Alignments may be of any size and contain gaps. GASP first assigns the positions of gaps in the phylogeny before using a likelihood-based approach centred on amino acid substitution matrices to assign ancestral amino acids. Important outgroup information is used by first working down from the tips of the tree to the root, using descendant data only to assign probabilities, and then working back up from the root to the tips using descendant and outgroup data to make predictions. GASP was tested on a number of simulated datasets based on real phylogenies. Prediction accuracy for ungapped data was similar to three alternative algorithms tested, with GASP performing better in some cases and worse in others. Adding simple insertions and deletions to the simulated data did not have a detrimental effect on GASP accuracy. Conclusions GASP (Gapped Ancestral Sequence Prediction) will predict ancestral sequences from multiple protein alignments of any size. Although not as accurate in all cases as some of the more sophisticated maximum likelihood approaches, it can process a wide range of input phylogenies and will predict ancestral sequences for gapped and ungapped residues alike. PMID:15350199

Mining chemical reactions using neighborhood behavior and condensed graphs of reactions approaches.

PubMed

de Luca, Aurélie; Horvath, Dragos; Marcou, Gilles; Solov'ev, Vitaly; Varnek, Alexandre

2012-09-24

This work addresses the problem of similarity search and classification of chemical reactions using Neighborhood Behavior (NB) and Condensed Graphs of Reaction (CGR) approaches. The CGR formalism represents chemical reactions as a classical molecular graph with dynamic bonds, enabling descriptor calculations on this graph. Different types of the ISIDA fragment descriptors generated for CGRs in combination with two metrics--Tanimoto and Euclidean--were considered as chemical spaces, to serve for reaction dissimilarity scoring. The NB method has been used to select an optimal combination of descriptors which distinguish different types of chemical reactions in a database containing 8544 reactions of 9 classes. Relevance of NB analysis has been validated in generic (multiclass) similarity search and in clustering with Self-Organizing Maps (SOM). NB-compliant sets of descriptors were shown to display enhanced mapping propensities, allowing the construction of better Self-Organizing Maps and similarity searches (NB and classical similarity search criteria--AUC ROC--correlate at a level of 0.7). The analysis of the SOM clusters proved chemically meaningful CGR substructures representing specific reaction signatures.

Petrologic, tectonic, and metallogenic evolution of the Ancestral Cascades magmatic arc, Washington, Oregon, and northern California

USGS Publications Warehouse

du Bray, Edward A.; John, David A.

2011-01-01

Present-day High Cascades arc magmatism was preceded by ~40 m.y. of nearly cospatial magmatism represented by the ancestral Cascades arc in Washington, Oregon, and northernmost California (United States). Time-space-composition relations for the ancestral Cascades arc have been synthesized from a recent compilation of more than 4000 geochemical analyses and associated age data. Neither the composition nor distribution of ancestral Cascades magmatism was uniform along the length of the ancestral arc through time. Initial (>40 to 36 Ma) ancestral Cascades magmatism (mostly basalt and basaltic andesite) was focused at the north end of the arc between the present-day locations of Mount Rainier and the Columbia River. From 35 to 18 Ma, initial basaltic andesite and andesite magmatism evolved to include dacite and rhyolite; magmatic activity became more voluminous and extended along most of the arc. Between 17 and 8 Ma, magmatism was focused along the part of the arc coincident with the northern two-thirds of Oregon and returned to more mafic compositions. Subsequent ancestral Cascades magmatism was dominated by basaltic andesite to basalt prior to the post–4 Ma onset of High Cascades magmatism. Transitional tholeiitic to calc-alkaline compositions dominated early (before 40 to ca. 25 Ma) ancestral Cascades eruptive products, whereas the majority of the younger arc rocks have a calc-alkaline affinity. Tholeiitic compositions characteristic of the oldest ancestral arc magmas suggest development associated with thin, immature crust and slab window processes, whereas the younger, calc-alkaline magmas suggest interaction with thicker, more evolved crust and more conventional subduction-related magmatic processes. Presumed changes in subducted slab dip through time also correlate with fundamental magma composition variation. The predominance of mafic compositions during latest ancestral arc magmatism and throughout the history of modern High Cascades magmatism probably reflects extensional tectonics that dominated during these periods of arc magmatism. Mineral deposits associated with ancestral Cascades arc rocks are uncommon; most are small and low grade relative to those found in other continental magmatic arcs. The small size, low grade, and dearth of deposits, especially in the southern two-thirds of the ancestral arc, probably reflect many factors, the most important of which may be the prevalence of extensional tectonics within this arc domain during this magmatic episode. Progressive clockwise rotation of the forearc block west of the evolving Oregon part of the ancestral Cascades magmatism produced an extensional regime that did not foster significant mineral deposit formation. In contrast, the Washington arc domain developed in a transpressional to mildly compressive regime that was more conducive to magmatic processes and hydrothermal fluid channeling critical to deposit formation. Small, low-grade porphyry copper deposits in the northern third of the ancestral Cascades arc segment also may be a consequence of more mature continental crust, including a Mesozoic component, beneath Washington north of Mount St. Helens.

Embedded Multiprocessor Technology for VHSIC Insertion

NASA Technical Reports Server (NTRS)

Hayes, Paul J.

1990-01-01

Viewgraphs on embedded multiprocessor technology for VHSIC insertion are presented. The objective was to develop multiprocessor system technology providing user-selectable fault tolerance, increased throughput, and ease of application representation for concurrent operation. The approach was to develop graph management mapping theory for proper performance, model multiprocessor performance, and demonstrate performance in selected hardware systems.

Born both ways: the alloparenting hypothesis for sexual fluidity in women.

PubMed

Kuhle, Barry X; Radtke, Sarah

2013-04-07

Given the primacy of reproduction, same-sex sexual behavior poses an evolutionary puzzle. Why would selection fashion motivational mechanisms to engage in sexual behaviors with members of the same sex? We propose the alloparenting hypothesis, which posits that sexual fluidity in women is a contingent adaptation that increased ancestral women's ability to form pair bonds with female alloparents who helped them rear children to reproductive age. Ancestral women recurrently faced the adaptive problems of securing resources and care for their offspring, but were frequently confronted with either a dearth of paternal resources due to their mates' death, an absence of paternal investment due to rape, or a divestment of paternal resources due to their mates' extra-pair mating efforts. A fluid sexuality would have helped ancestral women secure resources and care for their offspring by promoting the acquisition of allomothering investment from unrelated women. Under this view, most heterosexual women are born with the capacity to form romantic bonds with both sexes. Sexual fluidity is a conditional reproductive strategy with pursuit of men as the default strategy and same-sex sexual responsiveness triggered when inadequate paternal investment occurs or when women with alloparenting capabilities are encountered. Discussion focuses on (a) evidence for alloparenting and sexual fluidity in humans and other primates; (b) alternative explanations for sexual fluidity in women; and(c) fourteen circumstances predicted to promote same-sex sexual behavior in women.

Comprehensive phylogenetic analysis of all species of swordtails and platies (Pisces: Genus Xiphophorus) uncovers a hybrid origin of a swordtail fish, Xiphophorus monticolus, and demonstrates that the sexually selected sword originated in the ancestral lineage of the genus, but was lost again secondarily

PubMed Central

2013-01-01

Background Males in some species of the genus Xiphophorus, small freshwater fishes from Meso-America, have an extended caudal fin, or sword – hence their common name “swordtails”. Longer swords are preferred by females from both sworded and – surprisingly also, non-sworded (platyfish) species that belong to the same genus. Swordtails have been studied widely as models in research on sexual selection. Specifically, the pre-existing bias hypothesis was interpreted to best explain the observed bias of females in presumed ancestral lineages of swordless species that show a preference for assumed derived males with swords over their conspecific swordless males. However, many of the phylogenetic relationships within this genus still remained unresolved. Here we construct a comprehensive molecular phylogeny of all 26 known Xiphophorus species, including the four recently described species (X. kallmani, X. mayae, X. mixei and X. monticolus). We use two mitochondrial and six new nuclear markers in an effort to increase the understanding of the evolutionary relationships among the species in this genus. Based on the phylogeny, the evolutionary history and character state evolution of the sword was reconstructed and found to have originated in the common ancestral lineage of the genus Xiphophorus and that it was lost again secondarily. Results We estimated the evolutionary relationships among all known species of the genus Xiphophorus based on the largest set of DNA markers so far. The phylogeny indicates that one of the newly described swordtail species, Xiphophorus monticolus, is likely to have arisen through hybridization since it is placed with the southern platyfish in the mitochondrial phylogeny, but with the southern swordtails in the nuclear phylogeny. Such discordance between these two types of markers is a strong indication for a hybrid origin. Additionally, by using a maximum likelihood approach the possession of the sexually selected sword trait is shown to be the most likely ancestral state for the genus Xiphophorus. Further, we provide a well supported estimation of the phylogenetic relationships between the previously unresolved northern swordtail groups. Conclusions This comprehensive molecular phylogeny of the entire genus Xiphophorus provides evidence that a second swordtail species, X. monticolus, arose through hybridization. Previously, we demonstrated that X. clemenciae, another southern swordtail species, arose via hybridization. These findings highlight the potential key role of hybridization in the evolution of this genus and suggest the need for further investigations into how hybridization contributes to speciation more generally. PMID:23360326

On finding bicliques in bipartite graphs: a novel algorithm and its application to the integration of diverse biological data types

PubMed Central

2014-01-01

Background Integrating and analyzing heterogeneous genome-scale data is a huge algorithmic challenge for modern systems biology. Bipartite graphs can be useful for representing relationships across pairs of disparate data types, with the interpretation of these relationships accomplished through an enumeration of maximal bicliques. Most previously-known techniques are generally ill-suited to this foundational task, because they are relatively inefficient and without effective scaling. In this paper, a powerful new algorithm is described that produces all maximal bicliques in a bipartite graph. Unlike most previous approaches, the new method neither places undue restrictions on its input nor inflates the problem size. Efficiency is achieved through an innovative exploitation of bipartite graph structure, and through computational reductions that rapidly eliminate non-maximal candidates from the search space. An iterative selection of vertices for consideration based on non-decreasing common neighborhood sizes boosts efficiency and leads to more balanced recursion trees. Results The new technique is implemented and compared to previously published approaches from graph theory and data mining. Formal time and space bounds are derived. Experiments are performed on both random graphs and graphs constructed from functional genomics data. It is shown that the new method substantially outperforms the best previous alternatives. Conclusions The new method is streamlined, efficient, and particularly well-suited to the study of huge and diverse biological data. A robust implementation has been incorporated into GeneWeaver, an online tool for integrating and analyzing functional genomics experiments, available at http://geneweaver.org. The enormous increase in scalability it provides empowers users to study complex and previously unassailable gene-set associations between genes and their biological functions in a hierarchical fashion and on a genome-wide scale. This practical computational resource is adaptable to almost any applications environment in which bipartite graphs can be used to model relationships between pairs of heterogeneous entities. PMID:24731198

A Dynamic Graph Cuts Method with Integrated Multiple Feature Maps for Segmenting Kidneys in 2D Ultrasound Images.

PubMed

Zheng, Qiang; Warner, Steven; Tasian, Gregory; Fan, Yong

2018-02-12

Automatic segmentation of kidneys in ultrasound (US) images remains a challenging task because of high speckle noise, low contrast, and large appearance variations of kidneys in US images. Because texture features may improve the US image segmentation performance, we propose a novel graph cuts method to segment kidney in US images by integrating image intensity information and texture feature maps. We develop a new graph cuts-based method to segment kidney US images by integrating original image intensity information and texture feature maps extracted using Gabor filters. To handle large appearance variation within kidney images and improve computational efficiency, we build a graph of image pixels close to kidney boundary instead of building a graph of the whole image. To make the kidney segmentation robust to weak boundaries, we adopt localized regional information to measure similarity between image pixels for computing edge weights to build the graph of image pixels. The localized graph is dynamically updated and the graph cuts-based segmentation iteratively progresses until convergence. Our method has been evaluated based on kidney US images of 85 subjects. The imaging data of 20 randomly selected subjects were used as training data to tune parameters of the image segmentation method, and the remaining data were used as testing data for validation. Experiment results demonstrated that the proposed method obtained promising segmentation results for bilateral kidneys (average Dice index = 0.9446, average mean distance = 2.2551, average specificity = 0.9971, average accuracy = 0.9919), better than other methods under comparison (P < .05, paired Wilcoxon rank sum tests). The proposed method achieved promising performance for segmenting kidneys in two-dimensional US images, better than segmentation methods built on any single channel of image information. This method will facilitate extraction of kidney characteristics that may predict important clinical outcomes such as progression of chronic kidney disease. Copyright © 2018 The Association of University Radiologists. Published by Elsevier Inc. All rights reserved.

An experimental phylogeny to benchmark ancestral sequence reconstruction

PubMed Central

Randall, Ryan N.; Radford, Caelan E.; Roof, Kelsey A.; Natarajan, Divya K.; Gaucher, Eric A.

2016-01-01

Ancestral sequence reconstruction (ASR) is a still-burgeoning method that has revealed many key mechanisms of molecular evolution. One criticism of the approach is an inability to validate its algorithms within a biological context as opposed to a computer simulation. Here we build an experimental phylogeny using the gene of a single red fluorescent protein to address this criticism. The evolved phylogeny consists of 19 operational taxonomic units (leaves) and 17 ancestral bifurcations (nodes) that display a wide variety of fluorescent phenotypes. The 19 leaves then serve as ‘modern' sequences that we subject to ASR analyses using various algorithms and to benchmark against the known ancestral genotypes and ancestral phenotypes. We confirm computer simulations that show all algorithms infer ancient sequences with high accuracy, yet we also reveal wide variation in the phenotypes encoded by incorrectly inferred sequences. Specifically, Bayesian methods incorporating rate variation significantly outperform the maximum parsimony criterion in phenotypic accuracy. Subsampling of extant sequences had minor effect on the inference of ancestral sequences. PMID:27628687

Ancestral effect on HOMA-IR levels quantitated in an American population of Mexican origin.

PubMed

Qu, Hui-Qi; Li, Quan; Lu, Yang; Hanis, Craig L; Fisher-Hoch, Susan P; McCormick, Joseph B

2012-12-01

An elevated insulin resistance index (homeostasis model assessment of insulin resistance [HOMA-IR]) is more commonly seen in the Mexican American population than in European populations. We report quantitative ancestral effects within a Mexican American population, and we correlate ancestral components with HOMA-IR. We performed ancestral analysis in 1,551 participants of the Cameron County Hispanic Cohort by genotyping 103 ancestry-informative markers (AIMs). These AIMs allow determination of the percentage (0-100%) ancestry from three major continental populations, i.e., European, African, and Amerindian. We observed that predominantly Amerindian ancestral components were associated with increased HOMA-IR (β = 0.124, P = 1.64 × 10(-7)). The correlation was more significant in males (Amerindian β = 0.165, P = 5.08 × 10(-7)) than in females (Amerindian β = 0.079, P = 0.019). This unique study design demonstrates how genomic markers for quantitative ancestral information can be used in admixed populations to predict phenotypic traits such as insulin resistance.

Chromosome evolution in kangaroos (Marsupialia: Macropodidae): cross species chromosome painting between the tammar wallaby and rock wallaby spp. with the 2n = 22 ancestral macropodid karyotype.

PubMed

O'Neill, R J; Eldridge, M D; Toder, R; Ferguson-Smith, M A; O'Brien, P C; Graves, J A

1999-06-01

Marsupial mammals show extraordinary karyotype stability, with 2n = 14 considered ancestral. However, macropodid marsupials (kangaroos and wallabies) exhibit a considerable variety of karyotypes, with a hypothesised ancestral karyotype of 2n = 22. Speciation and karyotypic diversity in rock wallabies (Petrogale) is exceptional. We used cross species chromosome painting to examine the chromosome evolution between the tammar wallaby (2n = 16) and three 2n = 22 rock wallaby species groups with the putative ancestral karyotype. Hybridization of chromosome paints prepared from flow sorted chromosomes of the tammar wallaby to Petrogale spp., showed that this ancestral karyotype is largely conserved among 2n = 22 rock wallaby species, and confirmed the identity of ancestral chromosomes which fused to produce the bi-armed chromosomes of the 2n = 16 tammar wallaby. These results illustrate the fission-fusion process of karyotype evolution characteristic of the kangaroo group.

Adaptive Memory: Ancestral Priorities and the Mnemonic Value of Survival Processing

ERIC Educational Resources Information Center

Nairne, James S.; Pandeirada, Josefa N. S.

2010-01-01

Evolutionary psychologists often propose that humans carry around "stone-age" brains, along with a toolkit of cognitive adaptations designed originally to solve hunter-gatherer problems. This perspective predicts that optimal cognitive performance might sometimes be induced by ancestrally-based problems, those present in ancestral environments,…

Accelerometer Method and Apparatus for Integral Display and Control Functions

NASA Technical Reports Server (NTRS)

Bozeman, Richard J., Jr. (Inventor)

1996-01-01

Method and apparatus for detecting mechanical vibrations and outputting a signal in response thereto. Art accelerometer package having integral display and control functions is suitable for mounting upon the machinery to be monitored. Display circuitry provides signals to a bar graph display which may be used to monitor machine conditions over a period of time. Control switches may be set which correspond to elements in the bar graph to provide an alert if vibration signals increase in amplitude over a selected trip point. The circuitry is shock mounted within the accelerometer housing. The method provides for outputting a broadband analog accelerometer signal, integrating this signal to produce a velocity signal, integrating and calibrating the velocity signal before application to a display driver, and selecting a trip point at which a digitally compatible output signal is generated.

Exploring the full catalytic cycle of rhodium(i)–BINAP-catalysed isomerisation of allylic amines: a graph theory approach for path optimisation† †Electronic supplementary information (ESI) available. See DOI: 10.1039/c7sc00401j Click here for additional data file.

PubMed Central

Yoshimura, Takayoshi; Taketsugu, Tetsuya; Sawamura, Masaya

2017-01-01

We explored the reaction mechanism of the cationic rhodium(i)–BINAP complex catalysed isomerisation of allylic amines using the artificial force induced reaction method with the global reaction route mapping strategy, which enabled us to search for various reaction paths without assumption of transition states. The entire reaction network was reproduced in the form of a graph, and reasonable paths were selected from the complicated network using Prim’s algorithm. As a result, a new dissociative reaction mechanism was proposed. Our comprehensive reaction path search provided rationales for the E/Z and S/R selectivities of the stereoselective reaction. PMID:28970877

Accelerometer Method and Apparatus for Integral Display and Control Functions

NASA Technical Reports Server (NTRS)

Bozeman, Richard J., Jr. (Inventor)

1998-01-01

Method and apparatus for detecting mechanical vibrations and outputting a signal in response thereto is discussed. An accelerometer package having integral display and control functions is suitable for mounting upon the machinery to be monitored. Display circuitry provides signals to a bar graph display which may be used to monitor machine conditions over a period of time. Control switches may be set which correspond to elements in the bar graph to provide an alert if vibration signals increase in amplitude over a selected trip point. The circuitry is shock mounted within the accelerometer housing. The method provides for outputting a broadband analog accelerometer signal, integrating this signal to produce a velocity signal, integrating and calibrating the velocity signal before application to a display driver, and selecting a trip point at which a digitally compatible output signal is generated.

Estimating Time to the Common Ancestor for a Beneficial Allele

PubMed Central

Smith, Joel; Coop, Graham; Stephens, Matthew; Novembre, John

2018-01-01

Abstract The haplotypes of a beneficial allele carry information about its history that can shed light on its age and the putative cause for its increase in frequency. Specifically, the signature of an allele’s age is contained in the pattern of variation that mutation and recombination impose on its haplotypic background. We provide a method to exploit this pattern and infer the time to the common ancestor of a positively selected allele following a rapid increase in frequency. We do so using a hidden Markov model which leverages the length distribution of the shared ancestral haplotype, the accumulation of derived mutations on the ancestral background, and the surrounding background haplotype diversity. Using simulations, we demonstrate how the inclusion of information from both mutation and recombination events increases accuracy relative to approaches that only consider a single type of event. We also show the behavior of the estimator in cases where data do not conform to model assumptions, and provide some diagnostics for assessing and improving inference. Using the method, we analyze population-specific patterns in the 1000 Genomes Project data to estimate the timing of adaptation for several variants which show evidence of recent selection and functional relevance to diet, skin pigmentation, and morphology in humans. PMID:29361025

Caste-biased gene expression in a facultatively eusocial bee suggests a role for genetic accommodation in the evolution of eusociality

PubMed Central

Kingwell, Callum J.; Wcislo, William T.; Robinson, Gene E.

2017-01-01

Developmental plasticity may accelerate the evolution of phenotypic novelty through genetic accommodation, but studies of genetic accommodation often lack knowledge of the ancestral state to place selected traits in an evolutionary context. A promising approach for assessing genetic accommodation involves using a comparative framework to ask whether ancestral plasticity is related to the evolution of a particular trait. Bees are an excellent group for such comparisons because caste-based societies (eusociality) have evolved multiple times independently and extant species exhibit different modes of eusociality. We measured brain and abdominal gene expression in a facultatively eusocial bee, Megalopta genalis, and assessed whether plasticity in this species is functionally linked to eusocial traits in other bee lineages. Caste-biased abdominal genes in M. genalis overlapped significantly with caste-biased genes in obligately eusocial bees. Moreover, caste-biased genes in M. genalis overlapped significantly with genes shown to be rapidly evolving in multiple studies of 10 bee species, particularly for genes in the glycolysis pathway and other genes involved in metabolism. These results provide support for the idea that eusociality can evolve via genetic accommodation, with plasticity in facultatively eusocial species like M. genalis providing a substrate for selection during the evolution of caste in obligately eusocial lineages. PMID:28053060

Caste-biased gene expression in a facultatively eusocial bee suggests a role for genetic accommodation in the evolution of eusociality.

PubMed

Jones, Beryl M; Kingwell, Callum J; Wcislo, William T; Robinson, Gene E

2017-01-11

Developmental plasticity may accelerate the evolution of phenotypic novelty through genetic accommodation, but studies of genetic accommodation often lack knowledge of the ancestral state to place selected traits in an evolutionary context. A promising approach for assessing genetic accommodation involves using a comparative framework to ask whether ancestral plasticity is related to the evolution of a particular trait. Bees are an excellent group for such comparisons because caste-based societies (eusociality) have evolved multiple times independently and extant species exhibit different modes of eusociality. We measured brain and abdominal gene expression in a facultatively eusocial bee, Megalopta genalis, and assessed whether plasticity in this species is functionally linked to eusocial traits in other bee lineages. Caste-biased abdominal genes in M. genalis overlapped significantly with caste-biased genes in obligately eusocial bees. Moreover, caste-biased genes in M. genalis overlapped significantly with genes shown to be rapidly evolving in multiple studies of 10 bee species, particularly for genes in the glycolysis pathway and other genes involved in metabolism. These results provide support for the idea that eusociality can evolve via genetic accommodation, with plasticity in facultatively eusocial species like M. genalis providing a substrate for selection during the evolution of caste in obligately eusocial lineages. © 2017 The Author(s).

Environmental change, phenotypic plasticity, and genetic compensation.

PubMed

Grether, Gregory F

2005-10-01

When a species encounters novel environmental conditions, some phenotypic characters may develop differently than in the ancestral environment. Most environmental perturbations of development are likely to reduce fitness, and thus selection would usually be expected to favor genetic changes that restore the ancestral phenotype. I propose the term "genetic compensation" to refer to this form of adaptive evolution. Genetic compensation is a subset of genetic accommodation and the reverse of genetic assimilation. When genetic compensation has occurred along a spatial environmental gradient, the mean trait values of populations in different environments may be more similar in the field than when representatives of the same populations are raised in a common environment (i.e., countergradient variation). If compensation is complete, genetic divergence between populations may be cryptic, that is, not detectable in the field. Here I apply the concept of genetic compensation to three examples involving carotenoid-based sexual coloration and then use these and other examples to discuss the concept in a broader context. I show that genetic compensation may lead to a cryptic form of reproductive isolation between populations evolving in different environments, may explain some puzzling cases in which heritable traits exposed to strong directional selection fail to show the expected evolutionary response, and may complicate efforts to monitor populations for signs of environmental deterioration.

Developmental origins of novel gut morphology in frogs

PubMed Central

Bloom, Stephanie; Ledon-Rettig, Cris; Infante, Carlos; Everly, Anne; Hanken, James; Nascone-Yoder, Nanette

2013-01-01

SUMMARY Phenotypic variation is a prerequisite for evolution by natural selection, yet the processes that give rise to the novel morphologies upon which selection acts are poorly understood. We employed a chemical genetic screen to identify developmental changes capable of generating ecologically relevant morphological variation as observed among extant species. Specifically, we assayed for exogenously applied small molecules capable of transforming the ancestral larval foregut of the herbivorous Xenopus laevis to resemble the derived larval foregut of the carnivorous Lepidobatrachus laevis. Appropriately, the small molecules that demonstrate this capacity modulate conserved morphogenetic pathways involved in gut development, including downregulation of retinoic acid (RA) signaling. Identical manipulation of RA signaling in a species that is more closely related to Lepidobatrachus, Ceratophrys cranwelli, yielded even more similar transformations, corroborating the relevance of RA signaling variation in interspecific morphological change. Finally, we were able to recover the ancestral gut phenotype in Lepidobatrachus by performing a reverse chemical manipulation to upregulate RA signaling, providing strong evidence that modifications to this specific pathway promoted the emergence of a lineage-specific phenotypic novelty. Interestingly, our screen also revealed pathways that have not yet been implicated in early gut morphogenesis, such as thyroid hormone signaling. In general, the chemical genetic screen may be a valuable tool for identifying developmental mechanisms that underlie ecologically and evolutionarily relevant phenotypic variation. PMID:23607305

Admixture Analysis of Spontaneous Hepatitis C Virus Clearance in Individuals of African-Descent

PubMed Central

Wojcik, Genevieve L.; Thio, Chloe L.; Kao, WH Linda; Latanich, Rachel; Goedert, James J.; Mehta, Shruti H.; Kirk, Gregory D.; Peters, Marion G.; Cox, Andrea L.; Kim, Arthur Y.; Chung, Raymond T.; Thomas, David L.; Duggal, Priya

2015-01-01

Hepatitis C virus (HCV) infects an estimated 3% of the global population with the majority of individuals (75–85%) failing to clear the virus without treatment, leading to chronic liver disease. Individuals of African-descent have lower rates of clearance compared to individuals of European-descent and this is not fully explained by social and environmental factors. This suggests that differences in genetic background may contribute to this difference in clinical outcome following HCV infection. Using 473 individuals and 792,721 SNPs from a genome-wide association study (GWAS), we estimated local African ancestry across the genome. Using admixture mapping and logistic regression we identified two regions of interest associated with spontaneous clearance of HCV (15q24, 20p12). A genome-wide significant variant was identified on chromosome 15 at the imputed SNP, rs55817928 (P=6.18×10−8) between the genes SCAPER and RCN. Each additional copy of the African ancestral C allele is associated with 2.4 times the odds of spontaneous clearance. Conditional analysis using this SNP in the logistic regression model explained one-third of the local ancestry association. Additionally, signals of selection in this area suggest positive selection due to some ancestral pathogen or environmental pressure in African, but not in European populations. PMID:24622687

Short-wavelength cone-opponent retinal ganglion cells in mammals.

PubMed

Marshak, David W; Mills, Stephen L

2014-03-01

In all of the mammalian species studied to date, the short-wavelength-sensitive (S) cones and the S-cone bipolar cells that receive their input are very similar, but the retinal ganglion cells that receive synapses from the S-cone bipolar cells appear to be quite different. Here, we review the literature on mammalian retinal ganglion cells that respond selectively to stimulation of S-cones and respond with opposite polarity to longer wavelength stimuli. There are at least three basic mechanisms to generate these color-opponent responses, including: (1) opponency is generated in the outer plexiform layer by horizontal cells and is conveyed to the ganglion cells via S-cone bipolar cells, (2) inputs from bipolar cells with different cone inputs and opposite response polarity converge directly on the ganglion cells, and (3) inputs from S-cone bipolar cells are inverted by S-cone amacrine cells. These are not mutually exclusive; some mammalian ganglion cells that respond selectively to S-cone stimulation seem to utilize at least two of them. Based on these findings, we suggest that the small bistratified ganglion cells described in primates are not the ancestral type, as proposed previously. Instead, the known types of ganglion cells in this pathway evolved from monostratified ancestral types and became bistratified in some mammalian lineages.

Ancestral sequence reconstruction in primate mitochondrial DNA: compositional bias and effect on functional inference.

PubMed

Krishnan, Neeraja M; Seligmann, Hervé; Stewart, Caro-Beth; De Koning, A P Jason; Pollock, David D

2004-10-01

Reconstruction of ancestral DNA and amino acid sequences is an important means of inferring information about past evolutionary events. Such reconstructions suggest changes in molecular function and evolutionary processes over the course of evolution and are used to infer adaptation and convergence. Maximum likelihood (ML) is generally thought to provide relatively accurate reconstructed sequences compared to parsimony, but both methods lead to the inference of multiple directional changes in nucleotide frequencies in primate mitochondrial DNA (mtDNA). To better understand this surprising result, as well as to better understand how parsimony and ML differ, we constructed a series of computationally simple "conditional pathway" methods that differed in the number of substitutions allowed per site along each branch, and we also evaluated the entire Bayesian posterior frequency distribution of reconstructed ancestral states. We analyzed primate mitochondrial cytochrome b (Cyt-b) and cytochrome oxidase subunit I (COI) genes and found that ML reconstructs ancestral frequencies that are often more different from tip sequences than are parsimony reconstructions. In contrast, frequency reconstructions based on the posterior ensemble more closely resemble extant nucleotide frequencies. Simulations indicate that these differences in ancestral sequence inference are probably due to deterministic bias caused by high uncertainty in the optimization-based ancestral reconstruction methods (parsimony, ML, Bayesian maximum a posteriori). In contrast, ancestral nucleotide frequencies based on an average of the Bayesian set of credible ancestral sequences are much less biased. The methods involving simpler conditional pathway calculations have slightly reduced likelihood values compared to full likelihood calculations, but they can provide fairly unbiased nucleotide reconstructions and may be useful in more complex phylogenetic analyses than considered here due to their speed and flexibility. To determine whether biased reconstructions using optimization methods might affect inferences of functional properties, ancestral primate mitochondrial tRNA sequences were inferred and helix-forming propensities for conserved pairs were evaluated in silico. For ambiguously reconstructed nucleotides at sites with high base composition variability, ancestral tRNA sequences from Bayesian analyses were more compatible with canonical base pairing than were those inferred by other methods. Thus, nucleotide bias in reconstructed sequences apparently can lead to serious bias and inaccuracies in functional predictions.

America's Black Population: 1970 to 1982. A Statistical View. Special Publication PIO/POP-83-1.

ERIC Educational Resources Information Center

Matney, William C.; Johnson, Dwight L.

This pamphlet is the first in a series designed to provide a compilation of selected demographic, social, economic, and other statistical data relating to selected populations. Topics covered here (in both discussion and table/graph format) include Black population growth and distribution, residence, income gain, poverty rate increase, labor force…

Automatic lung nodule graph cuts segmentation with deep learning false positive reduction

NASA Astrophysics Data System (ADS)

Sun, Wenqing; Huang, Xia; Tseng, Tzu-Liang Bill; Qian, Wei

2017-03-01

To automatic detect lung nodules from CT images, we designed a two stage computer aided detection (CAD) system. The first stage is graph cuts segmentation to identify and segment the nodule candidates, and the second stage is convolutional neural network for false positive reduction. The dataset contains 595 CT cases randomly selected from Lung Image Database Consortium and Image Database Resource Initiative (LIDC/IDRI) and the 305 pulmonary nodules achieved diagnosis consensus by all four experienced radiologists were our detection targets. Consider each slice as an individual sample, 2844 nodules were included in our database. The graph cuts segmentation was conducted in a two-dimension manner, 2733 lung nodule ROIs are successfully identified and segmented. With a false positive reduction by a seven-layer convolutional neural network, 2535 nodules remain detected while the false positive dropped to 31.6%. The average F-measure of segmented lung nodule tissue is 0.8501.

Searching social networks for subgraph patterns

NASA Astrophysics Data System (ADS)

Ogaard, Kirk; Kase, Sue; Roy, Heather; Nagi, Rakesh; Sambhoos, Kedar; Sudit, Moises

2013-06-01

Software tools for Social Network Analysis (SNA) are being developed which support various types of analysis of social networks extracted from social media websites (e.g., Twitter). Once extracted and stored in a database such social networks are amenable to analysis by SNA software. This data analysis often involves searching for occurrences of various subgraph patterns (i.e., graphical representations of entities and relationships). The authors have developed the Graph Matching Toolkit (GMT) which provides an intuitive Graphical User Interface (GUI) for a heuristic graph matching algorithm called the Truncated Search Tree (TruST) algorithm. GMT is a visual interface for graph matching algorithms processing large social networks. GMT enables an analyst to draw a subgraph pattern by using a mouse to select categories and labels for nodes and links from drop-down menus. GMT then executes the TruST algorithm to find the top five occurrences of the subgraph pattern within the social network stored in the database. GMT was tested using a simulated counter-insurgency dataset consisting of cellular phone communications within a populated area of operations in Iraq. The results indicated GMT (when executing the TruST graph matching algorithm) is a time-efficient approach to searching large social networks. GMT's visual interface to a graph matching algorithm enables intelligence analysts to quickly analyze and summarize the large amounts of data necessary to produce actionable intelligence.

PDB2Graph: A toolbox for identifying critical amino acids map in proteins based on graph theory.

PubMed

Niknam, Niloofar; Khakzad, Hamed; Arab, Seyed Shahriar; Naderi-Manesh, Hossein

2016-05-01

The integrative and cooperative nature of protein structure involves the assessment of topological and global features of constituent parts. Network concept takes complete advantage of both of these properties in the analysis concomitantly. High compatibility to structural concepts or physicochemical properties in addition to exploiting a remarkable simplification in the system has made network an ideal tool to explore biological systems. There are numerous examples in which different protein structural and functional characteristics have been clarified by the network approach. Here, we present an interactive and user-friendly Matlab-based toolbox, PDB2Graph, devoted to protein structure network construction, visualization, and analysis. Moreover, PDB2Graph is an appropriate tool for identifying critical nodes involved in protein structural robustness and function based on centrality indices. It maps critical amino acids in protein networks and can greatly aid structural biologists in selecting proper amino acid candidates for manipulating protein structures in a more reasonable and rational manner. To introduce the capability and efficiency of PDB2Graph in detail, the structural modification of Calmodulin through allosteric binding of Ca(2+) is considered. In addition, a mutational analysis for three well-identified model proteins including Phage T4 lysozyme, Barnase and Ribonuclease HI, was performed to inspect the influence of mutating important central residues on protein activity. Copyright © 2016 Elsevier Ltd. All rights reserved.

The Distribution of Coumarins and Furanocoumarins in Citrus Species Closely Matches Citrus Phylogeny and Reflects the Organization of Biosynthetic Pathways

PubMed Central

Dugrand-Judek, Audray; Olry, Alexandre; Hehn, Alain; Costantino, Gilles; Ollitrault, Patrick; Froelicher, Yann; Bourgaud, Frédéric

2015-01-01

Citrus plants are able to produce defense compounds such as coumarins and furanocoumarins to cope with herbivorous insects and pathogens. In humans, these chemical compounds are strong photosensitizers and can interact with medications, leading to the “grapefruit juice effect”. Removing coumarins and furanocoumarins from food and cosmetics imply additional costs and might alter product quality. Thus, the selection of Citrus cultivars displaying low coumarin and furanocoumarin contents constitutes a valuable alternative. In this study, we performed ultra-performance liquid chromatography coupled with mass spectrometry analyses to determine the contents of these compounds within the peel and the pulp of 61 Citrus species representative of the genetic diversity all Citrus. Generally, Citrus peel contains larger diversity and higher concentrations of coumarin/furanocoumarin than the pulp of the same fruits. According to the chemotypes found in the peel, Citrus species can be separated into 4 groups that correspond to the 4 ancestral taxa (pummelos, mandarins, citrons and papedas) and extended with their respective secondary species descendants. Three of the 4 ancestral taxa (pummelos, citrons and papedas) synthesize high amounts of these compounds, whereas mandarins appear practically devoid of them. Additionally, all ancestral taxa and their hybrids are logically organized according to the coumarin and furanocoumarin pathways described in the literature. This organization allows hypotheses to be drawn regarding the biosynthetic origin of compounds for which the biogenesis remains unresolved. Determining coumarin and furanocoumarin contents is also helpful for hypothesizing the origin of Citrus species for which the phylogeny is presently not firmly established. Finally, this work also notes favorable hybridization schemes that will lead to low coumarin and furanocoumarin contents, and we propose to select mandarins and Ichang papeda as Citrus varieties for use in creating species devoid of these toxic compounds in future breeding programs. PMID:26558757

Identification of Metabolic Modifiers That Underlie Phenotypic Variations in Energy-Balance Regulation

PubMed Central

Chang, Chia Lin; Cai, James J.; Cheng, Po Jen; Chueh, Ho Yen; Hsu, Sheau Yu Teddy

2011-01-01

OBJECTIVE Although recent studies have shown that human genomes contain hundreds of loci that exhibit signatures of positive selection, variants that are associated with adaptation in energy-balance regulation remain elusive. We reasoned that the difficulty in identifying such variants could be due to heterogeneity in selection pressure and that an integrative approach that incorporated experiment-based evidence and population genetics-based statistical judgments would be needed to reveal important metabolic modifiers in humans. RESEARCH DESIGN AND METHODS To identify common metabolic modifiers that underlie phenotypic variation in diabetes-associated or obesity-associated traits in humans, or both, we screened 207 candidate loci for regulatory single nucleotide polymorphisms (SNPs) that exhibited evidence of gene–environmental interactions. RESULTS Three SNPs (rs3895874, rs3848460, and rs937301) at the 5′ gene region of human GIP were identified as prime metabolic-modifier candidates at the enteroinsular axis. Functional studies have shown that GIP promoter reporters carrying derived alleles of these three SNPs (haplotype GIP−1920A) have significantly lower transcriptional activities than those with ancestral alleles at corresponding positions (haplotype GIP−1920G). Consistently, studies of pregnant women who have undergone a screening test for gestational diabetes have shown that patients with a homozygous GIP−1920A/A genotype have significantly lower serum concentrations of glucose-dependent insulinotropic polypeptide (GIP) than those carrying an ancestral GIP−1920G haplotype. After controlling for a GIPR variation, we showed that serum glucose concentrations of patients carrying GIP−1920A/A homozygotes are significantly higher than that of those carrying an ancestral GIP−1920G haplotype (odds ratio 3.53). CONCLUSIONS Our proof-of-concept study indicates that common regulatory GIP variants impart a difference in GIP and glucose metabolism. The study also provides a rare example that identified the common variant-common phenotypic variation pattern based on evidence of moderate gene–environmental interactions. PMID:21300845

Automatic Evolution of Molecular Nanotechnology Designs

NASA Technical Reports Server (NTRS)

Globus, Al; Lawton, John; Wipke, Todd; Saini, Subhash (Technical Monitor)

1998-01-01

This paper describes strategies for automatically generating designs for analog circuits at the molecular level. Software maps out the edges and vertices of potential nanotechnology systems on graphs, then selects appropriate ones through evolutionary or genetic paradigms.

Correlation based networks of equity returns sampled at different time horizons

NASA Astrophysics Data System (ADS)

Tumminello, M.; di Matteo, T.; Aste, T.; Mantegna, R. N.

2007-01-01

We investigate the planar maximally filtered graphs of the portfolio of the 300 most capitalized stocks traded at the New York Stock Exchange during the time period 2001 2003. Topological properties such as the average length of shortest paths, the betweenness and the degree are computed on different planar maximally filtered graphs generated by sampling the returns at different time horizons ranging from 5 min up to one trading day. This analysis confirms that the selected stocks compose a hierarchical system progressively structuring as the sampling time horizon increases. Finally, a cluster formation, associated to economic sectors, is quantitatively investigated.

Increased genetic diversity of ADME genes in African Americans compared with their putative ancestral source populations and implications for Pharmacogenomics

PubMed Central

2014-01-01

Background African Americans have been treated as a representative population for African ancestry for many purposes, including pharmacogenomic studies. However, the contribution of European ancestry is expected to result in considerable differences in the genetic architecture of African American individuals compared with an African genome. In particular, the genetic admixture influences the genomic diversity of drug metabolism-related genes, and may cause high heterogeneity of drug responses in admixed populations such as African Americans. Results The genomic ancestry information of African-American (ASW) samples was obtained from data of the 1000 Genomes Project, and local ancestral components were also extracted for 32 core genes and 252 extended genes, which are associated with drug absorption, distribution, metabolism, and excretion (ADME) genes. As expected, the global genetic diversity pattern in ASW was determined by the contributions of its putative ancestral source populations, and the whole profiles of ADME genes in ASW are much closer to those in YRI than in CEU. However, we observed much higher diversity in some functionally important ADME genes in ASW than either CEU or YRI, which could be a result of either genetic drift or natural selection, and we identified some signatures of the latter. We analyzed the clinically relevant polymorphic alleles and haplotypes, and found that 28 functional mutations (including 3 missense, 3 splice, and 22 regulator sites) exhibited significantly higher differentiation between the three populations. Conclusions Analysis of the genetic diversity of ADME genes showed differentiation between admixed population and its ancestral source populations. In particular, the different genetic diversity between ASW and YRI indicated that the ethnic differences in pharmacogenomic studies are broadly existed despite that African ancestry is dominant in Africans Americans. This study should advance our understanding of the genetic basis of the drug response heterogeneity between populations, especially in the case of population admixture, and have significant implications for evaluating potential inter-population heterogeneity in drug treatment effects. PMID:24884825

An enhancement of ROC curves made them clinically relevant for diagnostic-test comparison and optimal-threshold determination.

PubMed

Subtil, Fabien; Rabilloud, Muriel

2015-07-01

The receiver operating characteristic curves (ROC curves) are often used to compare continuous diagnostic tests or determine the optimal threshold of a test; however, they do not consider the costs of misclassifications or the disease prevalence. The ROC graph was extended to allow for these aspects. Two new lines are added to the ROC graph: a sensitivity line and a specificity line. Their slopes depend on the disease prevalence and on the ratio of the net benefit of treating a diseased subject to the net cost of treating a nondiseased one. First, these lines help researchers determine the range of specificities within which test comparisons of partial areas under the curves is clinically relevant. Second, the ROC curve point the farthest from the specificity line is shown to be the optimal threshold in terms of expected utility. This method was applied: (1) to determine the optimal threshold of ratio specific immunoglobulin G (IgG)/total IgG for the diagnosis of congenital toxoplasmosis and (2) to select, among two markers, the most accurate for the diagnosis of left ventricular hypertrophy in hypertensive subjects. The two additional lines transform the statistically valid ROC graph into a clinically relevant tool for test selection and threshold determination. Copyright © 2015 Elsevier Inc. All rights reserved.

Cascades in the Threshold Model for varying system sizes

NASA Astrophysics Data System (ADS)

Karampourniotis, Panagiotis; Sreenivasan, Sameet; Szymanski, Boleslaw; Korniss, Gyorgy

2015-03-01

A classical model in opinion dynamics is the Threshold Model (TM) aiming to model the spread of a new opinion based on the social drive of peer pressure. Under the TM a node adopts a new opinion only when the fraction of its first neighbors possessing that opinion exceeds a pre-assigned threshold. Cascades in the TM depend on multiple parameters, such as the number and selection strategy of the initially active nodes (initiators), and the threshold distribution of the nodes. For a uniform threshold in the network there is a critical fraction of initiators for which a transition from small to large cascades occurs, which for ER graphs is largerly independent of the system size. Here, we study the spread contribution of each newly assigned initiator under the TM for different initiator selection strategies for synthetic graphs of various sizes. We observe that for ER graphs when large cascades occur, the spread contribution of the added initiator on the transition point is independent of the system size, while the contribution of the rest of the initiators converges to zero at infinite system size. This property is used for the identification of large transitions for various threshold distributions. Supported in part by ARL NS-CTA, ARO, ONR, and DARPA.

Where did the chili get its spice? Biogeography of capsaicinoid production in ancestral wild chili species.

PubMed

Tewksbury, Joshua J; Manchego, Carlos; Haak, David C; Levey, Douglas J

2006-03-01

The biogeography of pungency in three species of wild chili in the chaco and surrounding highland habitats of southeastern Bolivia is described. We report that Capsicum chacoense, C. baccatum, and C. eximium are polymorphic for production of capsaicin and its analogs, such that completely pungent and completely nonpungent individuals co-occur in some populations. In C. chacoense, the density of plants and the proportion of pungent plants increased with elevation. Above 900 m, all individuals in all populations except two were pungent; nonpungent individuals in at least one of the two polymorphic populations were likely a result of spreading by humans. The occurrence of pungent and nonpungent individuals in three species of ancestral Capsicum and the geographic variation of pungency within species suggest that production of capsaicin and its analogs entails both costs and benefits, which shift from one locality to another. Determining the selection pressures behind such shifts is necessary to understand the evolution of pungency in chilies.

Biochemical characterization of predicted Precambrian RuBisCO

PubMed Central

Shih, Patrick M.; Occhialini, Alessandro; Cameron, Jeffrey C.; Andralojc, P John; Parry, Martin A. J.; Kerfeld, Cheryl A.

2016-01-01

The antiquity and global abundance of the enzyme, RuBisCO, attests to the crucial and longstanding role it has played in the biogeochemical cycles of Earth over billions of years. The counterproductive oxygenase activity of RuBisCO has persisted over billions of years of evolution, despite its competition with the carboxylase activity necessary for carbon fixation, yet hypotheses regarding the selective pressures governing RuBisCO evolution have been limited to speculation. Here we report the resurrection and biochemical characterization of ancestral RuBisCOs, dating back to over one billion years ago (Gyr ago). Our findings provide an ancient point of reference revealing divergent evolutionary paths taken by eukaryotic homologues towards improved specificity for CO2, versus the evolutionary emphasis on increased rates of carboxylation observed in bacterial homologues. Consistent with these distinctions, in vivo analysis reveals the propensity of ancestral RuBisCO to be encapsulated into modern-day carboxysomes, bacterial organelles central to the cyanobacterial CO2 concentrating mechanism. PMID:26790750

Biochemical characterization of predicted Precambrian RuBisCO.

PubMed

Shih, Patrick M; Occhialini, Alessandro; Cameron, Jeffrey C; Andralojc, P John; Parry, Martin A J; Kerfeld, Cheryl A

2016-01-21

The antiquity and global abundance of the enzyme, RuBisCO, attests to the crucial and longstanding role it has played in the biogeochemical cycles of Earth over billions of years. The counterproductive oxygenase activity of RuBisCO has persisted over billions of years of evolution, despite its competition with the carboxylase activity necessary for carbon fixation, yet hypotheses regarding the selective pressures governing RuBisCO evolution have been limited to speculation. Here we report the resurrection and biochemical characterization of ancestral RuBisCOs, dating back to over one billion years ago (Gyr ago). Our findings provide an ancient point of reference revealing divergent evolutionary paths taken by eukaryotic homologues towards improved specificity for CO2, versus the evolutionary emphasis on increased rates of carboxylation observed in bacterial homologues. Consistent with these distinctions, in vivo analysis reveals the propensity of ancestral RuBisCO to be encapsulated into modern-day carboxysomes, bacterial organelles central to the cyanobacterial CO2 concentrating mechanism.

Morphogenesis in bat wings: linking development, evolution and ecology.

PubMed

Adams, Rick A

2008-01-01

The evolution of powered flight in mammals required specific developmental shifts from an ancestral limb morphology to one adapted for flight. Through studies of comparative morphogenesis, investigators have quantified points and rates of divergence providing important insights into how wings evolved in mammals. Herein I compare growth,development and skeletogenesis of forelimbs between bats and the more ancestral state provided by the rat (Rattus norvegicus)and quantify growth trajectories that illustrate morphological divergence both developmentally and evolutionarily. In addition, I discuss how wing shape is controlled during morphogenesis by applying multivariate analyses of wing bones and wing membranes and discuss how flight dynamics are stabilized during flight ontogeny. Further, I discuss the development of flight in bats in relation to the ontogenetic niche and how juveniles effect populational foraging patterns. In addition, I provide a hypothetical ontogenetic landscape model that predicts how and when selection is most intense during juvenile morphogenesis and test this model with data from a population of the little brown bat, Myotis lucifugus. (c) 2007 S. Karger AG, Basel

Human preferences for sexually dimorphic faces may be evolutionarily novel

PubMed Central

Scott, Isabel M.; Clark, Andrew P.; Josephson, Steven C.; Boyette, Adam H.; Cuthill, Innes C.; Fried, Ruby L.; Gibson, Mhairi A.; Hewlett, Barry S.; Jamieson, Mark; Jankowiak, William; Honey, P. Lynne; Huang, Zejun; Liebert, Melissa A.; Purzycki, Benjamin G.; Shaver, John H.; Snodgrass, J. Josh; Sosis, Richard; Sugiyama, Lawrence S.; Swami, Viren; Yu, Douglas W.; Zhao, Yangke; Penton-Voak, Ian S.

2014-01-01

A large literature proposes that preferences for exaggerated sex typicality in human faces (masculinity/femininity) reflect a long evolutionary history of sexual and social selection. This proposal implies that dimorphism was important to judgments of attractiveness and personality in ancestral environments. It is difficult to evaluate, however, because most available data come from large-scale, industrialized, urban populations. Here, we report the results for 12 populations with very diverse levels of economic development. Surprisingly, preferences for exaggerated sex-specific traits are only found in the novel, highly developed environments. Similarly, perceptions that masculine males look aggressive increase strongly with development and, specifically, urbanization. These data challenge the hypothesis that facial dimorphism was an important ancestral signal of heritable mate value. One possibility is that highly developed environments provide novel opportunities to discern relationships between facial traits and behavior by exposing individuals to large numbers of unfamiliar faces, revealing patterns too subtle to detect with smaller samples. PMID:25246593

Reconstructed Ancestral Myo-Inositol-3-Phosphate Synthases Indicate That Ancestors of the Thermococcales and Thermotoga Species Were More Thermophilic than Their Descendants

PubMed Central

Butzin, Nicholas C.; Lapierre, Pascal; Green, Anna G.; Swithers, Kristen S.; Gogarten, J. Peter; Noll, Kenneth M.

2013-01-01

The bacterial genomes of Thermotoga species show evidence of significant interdomain horizontal gene transfer from the Archaea. Members of this genus acquired many genes from the Thermococcales, which grow at higher temperatures than Thermotoga species. In order to study the functional history of an interdomain horizontally acquired gene we used ancestral sequence reconstruction to examine the thermal characteristics of reconstructed ancestral proteins of the Thermotoga lineage and its archaeal donors. Several ancestral sequence reconstruction methods were used to determine the possible sequences of the ancestral Thermotoga and Archaea myo-inositol-3-phosphate synthase (MIPS). These sequences were predicted to be more thermostable than the extant proteins using an established sequence composition method. We verified these computational predictions by measuring the activities and thermostabilities of purified proteins from the Thermotoga and the Thermococcales species, and eight ancestral reconstructed proteins. We found that the ancestral proteins from both the archaeal donor and the Thermotoga most recent common ancestor recipient were more thermostable than their descendants. We show that there is a correlation between the thermostability of MIPS protein and the optimal growth temperature (OGT) of its host, which suggests that the OGT of the ancestors of these species of Archaea and the Thermotoga grew at higher OGTs than their descendants. PMID:24391933

Evolution of tag-based cooperation on Erdős-Rényi random graphs

NASA Astrophysics Data System (ADS)

Lima, F. W. S.; Hadzibeganovic, Tarik; Stauffer, Dietrich

2014-12-01

Here, we study an agent-based model of the evolution of tag-mediated cooperation on Erdős-Rényi random graphs. In our model, agents with heritable phenotypic traits play pairwise Prisoner's Dilemma-like games and follow one of the four possible strategies: Ethnocentric, altruistic, egoistic and cosmopolitan. Ethnocentric and cosmopolitan strategies are conditional, i.e. their selection depends upon the shared phenotypic similarity among interacting agents. The remaining two strategies are always unconditional, meaning that egoists always defect while altruists always cooperate. Our simulations revealed that ethnocentrism can win in both early and later evolutionary stages on directed random graphs when reproduction of artificial agents was asexual; however, under the sexual mode of reproduction on a directed random graph, we found that altruists dominate initially for a rather short period of time, whereas ethnocentrics and egoists suppress other strategists and compete for dominance in the intermediate and later evolutionary stages. Among our results, we also find surprisingly regular oscillations which are not damped in the course of time even after half a million Monte Carlo steps. Unlike most previous studies, our findings highlight conditions under which ethnocentrism is less stable or suppressed by other competing strategies.

Inter and intra-modal deformable registration: continuous deformations meet efficient optimal linear programming.

PubMed

Glocker, Ben; Paragios, Nikos; Komodakis, Nikos; Tziritas, Georgios; Navab, Nassir

2007-01-01

In this paper we propose a novel non-rigid volume registration based on discrete labeling and linear programming. The proposed framework reformulates registration as a minimal path extraction in a weighted graph. The space of solutions is represented using a set of a labels which are assigned to predefined displacements. The graph topology corresponds to a superimposed regular grid onto the volume. Links between neighborhood control points introduce smoothness, while links between the graph nodes and the labels (end-nodes) measure the cost induced to the objective function through the selection of a particular deformation for a given control point once projected to the entire volume domain, Higher order polynomials are used to express the volume deformation from the ones of the control points. Efficient linear programming that can guarantee the optimal solution up to (a user-defined) bound is considered to recover the optimal registration parameters. Therefore, the method is gradient free, can encode various similarity metrics (simple changes on the graph construction), can guarantee a globally sub-optimal solution and is computational tractable. Experimental validation using simulated data with known deformation, as well as manually segmented data demonstrate the extreme potentials of our approach.

A Method for Inferring an Individual’s Genetic Ancestry and Degree of Admixture Associated with Six Major Continental Populations

PubMed Central

Libiger, Ondrej; Schork, Nicholas J.

2013-01-01

The determination of the ancestry and genetic backgrounds of the subjects in genetic and general epidemiology studies is a crucial component in the analysis of relevant outcomes or associations. Although there are many methods for differentiating ancestral subgroups among individuals based on genetic markers only a few of these methods provide actual estimates of the fraction of an individual’s genome that is likely to be associated with different ancestral populations. We propose a method for assigning ancestry that works in stages to refine estimates of ancestral population contributions to individual genomes. The method leverages genotype data in the public domain obtained from individuals with known ancestries. Although we showcase the method in the assessment of ancestral genome proportions leveraging largely continental populations, the strategy can be used for assessing within-continent or more subtle ancestral origins with the appropriate data. PMID:23335941

EASE (Experimental Assembly of Structures in EVA) overview of selected results

NASA Technical Reports Server (NTRS)

Akin, David L.

1987-01-01

Experimental Assembly of Structures in EVA (EASE) objectives, experimental protocol, neutral buoyancy simulation, task time distribution, assembly task performance, metabolic rate/biomedical readouts are summarized. This presentation is shown in charts, figures, and graphs.

Deer Lodge Valley investigations, western Montana

DOE Office of Scientific and Technical Information (OSTI.GOV)

Wideman, C.J.; Sonderegger, J.; Crase, E.

1982-07-01

A review of the geothermal investigations conducted in the Deer Lodge Valley of Western Montana is briefly presented. Maps of the generalized geology and Bouguer gravity and graphs of selected geothermal gradients and resistivity sounding profiles are presented. (MJF)

Nomogram Method as Means for Resource Potential Efficiency Predicative Aid of Petrothermal Energy

NASA Astrophysics Data System (ADS)

Gabdrakhmanova, K. F.; Izmailova, G. R.; Larin, P. A.; Vasilyeva, E. R.; Madjidov, M. A.; Marupov, S. R.

2018-05-01

The article describes the innovative approach when predicting the resource potential efficiency of petrothermal energy. Various geothermal gradients representative of Bashkortostan and Tatarstan republics regions were considered. With the help of nomograms, the authors analysed fluid temperature dependency graphs at the outlet and the thermal power versus fluid velocity along the wellbore. From the family of graphs plotted by us, velocities corresponding to specific temperature were found. Then, according to thermal power versus velocity curve, power levels corresponding to these velocities relative to the selected fluid temperature were found. On the basis of two dependencies obtained, nomograms were plotted. The result of determining the petrothermal energy production efficiency is a family of isocline lines that enables one to select the optimum temperature and injection rate to obtain the required amount of heat for a particular depth and geothermal gradient.

Evolutionary history and metabolic insights of ancient mammalian uricases

PubMed Central

Kratzer, James T.; Lanaspa, Miguel A.; Murphy, Michael N.; Cicerchi, Christina; Graves, Christina L.; Tipton, Peter A.; Ortlund, Eric A.; Johnson, Richard J.; Gaucher, Eric A.

2014-01-01

Uricase is an enzyme involved in purine catabolism and is found in all three domains of life. Curiously, uricase is not functional in some organisms despite its role in converting highly insoluble uric acid into 5-hydroxyisourate. Of particular interest is the observation that apes, including humans, cannot oxidize uric acid, and it appears that multiple, independent evolutionary events led to the silencing or pseudogenization of the uricase gene in ancestral apes. Various arguments have been made to suggest why natural selection would allow the accumulation of uric acid despite the physiological consequences of crystallized monosodium urate acutely causing liver/kidney damage or chronically causing gout. We have applied evolutionary models to understand the history of primate uricases by resurrecting ancestral mammalian intermediates before the pseudogenization events of this gene family. Resurrected proteins reveal that ancestral uricases have steadily decreased in activity since the last common ancestor of mammals gave rise to descendent primate lineages. We were also able to determine the 3D distribution of amino acid replacements as they accumulated during evolutionary history by crystallizing a mammalian uricase protein. Further, ancient and modern uricases were stably transfected into HepG2 liver cells to test one hypothesis that uricase pseudogenization allowed ancient frugivorous apes to rapidly convert fructose into fat. Finally, pharmacokinetics of an ancient uricase injected in rodents suggest that our integrated approach provides the foundation for an evolutionarily-engineered enzyme capable of treating gout and preventing tumor lysis syndrome in human patients. PMID:24550457

Comparison of Housing Construction Development in Selected Regions of Central Europe

NASA Astrophysics Data System (ADS)

Dvorský, Ján; Petráková, Zora; Hollý, Ján

2017-12-01

In fast-growing countries, the economic growth, which came after the global financial crisis, ought to be manifested in the development of housing policy. The development of the region is directly related to the increase of the quality of living of its inhabitants. Housing construction and its relation with the availability of housing is a key issue for population overall. Comparison of its development in selected regions is important for experts in the field of construction, mayors of the regions, the state, but especially for the inhabitants themselves. The aim of the article is to compare the number of new dwellings with building permits and completed dwellings with final building approval between selected regions by using a mathematical statistics method - “Analysis of variance”. The article also uses the tools of descriptive statistics such as a point graph, a graph of deviations from the average, basic statistical characteristics of mean and variability. Qualitative factors influencing the construction of flats as well as the causes of quantitative differences in the number of started apartments under construction and completed apartments in selected regions of Central Europe are the subjects of the article’s conclusions.

Overlapping communities from dense disjoint and high total degree clusters

NASA Astrophysics Data System (ADS)

Zhang, Hongli; Gao, Yang; Zhang, Yue

2018-04-01

Community plays an important role in the field of sociology, biology and especially in domains of computer science, where systems are often represented as networks. And community detection is of great importance in the domains. A community is a dense subgraph of the whole graph with more links between its members than between its members to the outside nodes, and nodes in the same community probably share common properties or play similar roles in the graph. Communities overlap when nodes in a graph belong to multiple communities. A vast variety of overlapping community detection methods have been proposed in the literature, and the local expansion method is one of the most successful techniques dealing with large networks. The paper presents a density-based seeding method, in which dense disjoint local clusters are searched and selected as seeds. The proposed method selects a seed by the total degree and density of local clusters utilizing merely local structures of the network. Furthermore, this paper proposes a novel community refining phase via minimizing the conductance of each community, through which the quality of identified communities is largely improved in linear time. Experimental results in synthetic networks show that the proposed seeding method outperforms other seeding methods in the state of the art and the proposed refining method largely enhances the quality of the identified communities. Experimental results in real graphs with ground-truth communities show that the proposed approach outperforms other state of the art overlapping community detection algorithms, in particular, it is more than two orders of magnitude faster than the existing global algorithms with higher quality, and it obtains much more accurate community structure than the current local algorithms without any priori information.

Predicting conversion from MCI to AD using resting-state fMRI, graph theoretical approach and SVM.

PubMed

Hojjati, Seyed Hani; Ebrahimzadeh, Ata; Khazaee, Ali; Babajani-Feremi, Abbas

2017-04-15

We investigated identifying patients with mild cognitive impairment (MCI) who progress to Alzheimer's disease (AD), MCI converter (MCI-C), from those with MCI who do not progress to AD, MCI non-converter (MCI-NC), based on resting-state fMRI (rs-fMRI). Graph theory and machine learning approach were utilized to predict progress of patients with MCI to AD using rs-fMRI. Eighteen MCI converts (average age 73.6 years; 11 male) and 62 age-matched MCI non-converters (average age 73.0 years, 28 male) were included in this study. We trained and tested a support vector machine (SVM) to classify MCI-C from MCI-NC using features constructed based on the local and global graph measures. A novel feature selection algorithm was developed and utilized to select an optimal subset of features. Using subset of optimal features in SVM, we classified MCI-C from MCI-NC with an accuracy, sensitivity, specificity, and the area under the receiver operating characteristic (ROC) curve of 91.4%, 83.24%, 90.1%, and 0.95, respectively. Furthermore, results of our statistical analyses were used to identify the affected brain regions in AD. To the best of our knowledge, this is the first study that combines the graph measures (constructed based on rs-fMRI) with machine learning approach and accurately classify MCI-C from MCI-NC. Results of this study demonstrate potential of the proposed approach for early AD diagnosis and demonstrate capability of rs-fMRI to predict conversion from MCI to AD by identifying affected brain regions underlying this conversion. Copyright © 2017 Elsevier B.V. All rights reserved.

A consensus map in cultivated hexaploid oat reveals conserved grass synteny with substantial sub-genome rearrangement

USDA-ARS?s Scientific Manuscript database

Hexaploid oat (Avena sativa, 2n = 6x = 42) is a member of the Poaceae family with a very large genome (~13 Gb) containing 21 chromosome pairs: seven from each of two similar ancestral diploids (A and D) and seven from a more diverged ancestral diploid (C). Physical rearrangements among ancestral oat...

The relationships between spatial ability, logical thinking, mathematics performance and kinematics graph interpretation skills of 12th grade physics students

NASA Astrophysics Data System (ADS)

Bektasli, Behzat

Graphs have a broad use in science classrooms, especially in physics. In physics, kinematics is probably the topic for which graphs are most widely used. The participants in this study were from two different grade-12 physics classrooms, advanced placement and calculus-based physics. The main purpose of this study was to search for the relationships between student spatial ability, logical thinking, mathematical achievement, and kinematics graphs interpretation skills. The Purdue Spatial Visualization Test, the Middle Grades Integrated Process Skills Test (MIPT), and the Test of Understanding Graphs in Kinematics (TUG-K) were used for quantitative data collection. Classroom observations were made to acquire ideas about classroom environment and instructional techniques. Factor analysis, simple linear correlation, multiple linear regression, and descriptive statistics were used to analyze the quantitative data. Each instrument has two principal components. The selection and calculation of the slope and of the area were the two principal components of TUG-K. MIPT was composed of a component based upon processing text and a second component based upon processing symbolic information. The Purdue Spatial Visualization Test was composed of a component based upon one-step processing and a second component based upon two-step processing of information. Student ability to determine the slope in a kinematics graph was significantly correlated with spatial ability, logical thinking, and mathematics aptitude and achievement. However, student ability to determine the area in a kinematics graph was only significantly correlated with student pre-calculus semester 2 grades. Male students performed significantly better than female students on the slope items of TUG-K. Also, male students performed significantly better than female students on the PSAT mathematics assessment and spatial ability. This study found that students have different levels of spatial ability, logical thinking, and mathematics aptitude and achievement levels. These different levels were related to student learning of kinematics and they need to be considered when kinematics is being taught. It might be easier for students to understand the kinematics graphs if curriculum developers include more activities related to spatial ability and logical thinking.

Identification of the ancestral haplotype for apolipoprotein B suggests an African origin of Homo sapiens sapiens and traces their subsequent migration to Europe and the Pacific.

PubMed Central

Rapacz, J; Chen, L; Butler-Brunner, E; Wu, M J; Hasler-Rapacz, J O; Butler, R; Schumaker, V N

1991-01-01

The probable ancestral haplotype for human apolipoprotein B (apoB) has been identified through immunological analysis of chimpanzee and gorilla serum and sequence analysis of their DNA. Moreover, the frequency of this ancestral apoB haplotype among different human populations provides strong support for the African origin of Homo sapiens sapiens and their subsequent migration from Africa to Europe and to the Pacific. The approach used here for the identification of the ancestral human apoB haplotype is likely to be applicable to many other genes. PMID:1996341

Identification of the ancestral haplotype for apolipoprotein B suggests an African origin of Homo sapiens sapiens and traces their subsequent migration to Europe and the Pacific

DOE Office of Scientific and Technical Information (OSTI.GOV)

Rapacz, J.; Hasler-Rapacz, J.O.; Chen, L.

1991-02-15

The probable ancestral haplotype for human apolipoprotein B (apoB) has been identified through immunological analysis of chimpanzee and gorilla serum and sequence analysis of their DNA. Moreover, the frequency of this ancestral apoB haplotype among different human populations provides strong support for the African origin of Homo sapiens sapiens and their subsequent migration from Africa to Europe and to the Pacific. The approach used here for the identification of the ancestral human apoB haplotype is likely to be applicable to many other genes.

Selected basic economic and energy indicators for Arab countries and world

DOE Office of Scientific and Technical Information (OSTI.GOV)

Not Available

1985-01-01

This book presents the following topics: Tables and graphs on the Arab countries' trade; GDP and current account balances; oil and gas reserves; and energy, oil, and gas production and consumption, within a global setting.

Hybrid Propulsion Technology Program, phase 1. Volume 2: Technical discussion

NASA Technical Reports Server (NTRS)

1989-01-01

Information on hybrid propulsion system concepts is given largely in the form of outlines, charts and graphs. Included are the concept definition, trade study data generation, concept evaluation and selection, conceptual design definition, and technology definition.

Data-driven confounder selection via Markov and Bayesian networks.

PubMed

Häggström, Jenny

2018-06-01

To unbiasedly estimate a causal effect on an outcome unconfoundedness is often assumed. If there is sufficient knowledge on the underlying causal structure then existing confounder selection criteria can be used to select subsets of the observed pretreatment covariates, X, sufficient for unconfoundedness, if such subsets exist. Here, estimation of these target subsets is considered when the underlying causal structure is unknown. The proposed method is to model the causal structure by a probabilistic graphical model, for example, a Markov or Bayesian network, estimate this graph from observed data and select the target subsets given the estimated graph. The approach is evaluated by simulation both in a high-dimensional setting where unconfoundedness holds given X and in a setting where unconfoundedness only holds given subsets of X. Several common target subsets are investigated and the selected subsets are compared with respect to accuracy in estimating the average causal effect. The proposed method is implemented with existing software that can easily handle high-dimensional data, in terms of large samples and large number of covariates. The results from the simulation study show that, if unconfoundedness holds given X, this approach is very successful in selecting the target subsets, outperforming alternative approaches based on random forests and LASSO, and that the subset estimating the target subset containing all causes of outcome yields smallest MSE in the average causal effect estimation. © 2017, The International Biometric Society.

Comparing genomes to computer operating systems in terms of the topology and evolution of their regulatory control networks

PubMed Central

Yan, Koon-Kiu; Fang, Gang; Bhardwaj, Nitin; Alexander, Roger P.; Gerstein, Mark

2010-01-01

The genome has often been called the operating system (OS) for a living organism. A computer OS is described by a regulatory control network termed the call graph, which is analogous to the transcriptional regulatory network in a cell. To apply our firsthand knowledge of the architecture of software systems to understand cellular design principles, we present a comparison between the transcriptional regulatory network of a well-studied bacterium (Escherichia coli) and the call graph of a canonical OS (Linux) in terms of topology and evolution. We show that both networks have a fundamentally hierarchical layout, but there is a key difference: The transcriptional regulatory network possesses a few global regulators at the top and many targets at the bottom; conversely, the call graph has many regulators controlling a small set of generic functions. This top-heavy organization leads to highly overlapping functional modules in the call graph, in contrast to the relatively independent modules in the regulatory network. We further develop a way to measure evolutionary rates comparably between the two networks and explain this difference in terms of network evolution. The process of biological evolution via random mutation and subsequent selection tightly constrains the evolution of regulatory network hubs. The call graph, however, exhibits rapid evolution of its highly connected generic components, made possible by designers’ continual fine-tuning. These findings stem from the design principles of the two systems: robustness for biological systems and cost effectiveness (reuse) for software systems. PMID:20439753

Comparing genomes to computer operating systems in terms of the topology and evolution of their regulatory control networks.

PubMed

Yan, Koon-Kiu; Fang, Gang; Bhardwaj, Nitin; Alexander, Roger P; Gerstein, Mark

2010-05-18

The genome has often been called the operating system (OS) for a living organism. A computer OS is described by a regulatory control network termed the call graph, which is analogous to the transcriptional regulatory network in a cell. To apply our firsthand knowledge of the architecture of software systems to understand cellular design principles, we present a comparison between the transcriptional regulatory network of a well-studied bacterium (Escherichia coli) and the call graph of a canonical OS (Linux) in terms of topology and evolution. We show that both networks have a fundamentally hierarchical layout, but there is a key difference: The transcriptional regulatory network possesses a few global regulators at the top and many targets at the bottom; conversely, the call graph has many regulators controlling a small set of generic functions. This top-heavy organization leads to highly overlapping functional modules in the call graph, in contrast to the relatively independent modules in the regulatory network. We further develop a way to measure evolutionary rates comparably between the two networks and explain this difference in terms of network evolution. The process of biological evolution via random mutation and subsequent selection tightly constrains the evolution of regulatory network hubs. The call graph, however, exhibits rapid evolution of its highly connected generic components, made possible by designers' continual fine-tuning. These findings stem from the design principles of the two systems: robustness for biological systems and cost effectiveness (reuse) for software systems.

Modeling the origins of mammalian sociality: moderate evidence for matrilineal signatures in mouse lemur vocalizations.

PubMed

Kessler, Sharon E; Radespiel, Ute; Hasiniaina, Alida I F; Leliveld, Lisette M C; Nash, Leanne T; Zimmermann, Elke

2014-02-20

Maternal kin selection is a driving force in the evolution of mammalian social complexity and it requires that kin are distinctive from nonkin. The transition from the ancestral state of asociality to the derived state of complex social groups is thought to have occurred via solitary foraging, in which individuals forage alone, but, unlike the asocial ancestors, maintain dispersed social networks via scent-marks and vocalizations. We hypothesize that matrilineal signatures in vocalizations were an important part of these networks. We used the solitary foraging gray mouse lemur (Microcebus murinus) as a model for ancestral solitary foragers and tested for matrilineal signatures in their calls, thus investigating whether such signatures are already present in solitary foragers and could have facilitated the kin selection thought to have driven the evolution of increased social complexity in mammals. Because agonism can be very costly, selection for matrilineal signatures in agonistic calls should help reduce agonism between unfamiliar matrilineal kin. We conducted this study on a well-studied population of wild mouse lemurs at Ankarafantsika National Park, Madagascar. We determined pairwise relatedness using seven microsatellite loci, matrilineal relatedness by sequencing the mitrochondrial D-loop, and sleeping group associations using radio-telemetry. We recorded agonistic calls during controlled social encounters and conducted a multi-parametric acoustic analysis to determine the spectral and temporal structure of the agonistic calls. We measured 10 calls for each of 16 females from six different matrilineal kin groups. Calls were assigned to their matriline at a rate significantly higher than chance (pDFA: correct = 47.1%, chance = 26.7%, p = 0.03). There was a statistical trend for a negative correlation between acoustic distance and relatedness (Mantel Test: g = -1.61, Z = 4.61, r = -0.13, p = 0.058). Mouse lemur agonistic calls are moderately distinctive by matriline. Because sleeping groups consisted of close maternal kin, both genetics and social learning may have generated these acoustic signatures. As mouse lemurs are models for solitary foragers, we recommend further studies testing whether the lemurs use these calls to recognize kin. This would enable further modeling of how kin recognition in ancestral species could have shaped the evolution of complex sociality.

Incomplete lineage sorting patterns among human, chimpanzee, and orangutan suggest recent orangutan speciation and widespread selection

PubMed Central

Hobolth, Asger; Dutheil, Julien Y.; Hawks, John; Schierup, Mikkel H.; Mailund, Thomas

2011-01-01

We search the complete orangutan genome for regions where humans are more closely related to orangutans than to chimpanzees due to incomplete lineage sorting (ILS) in the ancestor of human and chimpanzees. The search uses our recently developed coalescent hidden Markov model (HMM) framework. We find ILS present in ∼1% of the genome, and that the ancestral species of human and chimpanzees never experienced a severe population bottleneck. The existence of ILS is validated with simulations, site pattern analysis, and analysis of rare genomic events. The existence of ILS allows us to disentangle the time of isolation of humans and orangutans (the speciation time) from the genetic divergence time, and we find speciation to be as recent as 9–13 million years ago (Mya; contingent on the calibration point). The analyses provide further support for a recent speciation of human and chimpanzee at ∼4 Mya and a diverse ancestor of human and chimpanzee with an effective population size of about 50,000 individuals. Posterior decoding infers ILS for each nucleotide in the genome, and we use this to deduce patterns of selection in the ancestral species. We demonstrate the effect of background selection in the common ancestor of humans and chimpanzees. In agreement with predictions from population genetics, ILS was found to be reduced in exons and gene-dense regions when we control for confounding factors such as GC content and recombination rate. Finally, we find the broad-scale recombination rate to be conserved through the complete ape phylogeny. PMID:21270173

Food-Nonfood Discrimination in Ancestral Vertebrates: Gamete Cannibalism and the Origin of the Adaptive Immune System.

PubMed

Corcos, D

2015-11-01

Adaptive immunity is a complex system that appeared twice in vertebrates (in gnathostomes and in jawless fish) although it is not required for invertebrate defence. The adaptive immune system is tightly associated with self-non-self discrimination, and it is now clear that this interplay is not limited to the prevention of autoreactivity. Micro-organisms are usually considered for their pathogenicity or symbiotic ability, but, for most small metazoans, they mainly constitute food. Vertebrates are characterized by feeding by predation on larger preys, when compared to their ancestors who were filter feeders and ate micro-organisms. Predation gives a strong selective advantage, not only due to the availability of new food resources but also by the ability to eliminate competitors for environmental resources (intraguild predation (IGP)). Unlike size-structured IGP, intraspecific predation of juveniles, zygotes or gametes can be detrimental for species fitness in some circumstances. The ability of individuals to recognize highly polymorphic molecules on the surface of gametes present in the plankton and so distinguish self versus non-self gametes might have constituted a strong selective advantage in intraspecific competition. Here, I propose the theory that the capacity to rearrange receptors has been selected in ancestral vertebrates as a consequence of this strong need for discriminating between hetero-cannibalism versus filial cannibalism. This evolutionary origin sheds light on presently unexplained features of the immune system, including the existence of regulatory T cells and of non-pathogenic natural autoimmunity. © 2015 The Foundation for the Scandinavian Journal of Immunology.

Detecting Past Positive Selection through Ongoing Negative Selection

PubMed Central

Bazykin, Georgii A.; Kondrashov, Alexey S.

2011-01-01

Detecting positive selection is a challenging task. We propose a method for detecting past positive selection through ongoing negative selection, based on comparison of the parameters of intraspecies polymorphism at functionally important and selectively neutral sites where a nucleotide substitution of the same kind occurred recently. Reduced occurrence of recently replaced ancestral alleles at functionally important sites indicates that negative selection currently acts against these alleles and, therefore, that their replacements were driven by positive selection. Application of this method to the Drosophila melanogaster lineage shows that the fraction of adaptive amino acid replacements remained approximately 0.5 for a long time. In the Homo sapiens lineage, however, this fraction drops from approximately 0.5 before the Ponginae–Homininae divergence to approximately 0 after it. The proposed method is based on essentially the same data as the McDonald–Kreitman test but is free from some of its limitations, which may open new opportunities, especially when many genotypes within a species are known. PMID:21859804

Contact Graph Routing

NASA Technical Reports Server (NTRS)

Burleigh, Scott C.

2011-01-01

Contact Graph Routing (CGR) is a dynamic routing system that computes routes through a time-varying topology of scheduled communication contacts in a network based on the DTN (Delay-Tolerant Networking) architecture. It is designed to enable dynamic selection of data transmission routes in a space network based on DTN. This dynamic responsiveness in route computation should be significantly more effective and less expensive than static routing, increasing total data return while at the same time reducing mission operations cost and risk. The basic strategy of CGR is to take advantage of the fact that, since flight mission communication operations are planned in detail, the communication routes between any pair of bundle agents in a population of nodes that have all been informed of one another's plans can be inferred from those plans rather than discovered via dialogue (which is impractical over long one-way-light-time space links). Messages that convey this planning information are used to construct contact graphs (time-varying models of network connectivity) from which CGR automatically computes efficient routes for bundles. Automatic route selection increases the flexibility and resilience of the space network, simplifying cross-support and reducing mission management costs. Note that there are no routing tables in Contact Graph Routing. The best route for a bundle destined for a given node may routinely be different from the best route for a different bundle destined for the same node, depending on bundle priority, bundle expiration time, and changes in the current lengths of transmission queues for neighboring nodes; routes must be computed individually for each bundle, from the Bundle Protocol agent's current network connectivity model for the bundle s destination node (the contact graph). Clearly this places a premium on optimizing the implementation of the route computation algorithm. The scalability of CGR to very large networks remains a research topic. The information carried by CGR contact plan messages is useful not only for dynamic route computation, but also for the implementation of rate control, congestion forecasting, transmission episode initiation and termination, timeout interval computation, and retransmission timer suspension and resumption.

From Evolutionary Allometry to Sexual Display: (A Reply to Holman and Bro-Jørgensen).

PubMed

Raia, Pasquale; Passaro, Federico; Carotenuto, Francesco; Meiri, Shai; Piras, Paolo

2016-08-01

Conventional wisdom holds that the complex shapes of deer antlers are produced under the sole influence of sexual selection. We questioned this view by demonstrating that trends for increased body size evolution passively yield more-complex ornaments, even in organisms where no effect of sexual selection is possible, with similar allometric slopes. Recent investigations suggest that sexual selection on antlers of larger deer species is stronger than that in smaller species; hence, the use of conspicuous antlers for display in large male deer is a secondary function driven by especially intense sexual selection on these large-bodied species. Since ancestral deer were small and had very simple antlers, such an intense selection on antlers shape was probably absent in early deer. Therefore, the evolution of complex ornaments is coupled with body size evolution, even in deer.

WE-E-BRE-05: Ensemble of Graphical Models for Predicting Radiation Pneumontis Risk

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lee, S; Ybarra, N; Jeyaseelan, K

Purpose: We propose a prior knowledge-based approach to construct an interaction graph of biological and dosimetric radiation pneumontis (RP) covariates for the purpose of developing a RP risk classifier. Methods: We recruited 59 NSCLC patients who received curative radiotherapy with minimum 6 month follow-up. 16 RP events was observed (CTCAE grade ≥2). Blood serum was collected from every patient before (pre-RT) and during RT (mid-RT). From each sample the concentration of the following five candidate biomarkers were taken as covariates: alpha-2-macroglobulin (α2M), angiotensin converting enzyme (ACE), transforming growth factor β (TGF-β), interleukin-6 (IL-6), and osteopontin (OPN). Dose-volumetric parameters were alsomore » included as covariates. The number of biological and dosimetric covariates was reduced by a variable selection scheme implemented by L1-regularized logistic regression (LASSO). Posterior probability distribution of interaction graphs between the selected variables was estimated from the data under the literature-based prior knowledge to weight more heavily the graphs that contain the expected associations. A graph ensemble was formed by averaging the most probable graphs weighted by their posterior, creating a Bayesian Network (BN)-based RP risk classifier. Results: The LASSO selected the following 7 RP covariates: (1) pre-RT concentration level of α2M, (2) α2M level mid- RT/pre-RT, (3) pre-RT IL6 level, (4) IL6 level mid-RT/pre-RT, (5) ACE mid-RT/pre-RT, (6) PTV volume, and (7) mean lung dose (MLD). The ensemble BN model achieved the maximum sensitivity/specificity of 81%/84% and outperformed univariate dosimetric predictors as shown by larger AUC values (0.78∼0.81) compared with MLD (0.61), V20 (0.65) and V30 (0.70). The ensembles obtained by incorporating the prior knowledge improved classification performance for the ensemble size 5∼50. Conclusion: We demonstrated a probabilistic ensemble method to detect robust associations between RP covariates and its potential to improve RP prediction accuracy. Our Bayesian approach to incorporate prior knowledge can enhance efficiency in searching of such associations from data. The authors acknowledge partial support by: 1) CREATE Medical Physics Research Training Network grant of the Natural Sciences and Engineering Research Council (Grant number: 432290) and 2) The Terry Fox Foundation Strategic Training Initiative for Excellence in Radiation Research for the 21st Century (EIRR21)« less

Retention and Molecular Evolution of Lipoxygenase Genes in Modern Rosid Plants

PubMed Central

Chen, Zhu; Chen, Danmei; Chu, Wenyuan; Zhu, Dongyue; Yan, Hanwei; Xiang, Yan

2016-01-01

Whole-genome duplication events have occurred more than once in the genomes of some rosids and played a significant role over evolutionary time. Lipoxygenases (LOXs) are involved in many developmental and resistance processes in plants. Our study concerns the subject of the LOX gene family; we tracked the evolutionary process of ancestral LOX genes in four modern rosids. Here we show that some members of the LOX gene family in the Arabidopsis genome are likely to be lost during evolution, leading to a smaller size than that in Populus, Vitis, and Carica. Strong purifying selection acted as a critical role in almost all of the paralogous and orthologous genes. The structure of LOX genes in Carica and Populus are relatively stable, whereas Vitis and Arabidopsis have a difference. By searching conserved motifs of LOX genes, we found that each sub-family shared similar components. Research on intraspecies gene collinearity show that recent duplication holds an important position in Populus and Arabidopsis. Gene collinearity analysis within and between these four rosid plants revealed that all LOX genes in each modern rosid were the offspring from different ancestral genes. This study traces the evolution of LOX genes which have been differentially retained and expanded in rosid plants. Our results presented here may aid in the selection of special genes retained in the rosid plants for further analysis of biological function. PMID:27746812

Developmental origins of a novel gut morphology in frogs.

PubMed

Bloom, Stephanie; Ledon-Rettig, Cris; Infante, Carlos; Everly, Anne; Hanken, James; Nascone-Yoder, Nanette

2013-05-01

Phenotypic variation is a prerequisite for evolution by natural selection, yet the processes that give rise to the novel morphologies upon which selection acts are poorly understood. We employed a chemical genetic screen to identify developmental changes capable of generating ecologically relevant morphological variation as observed among extant species. Specifically, we assayed for exogenously applied small molecules capable of transforming the ancestral larval foregut of the herbivorous Xenopus laevis to resemble the derived larval foregut of the carnivorous Lepidobatrachus laevis. Appropriately, the small molecules that demonstrate this capacity modulate conserved morphogenetic pathways involved in gut development, including downregulation of retinoic acid (RA) signaling. Identical manipulation of RA signaling in a species that is more closely related to Lepidobatrachus, Ceratophrys cranwelli, yielded even more similar transformations, corroborating the relevance of RA signaling variation in interspecific morphological change. Finally, we were able to recover the ancestral gut phenotype in Lepidobatrachus by performing a reverse chemical manipulation to upregulate RA signaling, providing strong evidence that modifications to this specific pathway promoted the emergence of a lineage-specific phenotypic novelty. Interestingly, our screen also revealed pathways that have not yet been implicated in early gut morphogenesis, such as thyroid hormone signaling. In general, the chemical genetic screen may be a valuable tool for identifying developmental mechanisms that underlie ecologically and evolutionarily relevant phenotypic variation. © 2013 Wiley Periodicals, Inc.

Initial Evidence for Adaptive Selection on the NADH Subunit Two of Freshwater Dolphins by Analyses of Mitochondrial Genomes.

PubMed

Caballero, Susana; Duchêne, Sebastian; Garavito, Manuel F; Slikas, Beth; Baker, C Scott

2015-01-01

A small number of cetaceans have adapted to an entirely freshwater environment, having colonized rivers in Asia and South America from an ancestral origin in the marine environment. This includes the 'river dolphins', early divergence from the odontocete lineage, and two species of true dolphins (Family Delphinidae). Successful adaptation to the freshwater environment may have required increased demands in energy involved in processes such as the mitochondrial osmotic balance. For this reason, riverine odontocetes provide a compelling natural experiment in adaptation of mammals from marine to freshwater habitats. Here we present initial evidence of positive selection in the NADH dehydrogenase subunit 2 of riverine odontocetes by analyses of full mitochondrial genomes, using tests of selection and protein structure modeling. The codon model with highest statistical support corresponds to three discrete categories for amino acid sites, those under positive, neutral, and purifying selection. With this model we found positive selection at site 297 of the NADH dehydrogenase subunit 2 (dN/dS>1.0,) leading to a substitution of an Ala or Val from the ancestral state of Thr. A phylogenetic reconstruction of 27 cetacean mitogenomes showed that an Ala substitution has evolved at least four times in cetaceans, once or more in the three 'river dolphins' (Families Pontoporidae, Lipotidae and Inidae), once in the riverine Sotalia fluviatilis (but not in its marine sister taxa), once in the riverine Orcaella brevirostris from the Mekong River (but not in its marine sister taxa) and once in two other related marine dolphins. We located the position of this amino acid substitution in an alpha-helix channel in the trans-membrane domain in both the E. coli structure and Sotalia fluviatilis model. In E. coli this position is located in a helix implicated in a proton translocation channel of respiratory complex 1 and may have a similar role in the NADH dehydrogenases of cetaceans.

Initial Evidence for Adaptive Selection on the NADH Subunit Two of Freshwater Dolphins by Analyses of Mitochondrial Genomes

PubMed Central

Caballero, Susana; Duchêne, Sebastian; Garavito, Manuel F.; Slikas, Beth; Baker, C. Scott

2015-01-01

A small number of cetaceans have adapted to an entirely freshwater environment, having colonized rivers in Asia and South America from an ancestral origin in the marine environment. This includes the ‘river dolphins’, early divergence from the odontocete lineage, and two species of true dolphins (Family Delphinidae). Successful adaptation to the freshwater environment may have required increased demands in energy involved in processes such as the mitochondrial osmotic balance. For this reason, riverine odontocetes provide a compelling natural experiment in adaptation of mammals from marine to freshwater habitats. Here we present initial evidence of positive selection in the NADH dehydrogenase subunit 2 of riverine odontocetes by analyses of full mitochondrial genomes, using tests of selection and protein structure modeling. The codon model with highest statistical support corresponds to three discrete categories for amino acid sites, those under positive, neutral, and purifying selection. With this model we found positive selection at site 297 of the NADH dehydrogenase subunit 2 (dN/dS>1.0,) leading to a substitution of an Ala or Val from the ancestral state of Thr. A phylogenetic reconstruction of 27 cetacean mitogenomes showed that an Ala substitution has evolved at least four times in cetaceans, once or more in the three ‘river dolphins’ (Families Pontoporidae, Lipotidae and Inidae), once in the riverine Sotalia fluviatilis (but not in its marine sister taxa), once in the riverine Orcaella brevirostris from the Mekong River (but not in its marine sister taxa) and once in two other related marine dolphins. We located the position of this amino acid substitution in an alpha-helix channel in the trans-membrane domain in both the E. coli structure and Sotalia fluviatilis model. In E. coli this position is located in a helix implicated in a proton translocation channel of respiratory complex 1 and may have a similar role in the NADH dehydrogenases of cetaceans. PMID:25946045

Robustness of Reconstructed Ancestral Protein Functions to Statistical Uncertainty.

PubMed

Eick, Geeta N; Bridgham, Jamie T; Anderson, Douglas P; Harms, Michael J; Thornton, Joseph W

2017-02-01

Hypotheses about the functions of ancient proteins and the effects of historical mutations on them are often tested using ancestral protein reconstruction (APR)-phylogenetic inference of ancestral sequences followed by synthesis and experimental characterization. Usually, some sequence sites are ambiguously reconstructed, with two or more statistically plausible states. The extent to which the inferred functions and mutational effects are robust to uncertainty about the ancestral sequence has not been studied systematically. To address this issue, we reconstructed ancestral proteins in three domain families that have different functions, architectures, and degrees of uncertainty; we then experimentally characterized the functional robustness of these proteins when uncertainty was incorporated using several approaches, including sampling amino acid states from the posterior distribution at each site and incorporating the alternative amino acid state at every ambiguous site in the sequence into a single "worst plausible case" protein. In every case, qualitative conclusions about the ancestral proteins' functions and the effects of key historical mutations were robust to sequence uncertainty, with similar functions observed even when scores of alternate amino acids were incorporated. There was some variation in quantitative descriptors of function among plausible sequences, suggesting that experimentally characterizing robustness is particularly important when quantitative estimates of ancient biochemical parameters are desired. The worst plausible case method appears to provide an efficient strategy for characterizing the functional robustness of ancestral proteins to large amounts of sequence uncertainty. Sampling from the posterior distribution sometimes produced artifactually nonfunctional proteins for sequences reconstructed with substantial ambiguity. © The Author 2016. Published by Oxford University Press on behalf of the Society for Molecular Biology and Evolution.

Ancestral Relationships Using Metafounders: Finite Ancestral Populations and Across Population Relationships

PubMed Central

Legarra, Andres; Christensen, Ole F.; Vitezica, Zulma G.; Aguilar, Ignacio; Misztal, Ignacy

2015-01-01

Recent use of genomic (marker-based) relationships shows that relationships exist within and across base population (breeds or lines). However, current treatment of pedigree relationships is unable to consider relationships within or across base populations, although such relationships must exist due to finite size of the ancestral population and connections between populations. This complicates the conciliation of both approaches and, in particular, combining pedigree with genomic relationships. We present a coherent theoretical framework to consider base population in pedigree relationships. We suggest a conceptual framework that considers each ancestral population as a finite-sized pool of gametes. This generates across-individual relationships and contrasts with the classical view which each population is considered as an infinite, unrelated pool. Several ancestral populations may be connected and therefore related. Each ancestral population can be represented as a “metafounder,” a pseudo-individual included as founder of the pedigree and similar to an “unknown parent group.” Metafounders have self- and across relationships according to a set of parameters, which measure ancestral relationships, i.e., homozygozities within populations and relationships across populations. These parameters can be estimated from existing pedigree and marker genotypes using maximum likelihood or a method based on summary statistics, for arbitrarily complex pedigrees. Equivalences of genetic variance and variance components between the classical and this new parameterization are shown. Segregation variance on crosses of populations is modeled. Efficient algorithms for computation of relationship matrices, their inverses, and inbreeding coefficients are presented. Use of metafounders leads to compatibility of genomic and pedigree relationship matrices and to simple computing algorithms. Examples and code are given. PMID:25873631

Environmental enrichment mitigates the impact of ancestral stress on motor skill and corticospinal tract plasticity.

PubMed

McCreary, J Keiko; Erickson, Zachary T; Metz, Gerlinde A S

2016-10-06

An adverse fetal environment in utero has been associated with long-term alterations in brain structure and function, and a higher risk of neurological disorders in later life. A common consequence of early adverse experience is impaired motor system function. A causal relationship for stress-associated impairments and a suitable therapy, however, have not been determined yet. To investigate the impact of ancestral stress on corticospinal tract (CST) morphology and fine motor performance in rats, and to determine if adverse programming by ancestral stress can be mitigated by environmental enrichment therapy in rats. The study examined F3 offspring generated by three lineages; one with prenatal stress only in the F1 generation, one with compounding effects of multigenerational prenatal stress, and a non-stress control lineage. F3 offspring from each lineage were injected with biotinylated dextran amine (BDA) into the motor cortex for anterograde tracing of the CST. Examination of the CST revealed reduced axonal density in the ancestrally stressed lineages. These anatomical changes were associated with significant impairments in skilled walking, as indicated by reduced foot placement accuracy and disturbed inter-limb coordination. Therapeutic intervention by environmental enrichment reduced the neuromorphological consequences of ancestral stress and restored skilled walking ability. The data suggest a causal relationship between stress-induced abnormal CST function and loss of fine motor performance. Thus, ancestral stress may be a determinant of motor system development and motor skill. Environmental enrichment may represent an effective intervention for the adverse programming by ancestral stress and trauma. Copyright © 2016 Elsevier Ireland Ltd. All rights reserved.

Population Stratification and Underrepresentation of Indian Subcontinent Genetic Diversity in the 1000 Genomes Project Dataset

PubMed Central

Sengupta, Dhriti; Choudhury, Ananyo; Basu, Analabha; Ramsay, Michèle

2016-01-01

Genomic variation in Indian populations is of great interest due to the diversity of ancestral components, social stratification, endogamy and complex admixture patterns. With an expanding population of 1.2 billion, India is also a treasure trove to catalogue innocuous as well as clinically relevant rare mutations. Recent studies have revealed four dominant ancestries in populations from mainland India: Ancestral North-Indian (ANI), Ancestral South-Indian (ASI), Ancestral Tibeto–Burman (ATB) and Ancestral Austro-Asiatic (AAA). The 1000 Genomes Project (KGP) Phase-3 data include about 500 genomes from five linguistically defined Indian-Subcontinent (IS) populations (Punjabi, Gujrati, Bengali, Telugu and Tamil) some of whom are recent migrants to USA or UK. Comparative analyses show that despite the distinct geographic origins of the KGP-IS populations, the ANI component is predominantly represented in this dataset. Previous studies demonstrated population substructure in the HapMap Gujrati population, and we found evidence for additional substructure in the Punjabi and Telugu populations. These substructured populations have characteristic/significant differences in heterozygosity and inbreeding coefficients. Moreover, we demonstrate that the substructure is better explained by factors like differences in proportion of ancestral components, and endogamy driven social structure rather than invoking a novel ancestral component to explain it. Therefore, using language and/or geography as a proxy for an ethnic unit is inadequate for many of the IS populations. This highlights the necessity for more nuanced sampling strategies or corrective statistical approaches, particularly for biomedical and population genetics research in India. PMID:27797945

Detecting independent and recurrent copy number aberrations using interval graphs.

PubMed

Wu, Hsin-Ta; Hajirasouliha, Iman; Raphael, Benjamin J

2014-06-15

Somatic copy number aberrations SCNAS: are frequent in cancer genomes, but many of these are random, passenger events. A common strategy to distinguish functional aberrations from passengers is to identify those aberrations that are recurrent across multiple samples. However, the extensive variability in the length and position of SCNA: s makes the problem of identifying recurrent aberrations notoriously difficult. We introduce a combinatorial approach to the problem of identifying independent and recurrent SCNA: s, focusing on the key challenging of separating the overlaps in aberrations across individuals into independent events. We derive independent and recurrent SCNA: s as maximal cliques in an interval graph constructed from overlaps between aberrations. We efficiently enumerate all such cliques, and derive a dynamic programming algorithm to find an optimal selection of non-overlapping cliques, resulting in a very fast algorithm, which we call RAIG (Recurrent Aberrations from Interval Graphs). We show that RAIG outperforms other methods on simulated data and also performs well on data from three cancer types from The Cancer Genome Atlas (TCGA). In contrast to existing approaches that employ various heuristics to select independent aberrations, RAIG optimizes a well-defined objective function. We show that this allows RAIG to identify rare aberrations that are likely functional, but are obscured by overlaps with larger passenger aberrations. http://compbio.cs.brown.edu/software. © The Author 2014. Published by Oxford University Press.

A graph grammar approach to artificial life.

PubMed

Kniemeyer, Ole; Buck-Sorlin, Gerhard H; Kurth, Winfried

2004-01-01

We present the high-level language of relational growth grammars (RGGs) as a formalism designed for the specification of ALife models. RGGs can be seen as an extension of the well-known parametric Lindenmayer systems and contain rule-based, procedural, and object-oriented features. They are defined as rewriting systems operating on graphs with the edges coming from a set of user-defined relations, whereas the nodes can be associated with objects. We demonstrate their ability to represent genes, regulatory networks of metabolites, and morphologically structured organisms, as well as developmental aspects of these entities, in a common formal framework. Mutation, crossing over, selection, and the dynamics of a network of gene regulation can all be represented with simple graph rewriting rules. This is demonstrated in some detail on the classical example of Dawkins' biomorphs and the ABC model of flower morphogenesis: other applications are briefly sketched. An interactive program was implemented, enabling the execution of the formalism and the visualization of the results.

Distributed adaptive neural network control for a class of heterogeneous nonlinear multi-agent systems subject to actuation failures

NASA Astrophysics Data System (ADS)

Cui, Bing; Zhao, Chunhui; Ma, Tiedong; Feng, Chi

2017-02-01

In this paper, the cooperative adaptive consensus tracking problem for heterogeneous nonlinear multi-agent systems on directed graph is addressed. Each follower is modelled as a general nonlinear system with the unknown and nonidentical nonlinear dynamics, disturbances and actuator failures. Cooperative fault tolerant neural network tracking controllers with online adaptive learning features are proposed to guarantee that all agents synchronise to the trajectory of one leader with bounded adjustable synchronisation errors. With the help of linear quadratic regulator-based optimal design, a graph-dependent Lyapunov proof provides error bounds that depend on the graph topology, one virtual matrix and some design parameters. Of particular interest is that if the control gain is selected appropriately, the proposed control scheme can be implemented in a unified framework no matter whether there are faults or not. Furthermore, the fault detection and isolation are not needed to implement. Finally, a simulation is given to verify the effectiveness of the proposed method.

Asymmetry in search.

PubMed

Kaindl, H; Kainz, G; Radda, K

2001-01-01

Most of the work on search in artificial intelligence (AI) deals with one search direction only-mostly forward search-although it is known that a structural asymmetry of the search graph causes differences in the efficiency of searching in the forward or the backward direction, respectively. In the case of symmetrical graph structure, however, current theory would not predict such differences in efficiency. In several classes of job sequencing problems, we observed a phenomenon of asymmetry in search that relates to the distribution of the are costs in the search graph. This phenomenon can be utilized for improving the search efficiency by a new algorithm that automatically selects the search direction. We demonstrate fur a class of job sequencing problems that, through the utilization of this phenomenon, much more difficult problems can be solved-according to our best knowledge-than by the best published approach, and on the same problems, the running time is much reduced. As a consequence, we propose to check given problems for asymmetrical distribution of are costs that may cause asymmetry in search.

Unapparent Information Revelation: Text Mining for Counterterrorism

NASA Astrophysics Data System (ADS)

Srihari, Rohini K.

Unapparent information revelation (UIR) is a special case of text mining that focuses on detecting possible links between concepts across multiple text documents by generating an evidence trail explaining the connection. A traditional search involving, for example, two or more person names will attempt to find documents mentioning both these individuals. This research focuses on a different interpretation of such a query: what is the best evidence trail across documents that explains a connection between these individuals? For example, all may be good golfers. A generalization of this task involves query terms representing general concepts (e.g. indictment, foreign policy). Previous approaches to this problem have focused on graph mining involving hyperlinked documents, and link analysis exploiting named entities. A new robust framework is presented, based on (i) generating concept chain graphs, a hybrid content representation, (ii) performing graph matching to select candidate subgraphs, and (iii) subsequently using graphical models to validate hypotheses using ranked evidence trails. We adapt the DUC data set for cross-document summarization to evaluate evidence trails generated by this approach

Explaining evolution via constrained persistent perfect phylogeny

PubMed Central

2014-01-01

Background The perfect phylogeny is an often used model in phylogenetics since it provides an efficient basic procedure for representing the evolution of genomic binary characters in several frameworks, such as for example in haplotype inference. The model, which is conceptually the simplest, is based on the infinite sites assumption, that is no character can mutate more than once in the whole tree. A main open problem regarding the model is finding generalizations that retain the computational tractability of the original model but are more flexible in modeling biological data when the infinite site assumption is violated because of e.g. back mutations. A special case of back mutations that has been considered in the study of the evolution of protein domains (where a domain is acquired and then lost) is persistency, that is the fact that a character is allowed to return back to the ancestral state. In this model characters can be gained and lost at most once. In this paper we consider the computational problem of explaining binary data by the Persistent Perfect Phylogeny model (referred as PPP) and for this purpose we investigate the problem of reconstructing an evolution where some constraints are imposed on the paths of the tree. Results We define a natural generalization of the PPP problem obtained by requiring that for some pairs (character, species), neither the species nor any of its ancestors can have the character. In other words, some characters cannot be persistent for some species. This new problem is called Constrained PPP (CPPP). Based on a graph formulation of the CPPP problem, we are able to provide a polynomial time solution for the CPPP problem for matrices whose conflict graph has no edges. Using this result, we develop a parameterized algorithm for solving the CPPP problem where the parameter is the number of characters. Conclusions A preliminary experimental analysis shows that the constrained persistent perfect phylogeny model allows to explain efficiently data that do not conform with the classical perfect phylogeny model. PMID:25572381

Adaptive graph-based multiple testing procedures

PubMed Central

Klinglmueller, Florian; Posch, Martin; Koenig, Franz

2016-01-01

Multiple testing procedures defined by directed, weighted graphs have recently been proposed as an intuitive visual tool for constructing multiple testing strategies that reflect the often complex contextual relations between hypotheses in clinical trials. Many well-known sequentially rejective tests, such as (parallel) gatekeeping tests or hierarchical testing procedures are special cases of the graph based tests. We generalize these graph-based multiple testing procedures to adaptive trial designs with an interim analysis. These designs permit mid-trial design modifications based on unblinded interim data as well as external information, while providing strong family wise error rate control. To maintain the familywise error rate, it is not required to prespecify the adaption rule in detail. Because the adaptive test does not require knowledge of the multivariate distribution of test statistics, it is applicable in a wide range of scenarios including trials with multiple treatment comparisons, endpoints or subgroups, or combinations thereof. Examples of adaptations are dropping of treatment arms, selection of subpopulations, and sample size reassessment. If, in the interim analysis, it is decided to continue the trial as planned, the adaptive test reduces to the originally planned multiple testing procedure. Only if adaptations are actually implemented, an adjusted test needs to be applied. The procedure is illustrated with a case study and its operating characteristics are investigated by simulations. PMID:25319733

Improving the Accuracy of Attribute Extraction using the Relatedness between Attribute Values

NASA Astrophysics Data System (ADS)

Bollegala, Danushka; Tani, Naoki; Ishizuka, Mitsuru

Extracting attribute-values related to entities from web texts is an important step in numerous web related tasks such as information retrieval, information extraction, and entity disambiguation (namesake disambiguation). For example, for a search query that contains a personal name, we can not only return documents that contain that personal name, but if we have attribute-values such as the organization for which that person works, we can also suggest documents that contain information related to that organization, thereby improving the user's search experience. Despite numerous potential applications of attribute extraction, it remains a challenging task due to the inherent noise in web data -- often a single web page contains multiple entities and attributes. We propose a graph-based approach to select the correct attribute-values from a set of candidate attribute-values extracted for a particular entity. First, we build an undirected weighted graph in which, attribute-values are represented by nodes, and the edge that connects two nodes in the graph represents the degree of relatedness between the corresponding attribute-values. Next, we find the maximum spanning tree of this graph that connects exactly one attribute-value for each attribute-type. The proposed method outperforms previously proposed attribute extraction methods on a dataset that contains 5000 web pages.

Parallel Algorithms for Switching Edges in Heterogeneous Graphs.

PubMed

Bhuiyan, Hasanuzzaman; Khan, Maleq; Chen, Jiangzhuo; Marathe, Madhav

2017-06-01

An edge switch is an operation on a graph (or network) where two edges are selected randomly and one of their end vertices are swapped with each other. Edge switch operations have important applications in graph theory and network analysis, such as in generating random networks with a given degree sequence, modeling and analyzing dynamic networks, and in studying various dynamic phenomena over a network. The recent growth of real-world networks motivates the need for efficient parallel algorithms. The dependencies among successive edge switch operations and the requirement to keep the graph simple (i.e., no self-loops or parallel edges) as the edges are switched lead to significant challenges in designing a parallel algorithm. Addressing these challenges requires complex synchronization and communication among the processors leading to difficulties in achieving a good speedup by parallelization. In this paper, we present distributed memory parallel algorithms for switching edges in massive networks. These algorithms provide good speedup and scale well to a large number of processors. A harmonic mean speedup of 73.25 is achieved on eight different networks with 1024 processors. One of the steps in our edge switch algorithms requires the computation of multinomial random variables in parallel. This paper presents the first non-trivial parallel algorithm for the problem, achieving a speedup of 925 using 1024 processors.

Origin of amphibian and avian chromosomes by fission, fusion, and retention of ancestral chromosomes

PubMed Central

Voss, Stephen R.; Kump, D. Kevin; Putta, Srikrishna; Pauly, Nathan; Reynolds, Anna; Henry, Rema J.; Basa, Saritha; Walker, John A.; Smith, Jeramiah J.

2011-01-01

Amphibian genomes differ greatly in DNA content and chromosome size, morphology, and number. Investigations of this diversity are needed to identify mechanisms that have shaped the evolution of vertebrate genomes. We used comparative mapping to investigate the organization of genes in the Mexican axolotl (Ambystoma mexicanum), a species that presents relatively few chromosomes (n = 14) and a gigantic genome (>20 pg/N). We show extensive conservation of synteny between Ambystoma, chicken, and human, and a positive correlation between the length of conserved segments and genome size. Ambystoma segments are estimated to be four to 51 times longer than homologous human and chicken segments. Strikingly, genes demarking the structures of 28 chicken chromosomes are ordered among linkage groups defining the Ambystoma genome, and we show that these same chromosomal segments are also conserved in a distantly related anuran amphibian (Xenopus tropicalis). Using linkage relationships from the amphibian maps, we predict that three chicken chromosomes originated by fusion, nine to 14 originated by fission, and 12–17 evolved directly from ancestral tetrapod chromosomes. We further show that some ancestral segments were fused prior to the divergence of salamanders and anurans, while others fused independently and randomly as chromosome numbers were reduced in lineages leading to Ambystoma and Xenopus. The maintenance of gene order relationships between chromosomal segments that have greatly expanded and contracted in salamander and chicken genomes, respectively, suggests selection to maintain synteny relationships and/or extremely low rates of chromosomal rearrangement. Overall, the results demonstrate the value of data from diverse, amphibian genomes in studies of vertebrate genome evolution. PMID:21482624

Stability-activity tradeoffs constrain the adaptive evolution of RubisCO.

PubMed

Studer, Romain A; Christin, Pascal-Antoine; Williams, Mark A; Orengo, Christine A

2014-02-11

A well-known case of evolutionary adaptation is that of ribulose-1,5-bisphosphate carboxylase (RubisCO), the enzyme responsible for fixation of CO2 during photosynthesis. Although the majority of plants use the ancestral C3 photosynthetic pathway, many flowering plants have evolved a derived pathway named C4 photosynthesis. The latter concentrates CO2, and C4 RubisCOs consequently have lower specificity for, and faster turnover of, CO2. The C4 forms result from convergent evolution in multiple clades, with substitutions at a small number of sites under positive selection. To understand the physical constraints on these evolutionary changes, we reconstructed in silico ancestral sequences and 3D structures of RubisCO from a large group of related C3 and C4 species. We were able to precisely track their past evolutionary trajectories, identify mutations on each branch of the phylogeny, and evaluate their stability effect. We show that RubisCO evolution has been constrained by stability-activity tradeoffs similar in character to those previously identified in laboratory-based experiments. The C4 properties require a subset of several ancestral destabilizing mutations, which from their location in the structure are inferred to mainly be involved in enhancing conformational flexibility of the open-closed transition in the catalytic cycle. These mutations are near, but not in, the active site or at intersubunit interfaces. The C3 to C4 transition is preceded by a sustained period in which stability of the enzyme is increased, creating the capacity to accept the functionally necessary destabilizing mutations, and is immediately followed by compensatory mutations that restore global stability.

Characterisation of monotreme caseins reveals lineage-specific expansion of an ancestral casein locus in mammals.

PubMed

Lefèvre, Christophe M; Sharp, Julie A; Nicholas, Kevin R

2009-01-01

Using a milk-cell cDNA sequencing approach we characterised milk-protein sequences from two monotreme species, platypus (Ornithorhynchus anatinus) and echidna (Tachyglossus aculeatus) and found a full set of caseins and casein variants. The genomic organisation of the platypus casein locus is compared with other mammalian genomes, including the marsupial opossum and several eutherians. Physical linkage of casein genes has been seen in the casein loci of all mammalian genomes examined and we confirm that this is also observed in platypus. However, we show that a recent duplication of beta-casein occurred in the monotreme lineage, as opposed to more ancient duplications of alpha-casein in the eutherian lineage, while marsupials possess only single copies of alpha- and beta-caseins. Despite this variability, the close proximity of the main alpha- and beta-casein genes in an inverted tail-tail orientation and the relative orientation of the more distant kappa-casein genes are similar in all mammalian genome sequences so far available. Overall, the conservation of the genomic organisation of the caseins indicates the early, pre-monotreme development of the fundamental role of caseins during lactation. In contrast, the lineage-specific gene duplications that have occurred within the casein locus of monotremes and eutherians but not marsupials, which may have lost part of the ancestral casein locus, emphasises the independent selection on milk provision strategies to the young, most likely linked to different developmental strategies. The monotremes therefore provide insight into the ancestral drivers for lactation and how these have adapted in different lineages.

Changes of heterogeneous cell populations in the Ishikawa cell line during long-term culture: Proposal for an in vitro clonal evolution model of tumor cells.

PubMed

Kasai, Fumio; Hirayama, Noriko; Ozawa, Midori; Iemura, Masashi; Kohara, Arihiro

2016-06-01

Genomic changes in tumor cell lines can occur during culture, leading to differences between cell lines carrying the same name. In this study, genome profiles between low and high passages were investigated in the Ishikawa 3-H-12 cell line (JCRB1505). Cells contained between 43 and 46 chromosomes and the modal number changed from 46 to 45 during culture. Cytogenetic analysis revealed that a translocation t(9;14), observed in all metaphases, is a robust marker for this cell line. Single-nucleotide polymorphism microarrays showed a heterogeneous copy number in the early passages and distinct profiles at late passages. These results demonstrate that cell culture can lead to elimination of ancestral clones by sequential selection, resulting in extensive replacement with a novel clone. Our observations on Ishikawa cells in vitro are different from the in vivo heterogeneity in which ancestral clones are often retained during tumor evolution and suggest a model for in vitro clonal evolution. Copyright © 2016 Elsevier Inc. All rights reserved.

The evolution of sex: A new hypothesis based on mitochondrial mutational erosion: Mitochondrial mutational erosion in ancestral eukaryotes would favor the evolution of sex, harnessing nuclear recombination to optimize compensatory nuclear coadaptation.

PubMed

Havird, Justin C; Hall, Matthew D; Dowling, Damian K

2015-09-01

The evolution of sex in eukaryotes represents a paradox, given the "twofold" fitness cost it incurs. We hypothesize that the mutational dynamics of the mitochondrial genome would have favored the evolution of sexual reproduction. Mitochondrial DNA (mtDNA) exhibits a high-mutation rate across most eukaryote taxa, and several lines of evidence suggest that this high rate is an ancestral character. This seems inexplicable given that mtDNA-encoded genes underlie the expression of life's most salient functions, including energy conversion. We propose that negative metabolic effects linked to mitochondrial mutation accumulation would have invoked selection for sexual recombination between divergent host nuclear genomes in early eukaryote lineages. This would provide a mechanism by which recombinant host genotypes could be rapidly shuffled and screened for the presence of compensatory modifiers that offset mtDNA-induced harm. Under this hypothesis, recombination provides the genetic variation necessary for compensatory nuclear coadaptation to keep pace with mitochondrial mutation accumulation. © 2015 WILEY Periodicals, Inc.

Population Stratification and Underrepresentation of Indian Subcontinent Genetic Diversity in the 1000 Genomes Project Dataset.

PubMed

Sengupta, Dhriti; Choudhury, Ananyo; Basu, Analabha; Ramsay, Michèle

2016-12-31

Genomic variation in Indian populations is of great interest due to the diversity of ancestral components, social stratification, endogamy and complex admixture patterns. With an expanding population of 1.2 billion, India is also a treasure trove to catalogue innocuous as well as clinically relevant rare mutations. Recent studies have revealed four dominant ancestries in populations from mainland India: Ancestral North-Indian (ANI), Ancestral South-Indian (ASI), Ancestral Tibeto-Burman (ATB) and Ancestral Austro-Asiatic (AAA). The 1000 Genomes Project (KGP) Phase-3 data include about 500 genomes from five linguistically defined Indian-Subcontinent (IS) populations (Punjabi, Gujrati, Bengali, Telugu and Tamil) some of whom are recent migrants to USA or UK. Comparative analyses show that despite the distinct geographic origins of the KGP-IS populations, the ANI component is predominantly represented in this dataset. Previous studies demonstrated population substructure in the HapMap Gujrati population, and we found evidence for additional substructure in the Punjabi and Telugu populations. These substructured populations have characteristic/significant differences in heterozygosity and inbreeding coefficients. Moreover, we demonstrate that the substructure is better explained by factors like differences in proportion of ancestral components, and endogamy driven social structure rather than invoking a novel ancestral component to explain it. Therefore, using language and/or geography as a proxy for an ethnic unit is inadequate for many of the IS populations. This highlights the necessity for more nuanced sampling strategies or corrective statistical approaches, particularly for biomedical and population genetics research in India. © The Author(s) 2016. Published by Oxford University Press on behalf of the Society for Molecular Biology and Evolution.

DeCoSTAR: Reconstructing the Ancestral Organization of Genes or Genomes Using Reconciled Phylogenies

PubMed Central

Anselmetti, Yoann; Patterson, Murray; Ponty, Yann; B�rard, S�verine; Chauve, Cedric; Scornavacca, Celine; Daubin, Vincent; Tannier, Eric

2017-01-01

DeCoSTAR is a software that aims at reconstructing the organization of ancestral genes or genomes in the form of sets of neighborhood relations (adjacencies) between pairs of ancestral genes or gene domains. It can also improve the assembly of fragmented genomes by proposing evolutionary-induced adjacencies between scaffolding fragments. Ancestral genes or domains are deduced from reconciled phylogenetic trees under an evolutionary model that considers gains, losses, speciations, duplications, and transfers as possible events for gene evolution. Reconciliations are either given as input or computed with the ecceTERA package, into which DeCoSTAR is integrated. DeCoSTAR computes adjacency evolutionary scenarios using a scoring scheme based on a weighted sum of adjacency gains and breakages. Solutions, both optimal and near-optimal, are sampled according to the Boltzmann–Gibbs distribution centered around parsimonious solutions, and statistical supports on ancestral and extant adjacencies are provided. DeCoSTAR supports the features of previously contributed tools that reconstruct ancestral adjacencies, namely DeCo, DeCoLT, ART-DeCo, and DeClone. In a few minutes, DeCoSTAR can reconstruct the evolutionary history of domains inside genes, of gene fusion and fission events, or of gene order along chromosomes, for large data sets including dozens of whole genomes from all kingdoms of life. We illustrate the potential of DeCoSTAR with several applications: ancestral reconstruction of gene orders for Anopheles mosquito genomes, multidomain proteins in Drosophila, and gene fusion and fission detection in Actinobacteria. Availability: http://pbil.univ-lyon1.fr/software/DeCoSTAR (Last accessed April 24, 2017). PMID:28402423

Ancestral Relationships Using Metafounders: Finite Ancestral Populations and Across Population Relationships.

PubMed

Legarra, Andres; Christensen, Ole F; Vitezica, Zulma G; Aguilar, Ignacio; Misztal, Ignacy

2015-06-01

Recent use of genomic (marker-based) relationships shows that relationships exist within and across base population (breeds or lines). However, current treatment of pedigree relationships is unable to consider relationships within or across base populations, although such relationships must exist due to finite size of the ancestral population and connections between populations. This complicates the conciliation of both approaches and, in particular, combining pedigree with genomic relationships. We present a coherent theoretical framework to consider base population in pedigree relationships. We suggest a conceptual framework that considers each ancestral population as a finite-sized pool of gametes. This generates across-individual relationships and contrasts with the classical view which each population is considered as an infinite, unrelated pool. Several ancestral populations may be connected and therefore related. Each ancestral population can be represented as a "metafounder," a pseudo-individual included as founder of the pedigree and similar to an "unknown parent group." Metafounders have self- and across relationships according to a set of parameters, which measure ancestral relationships, i.e., homozygozities within populations and relationships across populations. These parameters can be estimated from existing pedigree and marker genotypes using maximum likelihood or a method based on summary statistics, for arbitrarily complex pedigrees. Equivalences of genetic variance and variance components between the classical and this new parameterization are shown. Segregation variance on crosses of populations is modeled. Efficient algorithms for computation of relationship matrices, their inverses, and inbreeding coefficients are presented. Use of metafounders leads to compatibility of genomic and pedigree relationship matrices and to simple computing algorithms. Examples and code are given. Copyright © 2015 by the Genetics Society of America.

Ancestral TCDD exposure promotes epigenetic transgenerational inheritance of imprinted gene Igf2: Methylation status and DNMTs

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ma, Jing; Chen, Xi; Liu, Yanan

2015-12-01

Ancestral TCDD exposure could induce epigenetic transgenerational phenotypes, which may be mediated in part by imprinted gene inheritance. The aim of our study was to evaluate the transgenerational effects of ancestral TCDD exposure on the imprinted gene insulin-like growth factor-2 (Igf2) in rat somatic tissue. TCDD was administered daily by oral gavage to groups of F0 pregnant SD rats at dose levels of 0 (control), 200 or 800 ng/kg bw during gestation day 8–14. Animal transgenerational model of ancestral exposure to TCDD was carefully built, avoiding sibling inbreeding. Hepatic Igf2 expression of the TCDD male progeny was decreased concomitantly withmore » hepatic damage and increased activities of serum hepatic enzymes both in the F1 and F3 generation. Imprinted Control Region (ICR) of Igf2 manifested a hypermethylated pattern, whereas methylation status in the Differentially Methylated Region 2 (DMR2) showed a hypomethylated manner in the F1 generation. These epigenetic alterations in these two regions maintained similar trends in the F3 generation. Meanwhile, the expressions of DNA methyltransferases (DNMT1, DNMT3A and DNMT3B) changed in a non-monotonic manner both in the F1 and F3 generation. This study provides evidence that ancestral TCDD exposure may promote epigenetic transgenerational alterations of imprinted gene Igf2 in adult somatic tissue. - Highlights: • Ancestral TCDD exposure induces epigenetic transgenerational inheritance. • Ancestral TCDD exposure affects methylation status in ICR and DMR2 region of Igf2. • DNMTs play a role in TCDD induced epigenetic transgenerational changes of Igf2.« less

Reconstructed Ancestral Enzymes Impose a Fitness Cost upon Modern Bacteria Despite Exhibiting Favourable Biochemical Properties.

PubMed

Hobbs, Joanne K; Prentice, Erica J; Groussin, Mathieu; Arcus, Vickery L

2015-10-01

Ancestral sequence reconstruction has been widely used to study historical enzyme evolution, both from biochemical and cellular perspectives. Two properties of reconstructed ancestral proteins/enzymes are commonly reported--high thermostability and high catalytic activity--compared with their contemporaries. Increased protein stability is associated with lower aggregation rates, higher soluble protein abundance and a greater capacity to evolve, and therefore, these proteins could be considered "superior" to their contemporary counterparts. In this study, we investigate the relationship between the favourable in vitro biochemical properties of reconstructed ancestral enzymes and the organismal fitness they confer in vivo. We have previously reconstructed several ancestors of the enzyme LeuB, which is essential for leucine biosynthesis. Our initial fitness experiments revealed that overexpression of ANC4, a reconstructed LeuB that exhibits high stability and activity, was only able to partially rescue the growth of a ΔleuB strain, and that a strain complemented with this enzyme was outcompeted by strains carrying one of its descendants. When we expanded our study to include five reconstructed LeuBs and one contemporary, we found that neither in vitro protein stability nor the catalytic rate was correlated with fitness. Instead, fitness showed a strong, negative correlation with estimated evolutionary age (based on phylogenetic relationships). Our findings suggest that, for reconstructed ancestral enzymes, superior in vitro properties do not translate into organismal fitness in vivo. The molecular basis of the relationship between fitness and the inferred age of ancestral LeuB enzymes is unknown, but may be related to the reconstruction process. We also hypothesise that the ancestral enzymes may be incompatible with the other, contemporary enzymes of the metabolic network.

Comparing accelerometer, pedometer and a questionnaire for measuring physical activity in bronchiectasis: a validity and feasibility study?

PubMed

O'Neill, B; McDonough, S M; Wilson, J J; Bradbury, I; Hayes, K; Kirk, A; Kent, L; Cosgrove, D; Bradley, J M; Tully, M A

2017-01-14

There are challenges for researchers and clinicians to select the most appropriate physical activity tool, and a balance between precision and feasibility is needed. Currently it is unclear which physical activity tool should be used to assess physical activity in Bronchiectasis. The aim of this research is to compare assessment methods (pedometer and IPAQ) to our criterion method (ActiGraph) for the measurement of physical activity dimensions in Bronchiectasis (BE), and to assess their feasibility and acceptability. Patients in this analysis were enrolled in a cross-sectional study. The ActiGraph and pedometer were worn for seven consecutive days and the IPAQ was completed for the same period. Statistical analyses were performed using SPSS 20 (IBM). Descriptive statistics were used; the percentage agreement between ActiGraph and the other measures were calculated using limits of agreement. Feedback about the feasibility of the activity monitors and the IPAQ was obtained. There were 55 (22 male) data sets available. For step count there was no significant difference between the ActiGraph and Pedometer, however, total physical activity time (mins) as recorded by the ActiGraph was significantly higher than the pedometer (mean ± SD, 232 (75) vs. 63 (32)). Levels of agreement between the two devices was very good for step count (97% agreement); and variation in the levels of agreement were within accepted limits of ±2 standard deviations from the mean value. IPAQ reported more bouted- moderate - vigorous physical activity (MVPA) [mean, SD; 167(170) vs 6(9) mins/day], and significantly less sedentary time than ActiGraph [mean, SD; 362(115) vs 634(76) vmins/day]. There were low levels of agreement between the two tools (57% sedentary behaviour; 0% MVPA 10+ ), with IPAQ under-reporting sedentary behaviour and over-reporting MVPA 10+ compared to ActiGraph. The monitors were found to be feasible and acceptable by participants and researchers; while the IPAQ was accepta ble to use, most patients required assistance to complete it. Accurate measurement of physical activity is feasible in BE and will be valuable for future trials of therapeutic interventions. ActiGraph or pedometer could be used to measure simple daily step counts, but ActiGraph was superior as it measured intensity of physical activity and was a more precise measure of time spent walking. The IPAQ does not appear to represent an accurate measure of physical activity in this population. Clinical Trials Registration Number NCT01569009 : Physical Activity in Bronchiectasis.

Evaluation of the User Strategy on 2d and 3d City Maps Based on Novel Scanpath Comparison Method and Graph Visualization

NASA Astrophysics Data System (ADS)

Dolezalova, J.; Popelka, S.

2016-06-01

The paper is dealing with scanpath comparison of eye-tracking data recorded during case study focused on the evaluation of 2D and 3D city maps. The experiment contained screenshots from three map portals. Two types of maps were used - standard map and 3D visualization. Respondents' task was to find particular point symbol on the map as fast as possible. Scanpath comparison is one group of the eye-tracking data analyses methods used for revealing the strategy of the respondents. In cartographic studies, the most commonly used application for scanpath comparison is eyePatterns that output is hierarchical clustering and a tree graph representing the relationships between analysed sequences. During an analysis of the algorithm generating a tree graph, it was found that the outputs do not correspond to the reality. We proceeded to the creation of a new tool called ScanGraph. This tool uses visualization of cliques in simple graphs and is freely available at www.eyetracking.upol.cz/scangraph. Results of the study proved the functionality of the tool and its suitability for analyses of different strategies of map readers. Based on the results of the tool, similar scanpaths were selected, and groups of respondents with similar strategies were identified. With this knowledge, it is possible to analyse the relationship between belonging to the group with similar strategy and data gathered from the questionnaire (age, sex, cartographic knowledge, etc.) or type of stimuli (2D, 3D map).

Low-flow frequency curves for selected long-term stream gaging stations in eastern United States

USGS Publications Warehouse

Hardison, Clayton H.; Martin, Robert O.R.

1963-01-01

Curves showing the magnitude and frequency of annual low flow at 85 streamgaging stations located in 17 States east and 5 States west of the Mississippi River have been smoothed and adjusted to one of four long-term periods. They are presented to show the similarity and dissimilarity of curves even in the same State and to provide background information for studies of the statistical properties of low-flow frequency curves and for studies of the relation between hydrologic environment and low flow. The results are presented as greatly reduced graphs to facilitate comparison and are summarized in tables from which expanded graphs can be plotted.

Seeing is believing: good graphic design principles for medical research.

PubMed

Duke, Susan P; Bancken, Fabrice; Crowe, Brenda; Soukup, Mat; Botsis, Taxiarchis; Forshee, Richard

2015-09-30

Have you noticed when you browse a book, journal, study report, or product label how your eye is drawn to figures more than to words and tables? Statistical graphs are powerful ways to transparently and succinctly communicate the key points of medical research. Furthermore, the graphic design itself adds to the clarity of the messages in the data. The goal of this paper is to provide a mechanism for selecting the appropriate graph to thoughtfully construct quality deliverables using good graphic design principles. Examples are motivated by the efforts of a Safety Graphics Working Group that consisted of scientists from the pharmaceutical industry, Food and Drug Administration, and academic institutions. Copyright © 2015 John Wiley & Sons, Ltd.

The Legacy of Leonhard Euler--A Tricentennial Tribute

ERIC Educational Resources Information Center

Debnath, Lokenath

2009-01-01

This tricentennial tribute commemorates Euler's major contributions to mathematical and physical sciences. A brief biographical sketch is presented with his major contributions to certain selected areas of number theory, differential and integral calculus, differential equations, solid and fluid mechanics, topology and graph theory, infinite…

Techniques for estimating magnitude and frequency of floods in Minnesota

USGS Publications Warehouse

Guetzkow, Lowell C.

1977-01-01

 Estimating relations have been developed to provide engineers and designers with improved techniques for defining flow-frequency characteristics to satisfy hydraulic planning and design requirements. The magnitude and frequency of floods up to the 100-year recurrence interval can be determined for most streams in Minnesota by methods presented. By multiple regression analysis, equations have been developed for estimating flood-frequency relations at ungaged sites on natural flow streams. Eight distinct hydrologic regions are delineated within the State with boundaries defined generally by river basin divides. Regression equations are provided for each region which relate selected frequency floods to significant basin parameters. For main-stem streams, graphs are presented showing floods for selected recurrence intervals plotted against contributing drainage area. Flow-frequency estimates for intervening sites along the Minnesota River, Mississippi River, and the Red River of the North can be derived from these graphs. Flood-frequency characteristics are tabulated for 201 paging stations having 10 or more years of record.

Mobile satellite services: A survey of business needs

NASA Astrophysics Data System (ADS)

Hainzer, Eric M.

Conceptualizing and understanding the international business traveler's communication requirements by the use of a survey and selection of a mobile satellite system that satisfies those requirements are discussed. Chapter 5 incorporates an in depth analysis of the respondent's answers to survey questions and graphing them with frequency distribution histograms. Chapter 6 concludes with a selection of the most likely MSS manufacturer who appears to satisfy those communication requirements discovered in the previous chapter. Following a general-introduction in Chapter 1, the current climate of mobile satellite system (MSS) providers is discussed in Chapter 2. Chapter 3 assesses the implication of launch vehicles as it pertains to the political, technical, and financial aspects of MSS manufacturers and users. Special attention is provided, when possible, between the political environment and its relationship with forefront technology. In chapter 4, the procedure that was used to create the survey and its research methodology is shown. Graphs and charts are used, where appropriate, for the purpose of clarity and readability.

Resurrecting ancestral genes in bacteria to interpret ancient biosignatures

NASA Astrophysics Data System (ADS)

Kacar, Betul; Guy, Lionel; Smith, Eric; Baross, John

2017-11-01

Two datasets, the geologic record and the genetic content of extant organisms, provide complementary insights into the history of how key molecular components have shaped or driven global environmental and macroevolutionary trends. Changes in global physico-chemical modes over time are thought to be a consistent feature of this relationship between Earth and life, as life is thought to have been optimizing protein functions for the entirety of its approximately 3.8 billion years of history on the Earth. Organismal survival depends on how well critical genetic and metabolic components can adapt to their environments, reflecting an ability to optimize efficiently to changing conditions. The geologic record provides an array of biologically independent indicators of macroscale atmospheric and oceanic composition, but provides little in the way of the exact behaviour of the molecular components that influenced the compositions of these reservoirs. By reconstructing sequences of proteins that might have been present in ancient organisms, we can downselect to a subset of possible sequences that may have been optimized to these ancient environmental conditions. How can one use modern life to reconstruct ancestral behaviours? Configurations of ancient sequences can be inferred from the diversity of extant sequences, and then resurrected in the laboratory to ascertain their biochemical attributes. One way to augment sequence-based, single-gene methods to obtain a richer and more reliable picture of the deep past, is to resurrect inferred ancestral protein sequences in living organisms, where their phenotypes can be exposed in a complex molecular-systems context, and then to link consequences of those phenotypes to biosignatures that were preserved in the independent historical repository of the geological record. As a first step beyond single-molecule reconstruction to the study of functional molecular systems, we present here the ancestral sequence reconstruction of the beta-carbonic anhydrase protein. We assess how carbonic anhydrase proteins meet our selection criteria for reconstructing ancient biosignatures in the laboratory, which we term palaeophenotype reconstruction. This article is part of the themed issue 'Reconceptualizing the origins of life'.

The evolution of endothermy in Cenozoic mammals: a plesiomorphic-apomorphic continuum.

PubMed

Lovegrove, Barry Gordon

2012-02-01

The evolution of endothermy in birds and mammals was one of the most important events in the evolution of the vertebrates. Past tests of hypotheses on the evolution of endothermy in mammals have relied largely on analyses of the relationship between basal and maximum metabolic rate, and artificial selection experiments. I argue that components of existing hypotheses, as well as new hypotheses, can be tested using an alternative macrophysiological modeling approach by examining the development of endothermy during the Cenozoic. Recent mammals display a 10°C range in body temperature which is sufficiently large to identify the selective forces that have driven the development of endothermy from a plesiomorphic (ancestral) Cretaceous or Jurassic condition. A model is presented (the Plesiomorphic-Apomorphic Endothermy Model, PAE Model) which proposes that heterothermy, i.e. bouts of normothermy (constant body temperature) interspersed with adaptive heterothermy (e.g. daily torpor and/or hibernation), was the ancestral condition from which apomorphic (derived), rigid homeothermy evolved. All terrestrial mammal lineages are examined for existing data to test the model, as well as for missing data that could be used to test the model. With the exception of Scandentia and Dermoptera, about which little is known, all mammalian orders that include small-sized mammals (<500 g), have species which are heterothermic and display characteristics of endothermy which fall somewhere along a plesiomorphic-apomorphic continuum. Orders which do not have heterothermic representatives (Cetartiodactyla, Perissodactyla, Pholidota, and Lagomorpha) are comprised of medium- to large-sized mammals that have either lost the capacity for heterothermy, or in which heterothermy has yet to be measured. Mammalian heterothermy seems to be plesiomorphic and probably evolved once in the mammalian lineage. Several categories of endothermy are identified (protoendothermy, plesioendothermy, apoendothermy, basoendothermy, mesoendothermy, supraendothermy, and reversed mesoendothermy) to describe the evolution of endothermy during the Cenozoic. The PAE Model should facilitate the testing of hypotheses using a range of macrophysiological methods (e.g. the comparative method and the reconstruction of ancestral states). © 2011 The Author. Biological Reviews © 2011 Cambridge Philosophical Society.

Magmatism and Epithermal Gold-Silver Deposits of the Southern Ancestral Cascade Arc, Western Nevada and Eastern California

USGS Publications Warehouse

John, David A.; du Bray, Edward A.; Henry, Christopher D.; Vikre, Peter

2015-01-01

Many epithermal gold-silver deposits are temporally and spatially associated with late Oligocene to Pliocene magmatism of the southern ancestral Cascade arc in western Nevada and eastern California. These deposits, which include both quartz-adularia (low- and intermediate-sulfidation; Comstock Lode, Tonopah, Bodie) and quartz-alunite (high-sulfidation; Goldfield, Paradise Peak) types, were major producers of gold and silver. Ancestral Cascade arc magmatism preceded that of the modern High Cascades arc and reflects subduction of the Farallon plate beneath North America. Ancestral arc magmatism began about 45 Ma, continued until about 3 Ma, and extended from near the Canada-United States border in Washington southward to about 250 km southeast of Reno, Nevada. The ancestral arc was split into northern and southern segments across an inferred tear in the subducting slab between Mount Shasta and Lassen Peak in northern California. The southern segment extends between 42°N in northern California and 37°N in western Nevada and was active from about 30 to 3 Ma. It is bounded on the east by the northeast edge of the Walker Lane. Ancestral arc volcanism represents an abrupt change in composition and style of magmatism relative to that in central Nevada. Large volume, caldera-forming, silicic ignimbrites associated with the 37 to 19 Ma ignimbrite flareup are dominant in central Nevada, whereas volcanic centers of the ancestral arc in western Nevada consist of andesitic stratovolcanoes and dacitic to rhyolitic lava domes that mostly formed between 25 and 4 Ma. Both ancestral arc and ignimbrite flareup magmatism resulted from rollback of the shallowly dipping slab that began about 45 Ma in northeast Nevada and migrated south-southwest with time. Most southern segment ancestral arc rocks have oxidized, high potassium, calc-alkaline compositions with silica contents ranging continuously from about 55 to 77 wt%. Most lavas are porphyritic and contain coarse plagioclase ± hornblende, biotite, and pyroxene phenocrysts. Seven epithermal gold-silver deposits with >1 Moz gold production, several large elemental sulfur deposits, and many large areas (10s to >100 km2) of hydrothermally altered rocks are present in the southern ancestral arc, especially south of latitude 40°N. These deposits are principally hosted by intermediate to silicic lava dome complexes; only a few deposits are associated with mafic- to intermediate-composition stratovolcanoes. Large deposits are most abundant and well developed in volcanic fields whose evolution spanned millions of years. Most deposits are hundreds of thousands to several million years younger than their host rocks, although some quartz-alunite deposits are essentially coeval with their host rocks. Variable composition and thickness of crustal basement is the primary control on mineralization along the length of the southern ancestral arc; most deposits and large alteration zones are localized in basement rock terranes with a strong continental affinity, either along the edge of the North American craton (Goldfield, Tonopah) or in an accreted terrane with continental affinities (Walker Lake terrane; Aurora, Bodie, Comstock Lode, Paradise Peak). Epithermal deposits and quartz-alunite alteration zones are scarce to absent in the northern part of the ancestral arc above an accreted island arc (Black Rock terrane) or unknown basement rocks (Modoc Plateau). Walker Lane structures and areas that underwent large magnitude extension during the Late Cenozoic (areas with Oligocene-early Miocene volcanic rocks dipping >40°) do not provide regional control on mineralization. Instead, these features may have served as local-scale conduits for mineralizing fluids.

CEREBRA: a 3-D visualization tool for brain network extracted from fMRI data.

PubMed

Nasir, Baris; Yarman Vural, Fatos T

2016-08-01

In this paper, we introduce a new tool, CEREBRA, to visualize the 3D network of human brain, extracted from the fMRI data. The tool aims to analyze the brain connectivity by representing the selected voxels as the nodes of the network. The edge weights among the voxels are estimated by considering the relationships among the voxel time series. The tool enables the researchers to observe the active brain regions and the interactions among them by using graph theoretic measures, such as, the edge weight and node degree distributions. CEREBRA provides an interactive interface with basic display and editing options for the researchers to study their hypotheses about the connectivity of the brain network. CEREBRA interactively simplifies the network by selecting the active voxels and the most correlated edge weights. The researchers may remove the voxels and edges by using local and global thresholds selected on the window. The built-in graph reduction algorithms are then eliminate the irrelevant regions, voxels and edges and display various properties of the network. The toolbox is capable of space-time representation of the voxel time series and estimated arc weights by using the animated heat maps.

Diversification of a single ancestral gene into a successful toxin superfamily in highly venomous Australian funnel-web spiders.

PubMed

Pineda, Sandy S; Sollod, Brianna L; Wilson, David; Darling, Aaron; Sunagar, Kartik; Undheim, Eivind A B; Kely, Laurence; Antunes, Agostinho; Fry, Bryan G; King, Glenn F

2014-03-05

Spiders have evolved pharmacologically complex venoms that serve to rapidly subdue prey and deter predators. The major toxic factors in most spider venoms are small, disulfide-rich peptides. While there is abundant evidence that snake venoms evolved by recruitment of genes encoding normal body proteins followed by extensive gene duplication accompanied by explosive structural and functional diversification, the evolutionary trajectory of spider-venom peptides is less clear. Here we present evidence of a spider-toxin superfamily encoding a high degree of sequence and functional diversity that has evolved via accelerated duplication and diversification of a single ancestral gene. The peptides within this toxin superfamily are translated as prepropeptides that are posttranslationally processed to yield the mature toxin. The N-terminal signal sequence, as well as the protease recognition site at the junction of the propeptide and mature toxin are conserved, whereas the remainder of the propeptide and mature toxin sequences are variable. All toxin transcripts within this superfamily exhibit a striking cysteine codon bias. We show that different pharmacological classes of toxins within this peptide superfamily evolved under different evolutionary selection pressures. Overall, this study reinforces the hypothesis that spiders use a combinatorial peptide library strategy to evolve a complex cocktail of peptide toxins that target neuronal receptors and ion channels in prey and predators. We show that the ω-hexatoxins that target insect voltage-gated calcium channels evolved under the influence of positive Darwinian selection in an episodic fashion, whereas the κ-hexatoxins that target insect calcium-activated potassium channels appear to be under negative selection. A majority of the diversifying sites in the ω-hexatoxins are concentrated on the molecular surface of the toxins, thereby facilitating neofunctionalisation leading to new toxin pharmacology.

Intersection of opposing pedagogical frameworks: Native Hawaiian ancestral stories and scientific inquiry in a high school science class

NASA Astrophysics Data System (ADS)

Kanahele-Mossman, Huihui

Inquiry is defined as "an examination into facts and principles." In science education science inquiry is a process through which important discoveries are made by students through scientific methodology. The most important step in this process is forming the right question. The questions formed by students are usually the wrong questions which deem the remainder of the inquiry process impotent. This research will look at the pedagogy of ancestral stories for a solution. For the researcher, ancestral stories were a source of wonderment and learning not only from the lessons the stories revealed but mainly from the questions that still remained after the stories were told. Questions such as "why does the eel only swim near that part?", or "why does the story only talk about the uhu?" are examples of questions that remained after experiencing an ancestral narrative. The research questions were composed for the purpose of finding compatibility between the two pedagogies. The first research question which reads "how can Native Hawaiian ancestral stories encourage an increased level of student driven interactions at all levels of feedback from Native Hawaiian students in science classroom" focuses the research on the level of student feedback that initiate questions. Question two which reads "how can teachers of Native Hawaiian students facilitate the construction of science inquiry projects from ancestral stories" addresses the skill of the teacher and imbeds the concept of pedagogical knowledge into the literature. The last research question "how do analysis and discussion of the stories connect Native Hawaiian students to their ancestral intelligence" examines the role of identity and identity to ancestral intelligence. The method intended for this research was Grounded theory which allows the researcher to develop principles, concepts and theories based on the data presented. Another method utilized in this research is an undocumented but culturally imbedded method identified as the Native Hawaiian Research method for lack of a better title. The result of the data analysis was the development of the intersection of story and science that occurs when the story line is stripped away to reveal an interconnection of natural phenomena.

Real-time community detection in full social networks on a laptop

PubMed Central

Chamberlain, Benjamin Paul; Levy-Kramer, Josh; Humby, Clive

2018-01-01

For a broad range of research and practical applications it is important to understand the allegiances, communities and structure of key players in society. One promising direction towards extracting this information is to exploit the rich relational data in digital social networks (the social graph). As global social networks (e.g., Facebook and Twitter) are very large, most approaches make use of distributed computing systems for this purpose. Distributing graph processing requires solving many difficult engineering problems, which has lead some researchers to look at single-machine solutions that are faster and easier to maintain. In this article, we present an approach for analyzing full social networks on a standard laptop, allowing for interactive exploration of the communities in the locality of a set of user specified query vertices. The key idea is that the aggregate actions of large numbers of users can be compressed into a data structure that encapsulates the edge weights between vertices in a derived graph. Local communities can be constructed by selecting vertices that are connected to the query vertices with high edge weights in the derived graph. This compression is robust to noise and allows for interactive queries of local communities in real-time, which we define to be less than the average human reaction time of 0.25s. We achieve single-machine real-time performance by compressing the neighborhood of each vertex using minhash signatures and facilitate rapid queries through Locality Sensitive Hashing. These techniques reduce query times from hours using industrial desktop machines operating on the full graph to milliseconds on standard laptops. Our method allows exploration of strongly associated regions (i.e., communities) of large graphs in real-time on a laptop. It has been deployed in software that is actively used by social network analysts and offers another channel for media owners to monetize their data, helping them to continue to provide free services that are valued by billions of people globally. PMID:29342158

A Comparison of the Readability of Selected Instructions, Publications and Forms Commonly Used by Adults and the Minimum Literacy Level as Defined by the United States Office of Education.

ERIC Educational Resources Information Center

Beris, Carole

The Fry Readability Graph was used to assess the approximate readability level of each of 23 selected instructions, publications, and forms commonly used by adults in order to compare their readability levels with the minimum literacy level as defined by the United States Office of Education (approximately the eighth grade level). The results…

Crew Interface Analysis: Selected Articles on Space Human Factors Research, 1987 - 1991

DTIC Science & Technology

1993-07-01

recognitions to that distractor ) suggest that the perceptual type of the graph has a strong representation in memory . We found that both training with... processing strategy. If my goal were to compare the value of variables or (possibly) to compare a trend, I would select a perceptual strategy. If...be needed to determine specific processing models for different questions using the perceptual strategy. In addition, predictions about the memory

77 FR 38632 - Findings of Research Misconduct

Federal Register 2010, 2011, 2012, 2013, 2014

2012-06-28

... counts of nigrostriatal neurons in brains of several mice and rats by copying a single data file from a... Used Herbicide, Atrazine: Altered Function and Loss of Neurons in Brain Monamine Systems.'' Environ... 2004 and 2006; Falsifying a bar graph representing brain proteasomal activity, by selectively altering...

Evaluation of All-Day-Efficiency for selected flat plate and evacuated tube collectors

NASA Technical Reports Server (NTRS)

1981-01-01

An evaluation of all day efficiency for selected flat plate and evacuated tube collectors is presented. Computations are based on a modified version of the NBSIR 78-1305A procedure for all day efficiency. The ASHMET and NOAA data bases for solar insolation are discussed. Details of the algorithm used to convert total (global) horizontal radiation to the collector tilt plane of the selected sites are given along with tables and graphs which show the results of the tests performed during this evaluation.

HIV classification using the coalescent theory

PubMed Central

Bulla, Ingo; Schultz, Anne-Kathrin; Schreiber, Fabian; Zhang, Ming; Leitner, Thomas; Korber, Bette; Morgenstern, Burkhard; Stanke, Mario

2010-01-01

Motivation: Existing coalescent models and phylogenetic tools based on them are not designed for studying the genealogy of sequences like those of HIV, since in HIV recombinants with multiple cross-over points between the parental strains frequently arise. Hence, ambiguous cases in the classification of HIV sequences into subtypes and circulating recombinant forms (CRFs) have been treated with ad hoc methods in lack of tools based on a comprehensive coalescent model accounting for complex recombination patterns. Results: We developed the program ARGUS that scores classifications of sequences into subtypes and recombinant forms. It reconstructs ancestral recombination graphs (ARGs) that reflect the genealogy of the input sequences given a classification hypothesis. An ARG with maximal probability is approximated using a Markov chain Monte Carlo approach. ARGUS was able to distinguish the correct classification with a low error rate from plausible alternative classifications in simulation studies with realistic parameters. We applied our algorithm to decide between two recently debated alternatives in the classification of CRF02 of HIV-1 and find that CRF02 is indeed a recombinant of Subtypes A and G. Availability: ARGUS is implemented in C++ and the source code is available at http://gobics.de/software Contact: ibulla@uni-goettingen.de Supplementary Information: Supplementary data are available at Bioinformatics online. PMID:20400454

Node similarity within subgraphs of protein interaction networks

NASA Astrophysics Data System (ADS)

Penner, Orion; Sood, Vishal; Musso, Gabriel; Baskerville, Kim; Grassberger, Peter; Paczuski, Maya

2008-06-01

We propose a biologically motivated quantity, twinness, to evaluate local similarity between nodes in a network. The twinness of a pair of nodes is the number of connected, labeled subgraphs of size n in which the two nodes possess identical neighbours. The graph animal algorithm is used to estimate twinness for each pair of nodes (for subgraph sizes n=4 to n=12) in four different protein interaction networks (PINs). These include an Escherichia coli PIN and three Saccharomyces cerevisiae PINs - each obtained using state-of-the-art high-throughput methods. In almost all cases, the average twinness of node pairs is vastly higher than that expected from a null model obtained by switching links. For all n, we observe a difference in the ratio of type A twins (which are unlinked pairs) to type B twins (which are linked pairs) distinguishing the prokaryote E. coli from the eukaryote S. cerevisiae. Interaction similarity is expected due to gene duplication, and whole genome duplication paralogues in S. cerevisiae have been reported to co-cluster into the same complexes. Indeed, we find that these paralogous proteins are over-represented as twins compared to pairs chosen at random. These results indicate that twinness can detect ancestral relationships from currently available PIN data.

A Naturally Occurring Domestic Cat APOBEC3 Variant Confers Resistance to Feline Immunodeficiency Virus Infection.

PubMed

Yoshikawa, Rokusuke; Izumi, Taisuke; Yamada, Eri; Nakano, Yusuke; Misawa, Naoko; Ren, Fengrong; Carpenter, Michael A; Ikeda, Terumasa; Münk, Carsten; Harris, Reuben S; Miyazawa, Takayuki; Koyanagi, Yoshio; Sato, Kei

2016-01-01

Apolipoprotein B mRNA-editing enzyme catalytic polypeptide-like 3 (APOBEC3; A3) DNA cytosine deaminases can be incorporated into progeny virions and inhibit lentiviral replication. On the other hand, viral infectivity factor (Vif) of lentiviruses antagonizes A3-mediated antiviral activities by degrading A3 proteins. It is known that domestic cat (Felis catus) APOBEC3Z3 (A3Z3), the ortholog of human APOBEC3H, potently suppresses the infectivity of vif-defective feline immunodeficiency virus (FIV). Although a recent report has shown that domestic cat encodes 7 haplotypes (hap I to hap VII) of A3Z3, the relevance of A3Z3 polymorphism in domestic cats with FIV Vif has not yet been addressed. In this study, we demonstrated that these feline A3Z3 variants suppress vif-defective FIV infectivity. We also revealed that codon 65 of feline A3Z3 is a positively selected site and that A3Z3 hap V is subject to positive selection during evolution. It is particularly noteworthy that feline A3Z3 hap V is resistant to FIV Vif-mediated degradation and still inhibits vif-proficient viral infection. Moreover, the side chain size, but not the hydrophobicity, of the amino acid at position 65 determines the resistance to FIV Vif-mediated degradation. Furthermore, phylogenetic analyses have led to the inference that feline A3Z3 hap V emerged approximately 60,000 years ago. Taken together, these findings suggest that feline A3Z3 hap V may have been selected for escape from an ancestral FIV. This is the first evidence for an evolutionary "arms race" between the domestic cat and its cognate lentivirus. Gene diversity and selective pressure are intriguing topics in the field of evolutionary biology. A direct interaction between a cellular protein and a viral protein can precipitate an evolutionary arms race between host and virus. One example is primate APOBEC3G, which potently restricts the replication of primate lentiviruses (e.g., human immunodeficiency virus type 1 [HIV-1] and simian immunodeficiency virus [SIV]) if its activity is not counteracted by the viral Vif protein. Here we investigate the ability of 7 naturally occurring variants of feline APOBEC3, APOBEC3Z3 (A3Z3), to inhibit FIV replication. Interestingly, one feline A3Z3 variant is dominant, restrictive, and naturally resistant to FIV Vif-mediated degradation. Phylogenetic analyses revealed that the ancestral change that generated this variant could have been caused by positive Darwinian selection, presumably due to an ancestral FIV infection. The experimental-phylogenetic investigation sheds light on the evolutionary history of the domestic cat, which was likely influenced by lentiviral infection. Copyright © 2015 Yoshikawa et al.

Social capital and health: evidence that ancestral trust promotes health among children of immigrants.

PubMed

Ljunge, Martin

2014-12-01

This paper presents evidence that generalized trust promotes health. Children of immigrants in a broad set of European countries with ancestry from across the world are studied. Individuals are examined within country of residence using variation in trust across countries of ancestry. The approach addresses reverse causality and concerns that the trust measure picks up institutional factors in the individual's contextual setting. There is a significant positive estimate of ancestral trust in explaining self-assessed health. The finding is robust to accounting for individual, parental, and extensive ancestral country characteristics. Individuals with higher ancestral trust are also less likely to be hampered by health problems in their daily life, providing evidence of trust influencing real life outcomes. Individuals with high trust feel and act healthier, enabling a more productive life.

Modeling Olfactory Bulb Evolution through Primate Phylogeny

PubMed Central

Heritage, Steven

2014-01-01

Adaptive characterizations of primates have usually included a reduction in olfactory sensitivity. However, this inference of derivation and directionality assumes an ancestral state of olfaction, usually by comparison to a group of extant non-primate mammals. Thus, the accuracy of the inference depends on the assumed ancestral state. Here I present a phylogenetic model of continuous trait evolution that reconstructs olfactory bulb volumes for ancestral nodes of primates and mammal outgroups. Parent-daughter comparisons suggest that, relative to the ancestral euarchontan, the crown-primate node is plesiomorphic and that derived reduction in olfactory sensitivity is an attribute of the haplorhine lineage. The model also suggests a derived increase in olfactory sensitivity at the strepsirrhine node. This oppositional diversification of the strepsirrhine and haplorhine lineages from an intermediate and non-derived ancestor is inconsistent with a characterization of graded reduction through primate evolution. PMID:25426851

Couple Graph Based Label Propagation Method for Hyperspectral Remote Sensing Data Classification

NASA Astrophysics Data System (ADS)

Wang, X. P.; Hu, Y.; Chen, J.

2018-04-01

Graph based semi-supervised classification method are widely used for hyperspectral image classification. We present a couple graph based label propagation method, which contains both the adjacency graph and the similar graph. We propose to construct the similar graph by using the similar probability, which utilize the label similarity among examples probably. The adjacency graph was utilized by a common manifold learning method, which has effective improve the classification accuracy of hyperspectral data. The experiments indicate that the couple graph Laplacian which unite both the adjacency graph and the similar graph, produce superior classification results than other manifold Learning based graph Laplacian and Sparse representation based graph Laplacian in label propagation framework.

Improvement of Automated POST Case Success Rate Using Support Vector Machines

NASA Technical Reports Server (NTRS)

Zwack, Matthew R.; Dees, Patrick D.

2017-01-01

During early conceptual design of complex systems, concept down selection can have a large impact upon program life-cycle cost. Therefore, any concepts selected during early design will inherently commit program costs and affect the overall probability of program success. For this reason it is important to consider as large a design space as possible in order to better inform the down selection process. For conceptual design of launch vehicles, trajectory analysis and optimization often presents the largest obstacle to evaluating large trade spaces. This is due to the sensitivity of the trajectory discipline to changes in all other aspects of the vehicle design. Small deltas in the performance of other subsystems can result in relatively large fluctuations in the ascent trajectory because the solution space is non-linear and multi-modal [1]. In order to help capture large design spaces for new launch vehicles, the authors have performed previous work seeking to automate the execution of the industry standard tool, Program to Optimize Simulated Trajectories (POST). This work initially focused on implementation of analyst heuristics to enable closure of cases in an automated fashion, with the goal of applying the concepts of design of experiments (DOE) and surrogate modeling to enable near instantaneous throughput of vehicle cases [2]. Additional work was then completed to improve the DOE process by utilizing a graph theory based approach to connect similar design points [3]. The conclusion of the previous work illustrated the utility of the graph theory approach for completing a DOE through POST. However, this approach was still dependent upon the use of random repetitions to generate seed points for the graph. As noted in [3], only 8% of these random repetitions resulted in converged trajectories. This ultimately affects the ability of the random reps method to confidently approach the global optima for a given vehicle case in a reasonable amount of time. With only an 8% pass rate, tens or hundreds of thousands of reps may be needed to be confident that the best repetition is at least close to the global optima. However, typical design study time constraints require that fewer repetitions be attempted, sometimes resulting in seed points that have only a handful of successful completions. If a small number of successful repetitions are used to generate a seed point, the graph method may inherit some inaccuracies as it chains DOE cases from the non-global-optimal seed points. This creates inherent noise in the graph data, which can limit the accuracy of the resulting surrogate models. For this reason, the goal of this work is to improve the seed point generation method and ultimately the accuracy of the resulting POST surrogate model. The work focuses on increasing the case pass rate for seed point generation.

Euarchontan Opsin Variation Brings New Focus to Primate Origins

PubMed Central

Melin, Amanda D.; Wells, Konstans; Moritz, Gillian L.; Kistler, Logan; Orkin, Joseph D.; Timm, Robert M.; Bernard, Henry; Lakim, Maklarin B.; Perry, George H.; Kawamura, Shoji; Dominy, Nathaniel J.

2016-01-01

Debate on the adaptive origins of primates has long focused on the functional ecology of the primate visual system. For example, it is hypothesized that variable expression of short- (SWS1) and middle-to-long-wavelength sensitive (M/LWS) opsins, which confer color vision, can be used to infer ancestral activity patterns and therefore selective ecological pressures. A problem with this approach is that opsin gene variation is incompletely known in the grandorder Euarchonta, that is, the orders Scandentia (treeshrews), Dermoptera (colugos), and Primates. The ancestral state of primate color vision is therefore uncertain. Here, we report on the genes (OPN1SW and OPN1LW) that encode SWS1 and M/LWS opsins in seven species of treeshrew, including the sole nocturnal scandentian Ptilocercus lowii. In addition, we examined the opsin genes of the Central American woolly opossum (Caluromys derbianus), an enduring ecological analogue in the debate on primate origins. Our results indicate: 1) retention of ultraviolet (UV) visual sensitivity in C. derbianus and a shift from UV to blue spectral sensitivities at the base of Euarchonta; 2) ancient pseudogenization of OPN1SW in the ancestors of P. lowii, but a signature of purifying selection in those of C. derbianus; and, 3) the absence of OPN1LW polymorphism among diurnal treeshrews. These findings suggest functional variation in the color vision of nocturnal mammals and a distinctive visual ecology of early primates, perhaps one that demanded greater spatial resolution under light levels that could support cone-mediated color discrimination. PMID:26739880

Shape analysis of moss (Bryophyta) sporophytes: Insights into land plant evolution.

PubMed

Rose, Jeffrey P; Kriebel, Ricardo; Sytsma, Kenneth J

2016-04-01

The alternation of generations life cycle represents a key feature of land-plant evolution and has resulted in a diverse array of sporophyte forms and modifications in all groups of land plants. We test the hypothesis that evolution of sporangium (capsule) shape of the mosses-the second most diverse land-plant lineage-has been driven by differing physiological demands of life in diverse habitats. This study provides an important conceptual framework for analyzing the evolution of a single, homologous character in a continuous framework across a deep expanse of time, across all branches of the tree of life. We reconstruct ancestral sporangium shape and ancestral habitat on the largest phylogeny of mosses to date, and use phylogenetic generalized least squares regression to test the association between habitat and sporangium shape. In addition, we examine the association between shifts in sporangium shape and species diversification. We demonstrate that sporangium shape is convergent, under natural selection, and associated with habitat type, and that many shifts in speciation rate are associated with shifts in sporangium shape. Our results suggest that natural selection in different microhabitats results in the diversity of sporangium shape found in mosses, and that many increasing shifts in speciation rate result in changes in sporangium shape across their 480 million year history. Our framework provides a way to examine if diversification shifts in other land plants are also associated with massive changes in sporophyte form, among other morphological traits. © 2016 Botanical Society of America.

Fitness decline under osmotic stress in Caenorhabditis elegans populations subjected to spontaneous mutation accumulation at varying population sizes.

PubMed

Katju, Vaishali; Packard, Lucille B; Keightley, Peter D

2018-04-01

The consequences of mutations for population fitness depends on their individual selection coefficients and the effective population size. An earlier study of Caenorhabditis elegans spontaneous mutation accumulation lines evolved for 409 generations at three population sizes found that N e   = 1 populations declined significantly in fitness whereas the fitness of larger populations (N e   = 5, 50) was indistinguishable from the ancestral control under benign conditions. To test if larger MA populations harbor a load of cryptic deleterious mutations that are obscured under benign laboratory conditions, we measured fitness under osmotic stress via exposure to hypersaline conditions. The fitness of N e   = 1 lines exhibited a further decline under osmotic stress compared to benign conditions. However, the fitness of larger populations remained indistinguishable from that of the ancestral control. The average effects of deleterious mutations in N e   = 1 lines were estimated to be 22% for productivity and 14% for survivorship, exceeding values previously detected under benign conditions. Our results suggest that fitness decline is due to large effect mutations that are rapidly removed via selection even in small populations, with implications for conservation practices. Genetic stochasticity may not be as potent and immediate a threat to the persistence of small populations as other demographic and environmental stochastic factors. © 2018 The Author(s). Evolution © 2018 The Society for the Study of Evolution.

Multi-Centrality Graph Spectral Decompositions and Their Application to Cyber Intrusion Detection

DOE Office of Scientific and Technical Information (OSTI.GOV)

Chen, Pin-Yu; Choudhury, Sutanay; Hero, Alfred

Many modern datasets can be represented as graphs and hence spectral decompositions such as graph principal component analysis (PCA) can be useful. Distinct from previous graph decomposition approaches based on subspace projection of a single topological feature, e.g., the centered graph adjacency matrix (graph Laplacian), we propose spectral decomposition approaches to graph PCA and graph dictionary learning that integrate multiple features, including graph walk statistics, centrality measures and graph distances to reference nodes. In this paper we propose a new PCA method for single graph analysis, called multi-centrality graph PCA (MC-GPCA), and a new dictionary learning method for ensembles ofmore » graphs, called multi-centrality graph dictionary learning (MC-GDL), both based on spectral decomposition of multi-centrality matrices. As an application to cyber intrusion detection, MC-GPCA can be an effective indicator of anomalous connectivity pattern and MC-GDL can provide discriminative basis for attack classification.« less

Graphs, matrices, and the GraphBLAS: Seven good reasons

DOE PAGES

Kepner, Jeremy; Bader, David; Buluç, Aydın; ...

2015-01-01

The analysis of graphs has become increasingly important to a wide range of applications. Graph analysis presents a number of unique challenges in the areas of (1) software complexity, (2) data complexity, (3) security, (4) mathematical complexity, (5) theoretical analysis, (6) serial performance, and (7) parallel performance. Implementing graph algorithms using matrix-based approaches provides a number of promising solutions to these challenges. The GraphBLAS standard (istcbigdata.org/GraphBlas) is being developed to bring the potential of matrix based graph algorithms to the broadest possible audience. The GraphBLAS mathematically defines a core set of matrix-based graph operations that can be used to implementmore » a wide class of graph algorithms in a wide range of programming environments. This paper provides an introduction to the GraphBLAS and describes how the GraphBLAS can be used to address many of the challenges associated with analysis of graphs.« less

Network discovery with DCM

PubMed Central

Friston, Karl J.; Li, Baojuan; Daunizeau, Jean; Stephan, Klaas E.

2011-01-01

This paper is about inferring or discovering the functional architecture of distributed systems using Dynamic Causal Modelling (DCM). We describe a scheme that recovers the (dynamic) Bayesian dependency graph (connections in a network) using observed network activity. This network discovery uses Bayesian model selection to identify the sparsity structure (absence of edges or connections) in a graph that best explains observed time-series. The implicit adjacency matrix specifies the form of the network (e.g., cyclic or acyclic) and its graph-theoretical attributes (e.g., degree distribution). The scheme is illustrated using functional magnetic resonance imaging (fMRI) time series to discover functional brain networks. Crucially, it can be applied to experimentally evoked responses (activation studies) or endogenous activity in task-free (resting state) fMRI studies. Unlike conventional approaches to network discovery, DCM permits the analysis of directed and cyclic graphs. Furthermore, it eschews (implausible) Markovian assumptions about the serial independence of random fluctuations. The scheme furnishes a network description of distributed activity in the brain that is optimal in the sense of having the greatest conditional probability, relative to other networks. The networks are characterised in terms of their connectivity or adjacency matrices and conditional distributions over the directed (and reciprocal) effective connectivity between connected nodes or regions. We envisage that this approach will provide a useful complement to current analyses of functional connectivity for both activation and resting-state studies. PMID:21182971

A vision-based approach for tramway rail extraction

NASA Astrophysics Data System (ADS)

Zwemer, Matthijs H.; van de Wouw, Dennis W. J. M.; Jaspers, Egbert; Zinger, Sveta; de With, Peter H. N.

2015-03-01

The growing traffic density in cities fuels the desire for collision assessment systems on public transportation. For this application, video analysis is broadly accepted as a cornerstone. For trams, the localization of tramway tracks is an essential ingredient of such a system, in order to estimate a safety margin for crossing traffic participants. Tramway-track detection is a challenging task due to the urban environment with clutter, sharp curves and occlusions of the track. In this paper, we present a novel and generic system to detect the tramway track in advance of the tram position. The system incorporates an inverse perspective mapping and a-priori geometry knowledge of the rails to find possible track segments. The contribution of this paper involves the creation of a new track reconstruction algorithm which is based on graph theory. To this end, we define track segments as vertices in a graph, in which edges represent feasible connections. This graph is then converted to a max-cost arborescence graph, and the best path is selected according to its location and additional temporal information based on a maximum a-posteriori estimate. The proposed system clearly outperforms a railway-track detector. Furthermore, the system performance is validated on 3,600 manually annotated frames. The obtained results are promising, where straight tracks are found in more than 90% of the images and complete curves are still detected in 35% of the cases.

Adjusting protein graphs based on graph entropy.

PubMed

Peng, Sheng-Lung; Tsay, Yu-Wei

2014-01-01

Measuring protein structural similarity attempts to establish a relationship of equivalence between polymer structures based on their conformations. In several recent studies, researchers have explored protein-graph remodeling, instead of looking a minimum superimposition for pairwise proteins. When graphs are used to represent structured objects, the problem of measuring object similarity become one of computing the similarity between graphs. Graph theory provides an alternative perspective as well as efficiency. Once a protein graph has been created, its structural stability must be verified. Therefore, a criterion is needed to determine if a protein graph can be used for structural comparison. In this paper, we propose a measurement for protein graph remodeling based on graph entropy. We extend the concept of graph entropy to determine whether a graph is suitable for representing a protein. The experimental results suggest that when applied, graph entropy helps a conformational on protein graph modeling. Furthermore, it indirectly contributes to protein structural comparison if a protein graph is solid.

Adjusting protein graphs based on graph entropy

PubMed Central

2014-01-01

Measuring protein structural similarity attempts to establish a relationship of equivalence between polymer structures based on their conformations. In several recent studies, researchers have explored protein-graph remodeling, instead of looking a minimum superimposition for pairwise proteins. When graphs are used to represent structured objects, the problem of measuring object similarity become one of computing the similarity between graphs. Graph theory provides an alternative perspective as well as efficiency. Once a protein graph has been created, its structural stability must be verified. Therefore, a criterion is needed to determine if a protein graph can be used for structural comparison. In this paper, we propose a measurement for protein graph remodeling based on graph entropy. We extend the concept of graph entropy to determine whether a graph is suitable for representing a protein. The experimental results suggest that when applied, graph entropy helps a conformational on protein graph modeling. Furthermore, it indirectly contributes to protein structural comparison if a protein graph is solid. PMID:25474347

Reconstruction of the vertebrate ancestral genome reveals dynamic genome reorganization in early vertebrates.

PubMed

Nakatani, Yoichiro; Takeda, Hiroyuki; Kohara, Yuji; Morishita, Shinichi

2007-09-01

Although several vertebrate genomes have been sequenced, little is known about the genome evolution of early vertebrates and how large-scale genomic changes such as the two rounds of whole-genome duplications (2R WGD) affected evolutionary complexity and novelty in vertebrates. Reconstructing the ancestral vertebrate genome is highly nontrivial because of the difficulty in identifying traces originating from the 2R WGD. To resolve this problem, we developed a novel method capable of pinning down remains of the 2R WGD in the human and medaka fish genomes using invertebrate tunicate and sea urchin genes to define ohnologs, i.e., paralogs produced by the 2R WGD. We validated the reconstruction using the chicken genome, which was not considered in the reconstruction step, and observed that many ancestral proto-chromosomes were retained in the chicken genome and had one-to-one correspondence to chicken microchromosomes, thereby confirming the reconstructed ancestral genomes. Our reconstruction revealed a contrast between the slow karyotype evolution after the second WGD and the rapid, lineage-specific genome reorganizations that occurred in the ancestral lineages of major taxonomic groups such as teleost fishes, amphibians, reptiles, and marsupials.

Structural Identification and Comparison of Intelligent Mobile Learning Environment

ERIC Educational Resources Information Center

Upadhyay, Nitin; Agarwal, Vishnu Prakash

2007-01-01

This paper proposes a methodology using graph theory, matrix algebra and permanent function to compare different architecture (structure) design of intelligent mobile learning environment. The current work deals with the development/selection of optimum architecture (structural) model of iMLE. This can be done using the criterion as discussed in…

Recent horizontal transfer of mellifera subfamily mariner transposons into insect lineages representing four different orders shows that selection acts only during horizontal transfer.

PubMed

Lampe, David J; Witherspoon, David J; Soto-Adames, Felipe N; Robertson, Hugh M

2003-04-01

We report the isolation and sequencing of genomic copies of mariner transposons involved in recent horizontal transfers into the genomes of the European earwig, Forficula auricularia; the European honey bee, Apis mellifera; the Mediterranean fruit fly, Ceratitis capitata; and a blister beetle, Epicauta funebris, insects from four different orders. These elements are in the mellifera subfamily and are the second documented example of full-length mariner elements involved in this kind of phenomenon. We applied maximum likelihood methods to the coding sequences and determined that the copies in each genome were evolving neutrally, whereas reconstructed ancestral coding sequences appeared to be under selection, which strengthens our previous hypothesis that the primary selective constraint on mariner sequence evolution is the act of horizontal transfer between genomes.

Global diversity, population stratification, and selection of human copy number variation

PubMed Central

Sudmant, Peter H.; Mallick, Swapan; Nelson, Bradley J.; Hormozdiari, Fereydoun; Krumm, Niklas; Huddleston, John; Coe, Bradley P.; Baker, Carl; Nordenfelt, Susanne; Bamshad, Michael; Jorde, Lynn B.; Posukh, Olga L.; Sahakyan, Hovhannes; Watkins, W. Scott; Yepiskoposyan, Levon; Abdullah, M. Syafiq; Bravi, Claudio M.; Capelli, Cristian; Hervig, Tor; Wee, Joseph T. S.; Tyler-Smith, Chris; van Driem, George; Romero, Irene Gallego; Jha, Aashish R.; Karachanak-Yankova, Sena; Toncheva, Draga; Comas, David; Henn, Brenna; Kivisild, Toomas; Ruiz-Linares, Andres; Sajantila, Antti; Metspalu, Ene; Parik, Jüri; Villems, Richard; Starikovskaya, Elena B.; Ayodo, George; Beall, Cynthia M.; Di Rienzo, Anna; Hammer, Michael; Khusainova, Rita; Khusnutdinova, Elza; Klitz, William; Winkler, Cheryl; Labuda, Damian; Metspalu, Mait; Tishkoff, Sarah A.; Dryomov, Stanislav; Sukernik, Rem; Patterson, Nick; Reich, David; Eichler, Evan E.

2015-01-01

In order to explore the diversity and selective signatures of duplication and deletion human copy number variants (CNVs), we sequenced 236 individuals from 125 distinct human populations. We observed that duplications exhibit fundamentally different population genetic and selective signatures than deletions and are more likely to be stratified between human populations. Through reconstruction of the ancestral human genome, we identify megabases of DNA lost in different human lineages and pinpoint large duplications that introgressed from the extinct Denisova lineage now found at high frequency exclusively in Oceanic populations. We find that the proportion of CNV base pairs to single nucleotide variant base pairs is greater among non-Africans than it is among African populations, but we conclude that this difference is likely due to unique aspects of non-African population history as opposed to differences in CNV load. PMID:26249230

Rapid evolution in insect pests: the importance of space and time in population genomics studies.

PubMed

Pélissié, Benjamin; Crossley, Michael S; Cohen, Zachary Paul; Schoville, Sean D

2018-04-01

Pest species in agroecosystems often exhibit patterns of rapid evolution to environmental and human-imposed selection pressures. Although the role of adaptive processes is well accepted, few insect pests have been studied in detail and most research has focused on selection at insecticide resistance candidate genes. Emerging genomic datasets provide opportunities to detect and quantify selection in insect pest populations, and address long-standing questions about mechanisms underlying rapid evolutionary change. We examine the strengths of recent studies that stratify population samples both in space (along environmental gradients and comparing ancestral vs. derived populations) and in time (using chronological sampling, museum specimens and comparative phylogenomics), resulting in critical insights on evolutionary processes, and providing new directions for studying pests in agroecosystems. Copyright © 2018 Elsevier Inc. All rights reserved.

Modelling Chemical Reasoning to Predict and Invent Reactions.

PubMed

Segler, Marwin H S; Waller, Mark P

2017-05-02

The ability to reason beyond established knowledge allows organic chemists to solve synthetic problems and invent novel transformations. Herein, we propose a model that mimics chemical reasoning, and formalises reaction prediction as finding missing links in a knowledge graph. We have constructed a knowledge graph containing 14.4 million molecules and 8.2 million binary reactions, which represents the bulk of all chemical reactions ever published in the scientific literature. Our model outperforms a rule-based expert system in the reaction prediction task for 180 000 randomly selected binary reactions. The data-driven model generalises even beyond known reaction types, and is thus capable of effectively (re-)discovering novel transformations (even including transition metal-catalysed reactions). Our model enables computers to infer hypotheses about reactivity and reactions by only considering the intrinsic local structure of the graph and because each single reaction prediction is typically achieved in a sub-second time frame, the model can be used as a high-throughput generator of reaction hypotheses for reaction discovery. © 2017 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim.

OLSVis: an animated, interactive visual browser for bio-ontologies

PubMed Central

2012-01-01

Background More than one million terms from biomedical ontologies and controlled vocabularies are available through the Ontology Lookup Service (OLS). Although OLS provides ample possibility for querying and browsing terms, the visualization of parts of the ontology graphs is rather limited and inflexible. Results We created the OLSVis web application, a visualiser for browsing all ontologies available in the OLS database. OLSVis shows customisable subgraphs of the OLS ontologies. Subgraphs are animated via a real-time force-based layout algorithm which is fully interactive: each time the user makes a change, e.g. browsing to a new term, hiding, adding, or dragging terms, the algorithm performs smooth and only essential reorganisations of the graph. This assures an optimal viewing experience, because subsequent screen layouts are not grossly altered, and users can easily navigate through the graph. URL: http://ols.wordvis.com Conclusions The OLSVis web application provides a user-friendly tool to visualise ontologies from the OLS repository. It broadens the possibilities to investigate and select ontology subgraphs through a smooth visualisation method. PMID:22646023

Functional Brain Networks Develop from a “Local to Distributed” Organization

PubMed Central

Power, Jonathan D.; Dosenbach, Nico U. F.; Church, Jessica A.; Miezin, Francis M.; Schlaggar, Bradley L.; Petersen, Steven E.

2009-01-01

The mature human brain is organized into a collection of specialized functional networks that flexibly interact to support various cognitive functions. Studies of development often attempt to identify the organizing principles that guide the maturation of these functional networks. In this report, we combine resting state functional connectivity MRI (rs-fcMRI), graph analysis, community detection, and spring-embedding visualization techniques to analyze four separate networks defined in earlier studies. As we have previously reported, we find, across development, a trend toward ‘segregation’ (a general decrease in correlation strength) between regions close in anatomical space and ‘integration’ (an increased correlation strength) between selected regions distant in space. The generalization of these earlier trends across multiple networks suggests that this is a general developmental principle for changes in functional connectivity that would extend to large-scale graph theoretic analyses of large-scale brain networks. Communities in children are predominantly arranged by anatomical proximity, while communities in adults predominantly reflect functional relationships, as defined from adult fMRI studies. In sum, over development, the organization of multiple functional networks shifts from a local anatomical emphasis in children to a more “distributed” architecture in young adults. We argue that this “local to distributed” developmental characterization has important implications for understanding the development of neural systems underlying cognition. Further, graph metrics (e.g., clustering coefficients and average path lengths) are similar in child and adult graphs, with both showing “small-world”-like properties, while community detection by modularity optimization reveals stable communities within the graphs that are clearly different between young children and young adults. These observations suggest that early school age children and adults both have relatively efficient systems that may solve similar information processing problems in divergent ways. PMID:19412534

Graphs to estimate an individualized risk of breast cancer.

PubMed

Benichou, J; Gail, M H; Mulvihill, J J

1996-01-01

Clinicians who counsel women about their risk for developing breast cancer need a rapid method to estimate individualized risk (absolute risk), as well as the confidence limits around that point. The Breast Cancer Detection Demonstration Project (BCDDP) model (sometimes called the Gail model) assumes no genetic model and simultaneously incorporates five risk factors, but involves cumbersome calculations and interpolations. This report provides graphs to estimate the absolute risk of breast cancer from the BCDDP model. The BCDDP recruited 280,000 women from 1973 to 1980 who were monitored for 5 years. From this cohort, 2,852 white women developed breast cancer and 3,146 controls were selected, all with complete risk-factor information. The BCDDP model, previously developed from these data, was used to prepare graphs that relate a specific summary relative-risk estimate to the absolute risk of developing breast cancer over intervals of 10, 20, and 30 years. Once a summary relative risk is calculated, the appropriate graph is chosen that shows the 10-, 20-, or 30-year absolute risk of developing breast cancer. A separate graph gives the 95% confidence limits around the point estimate of absolute risk. Once a clinician rules out a single gene trait that predisposes to breast cancer and elicits information on age and four risk factors, the tables and figures permit an estimation of a women's absolute risk of developing breast cancer in the next three decades. These results are intended to be applied to women who undergo regular screening. They should be used only in a formal counseling program to maximize a woman's understanding of the estimates and the proper use of them.

Functional brain networks develop from a "local to distributed" organization.

PubMed

Fair, Damien A; Cohen, Alexander L; Power, Jonathan D; Dosenbach, Nico U F; Church, Jessica A; Miezin, Francis M; Schlaggar, Bradley L; Petersen, Steven E

2009-05-01

The mature human brain is organized into a collection of specialized functional networks that flexibly interact to support various cognitive functions. Studies of development often attempt to identify the organizing principles that guide the maturation of these functional networks. In this report, we combine resting state functional connectivity MRI (rs-fcMRI), graph analysis, community detection, and spring-embedding visualization techniques to analyze four separate networks defined in earlier studies. As we have previously reported, we find, across development, a trend toward 'segregation' (a general decrease in correlation strength) between regions close in anatomical space and 'integration' (an increased correlation strength) between selected regions distant in space. The generalization of these earlier trends across multiple networks suggests that this is a general developmental principle for changes in functional connectivity that would extend to large-scale graph theoretic analyses of large-scale brain networks. Communities in children are predominantly arranged by anatomical proximity, while communities in adults predominantly reflect functional relationships, as defined from adult fMRI studies. In sum, over development, the organization of multiple functional networks shifts from a local anatomical emphasis in children to a more "distributed" architecture in young adults. We argue that this "local to distributed" developmental characterization has important implications for understanding the development of neural systems underlying cognition. Further, graph metrics (e.g., clustering coefficients and average path lengths) are similar in child and adult graphs, with both showing "small-world"-like properties, while community detection by modularity optimization reveals stable communities within the graphs that are clearly different between young children and young adults. These observations suggest that early school age children and adults both have relatively efficient systems that may solve similar information processing problems in divergent ways.

Mitochondrial Capture Misleads about Ecological Speciation in the Daphnia pulex Complex

PubMed Central

Marková, Silvia; Dufresne, France; Manca, Marina; Kotlík, Petr

2013-01-01

The North American ecological species Daphnia pulicaria and Daphnia pulex are thought to have diverged from a common ancestor by adaptation to sympatric but ecologically distinct lake and pond habitats respectively. Based on mtDNA relationships, European D . pulicaria is considered a different species only distantly related to its North American counterpart, but both species share a lactate dehydrogenase (Ldh) allele F supposedly involved in lake adaptation in North America, and the same allele is also carried by the related Holarctic Daphnia tenebrosa . The correct inference of the species’ ancestral relationships is therefore critical for understanding the origin of their adaptive divergence. Our species tree inferred from unlinked nuclear loci for D . pulicaria and D . pulex resolved the European and North American D . pulicaria as sister clades, and we argue that the discordant mtDNA gene tree is best explained by capture of D . pulex mtDNA by D . pulicaria in North America. The Ldh gene tree shows that F-class alleles in D . pulicaria and D . tenebrosa are due to common descent (as opposed to introgression), with D . tenebrosa alleles paraphyletic with respect to D . pulicaria alleles. That D . tenebrosa still segregates the ancestral and derived amino acids at the two sites distinguishing the pond and lake alleles suggests that D . pulicaria inherited the derived states from the D . tenebrosa ancestry. Our results suggest that some adaptations restricting the gene flow between D . pulicaria and D . pulex might have evolved in response to selection in ancestral environments rather than in the species’ current sympatric habitats. The Arctic ( D . tenebrosa ) populations are likely to provide important clues about these issues. PMID:23869244

Divergent Ah Receptor Ligand Selectivity during Hominin Evolution

PubMed Central

Hubbard, Troy D.; Murray, Iain A.; Bisson, William H.; Sullivan, Alexis P.; Sebastian, Aswathy; Perry, George H.; Jablonski, Nina G.; Perdew, Gary H.

2016-01-01

We have identified a fixed nonsynonymous sequence difference between humans (Val381; derived variant) and Neandertals (Ala381; ancestral variant) in the ligand-binding domain of the aryl hydrocarbon receptor (AHR) gene. In an exome sequence analysis of four Neandertal and Denisovan individuals compared with nine modern humans, there are only 90 total nucleotide sites genome-wide for which archaic hominins are fixed for the ancestral nonsynonymous variant and the modern humans are fixed for the derived variant. Of those sites, only 27, including Val381 in the AHR, also have no reported variability in the human dbSNP database, further suggesting that this highly conserved functional variant is a rare event. Functional analysis of the amino acid variant Ala381 within the AHR carried by Neandertals and nonhuman primates indicate enhanced polycyclic aromatic hydrocarbon (PAH) binding, DNA binding capacity, and AHR mediated transcriptional activity compared with the human AHR. Also relative to human AHR, the Neandertal AHR exhibited 150–1000 times greater sensitivity to induction of Cyp1a1 and Cyp1b1 expression by PAHs (e.g., benzo(a)pyrene). The resulting CYP1A1/CYP1B1 enzymes are responsible for PAH first pass metabolism, which can result in the generation of toxic intermediates and perhaps AHR-associated toxicities. In contrast, the human AHR retains the ancestral sensitivity observed in primates to nontoxic endogenous AHR ligands (e.g., indole, indoxyl sulfate). Our findings reveal that a functionally significant change in the AHR occurred uniquely in humans, relative to other primates, that would attenuate the response to many environmental pollutants, including chemicals present in smoke from fire use during cooking. PMID:27486223

Study of cryogenic propellant systems for loading the space shuttle. Part 2: Hydrogen systems

NASA Technical Reports Server (NTRS)

Steward, W. G.

1975-01-01

Computer simulation studies of liquid hydrogen fill and vent systems for the space shuttle are studied. The computer programs calculate maximum and minimum permissible flow rates during cooldown as limited by thermal stress considerations, fill line cooldown time, pressure drop, flow rates, vapor content, vent line pressure drop and vent line discharge temperature. The input data for these programs are selected through graphic displays which schematically depict the part of the system being analyzed. The computed output is also displayed in the form of printed messages and graphs. Digital readouts of graph coordinates may also be obtained. Procedures are given for operation of the graphic display unit and the associated minicomputer and timesharing computer.

Characterizing Containment and Related Classes of Graphs,

DTIC Science & Technology

1985-01-01

Math . to appear. [G2] Golumbic,. Martin C., D. Rotem and J. Urrutia. "Comparability graphs and intersection graphs" Discrete Math . 43 (1983) 37-40. [G3...intersection classes of graphs" Discrete Math . to appear. [S2] Scheinerman, Edward R. Intersection Classes and Multiple Intersection Parameters of Graphs...graphs and of interval graphs" Canad. Jour. of blath. 16 (1964) 539-548. [G1] Golumbic, Martin C. "Containment graphs: and. intersection graphs" Discrete

A Collection of Features for Semantic Graphs

DOE Office of Scientific and Technical Information (OSTI.GOV)

Eliassi-Rad, T; Fodor, I K; Gallagher, B

2007-05-02

Semantic graphs are commonly used to represent data from one or more data sources. Such graphs extend traditional graphs by imposing types on both nodes and links. This type information defines permissible links among specified nodes and can be represented as a graph commonly referred to as an ontology or schema graph. Figure 1 depicts an ontology graph for data from National Association of Securities Dealers. Each node type and link type may also have a list of attributes. To capture the increased complexity of semantic graphs, concepts derived for standard graphs have to be extended. This document explains brieflymore » features commonly used to characterize graphs, and their extensions to semantic graphs. This document is divided into two sections. Section 2 contains the feature descriptions for static graphs. Section 3 extends the features for semantic graphs that vary over time.« less

Graphing the order of the sexes: constructing, recalling, interpreting, and putting the self in gender difference graphs.

PubMed

Hegarty, Peter; Lemieux, Anthony F; McQueen, Grant

2010-03-01

Graphs seem to connote facts more than words or tables do. Consequently, they seem unlikely places to spot implicit sexism at work. Yet, in 6 studies (N = 741), women and men constructed (Study 1) and recalled (Study 2) gender difference graphs with men's data first, and graphed powerful groups (Study 3) and individuals (Study 4) ahead of weaker ones. Participants who interpreted graph order as evidence of author "bias" inferred that the author graphed his or her own gender group first (Study 5). Women's, but not men's, preferences to graph men first were mitigated when participants graphed a difference between themselves and an opposite-sex friend prior to graphing gender differences (Study 6). Graph production and comprehension are affected by beliefs and suppositions about the groups represented in graphs to a greater degree than cognitive models of graph comprehension or realist models of scientific thinking have yet acknowledged.

Asymptotic Distributions of Coalescence Times and Ancestral Lineage Numbers for Populations with Temporally Varying Size

PubMed Central

Chen, Hua; Chen, Kun

2013-01-01

The distributions of coalescence times and ancestral lineage numbers play an essential role in coalescent modeling and ancestral inference. Both exact distributions of coalescence times and ancestral lineage numbers are expressed as the sum of alternating series, and the terms in the series become numerically intractable for large samples. More computationally attractive are their asymptotic distributions, which were derived in Griffiths (1984) for populations with constant size. In this article, we derive the asymptotic distributions of coalescence times and ancestral lineage numbers for populations with temporally varying size. For a sample of size n, denote by Tm the mth coalescent time, when m + 1 lineages coalesce into m lineages, and An(t) the number of ancestral lineages at time t back from the current generation. Similar to the results in Griffiths (1984), the number of ancestral lineages, An(t), and the coalescence times, Tm, are asymptotically normal, with the mean and variance of these distributions depending on the population size function, N(t). At the very early stage of the coalescent, when t → 0, the number of coalesced lineages n − An(t) follows a Poisson distribution, and as m → n, n(n−1)Tm/2N(0) follows a gamma distribution. We demonstrate the accuracy of the asymptotic approximations by comparing to both exact distributions and coalescent simulations. Several applications of the theoretical results are also shown: deriving statistics related to the properties of gene genealogies, such as the time to the most recent common ancestor (TMRCA) and the total branch length (TBL) of the genealogy, and deriving the allele frequency spectrum for large genealogies. With the advent of genomic-level sequencing data for large samples, the asymptotic distributions are expected to have wide applications in theoretical and methodological development for population genetic inference. PMID:23666939

Asymptotic distributions of coalescence times and ancestral lineage numbers for populations with temporally varying size.

PubMed

Chen, Hua; Chen, Kun

2013-07-01

The distributions of coalescence times and ancestral lineage numbers play an essential role in coalescent modeling and ancestral inference. Both exact distributions of coalescence times and ancestral lineage numbers are expressed as the sum of alternating series, and the terms in the series become numerically intractable for large samples. More computationally attractive are their asymptotic distributions, which were derived in Griffiths (1984) for populations with constant size. In this article, we derive the asymptotic distributions of coalescence times and ancestral lineage numbers for populations with temporally varying size. For a sample of size n, denote by Tm the mth coalescent time, when m + 1 lineages coalesce into m lineages, and An(t) the number of ancestral lineages at time t back from the current generation. Similar to the results in Griffiths (1984), the number of ancestral lineages, An(t), and the coalescence times, Tm, are asymptotically normal, with the mean and variance of these distributions depending on the population size function, N(t). At the very early stage of the coalescent, when t → 0, the number of coalesced lineages n - An(t) follows a Poisson distribution, and as m → n, $$n\\left(n-1\\right){T}_{m}/2N\\left(0\\right)$$ follows a gamma distribution. We demonstrate the accuracy of the asymptotic approximations by comparing to both exact distributions and coalescent simulations. Several applications of the theoretical results are also shown: deriving statistics related to the properties of gene genealogies, such as the time to the most recent common ancestor (TMRCA) and the total branch length (TBL) of the genealogy, and deriving the allele frequency spectrum for large genealogies. With the advent of genomic-level sequencing data for large samples, the asymptotic distributions are expected to have wide applications in theoretical and methodological development for population genetic inference.

System for routing messages in a vertex symmetric network by using addresses formed from permutations of the transmission line indicees

DOEpatents

Faber, Vance; Moore, James W.

1992-01-01

A network of interconnected processors is formed from a vertex symmetric graph selected from graphs .GAMMA..sub.d (k) with degree d, diameter k, and (d+1)!/(d-k+1)! processors for each d.gtoreq.k and .GAMMA..sub.d (k,-1) with degree 3-1, diameter k+1, and (d+1)!/(d-k+1)! processors for each d.gtoreq.k.gtoreq.4. Each processor has an address formed by one of the permutations from a predetermined sequence of letters chosen a selected number of letters at a time, and an extended address formed by appending to the address the remaining ones of the predetermined sequence of letters. A plurality of transmission channels is provided from each of the processors, where each processor has one less channel than the selected number of letters forming the sequence. Where a network .GAMMA..sub.d (k,-1) is provided, no processor has a channel connected to form an edge in a direction .delta..sub.1. Each of the channels has an identification number selected from the sequence of letters and connected from a first processor having a first extended address to a second processor having a second address formed from a second extended address defined by moving to the front of the first extended address the letter found in the position within the first extended address defined by the channel identification number. The second address is then formed by selecting the first elements of the second extended address corresponding to the selected number used to form the address permutations.

The ancestral flower of angiosperms and its early diversification

PubMed Central

Sauquet, Hervé; von Balthazar, Maria; Magallón, Susana; Doyle, James A.; Endress, Peter K.; Bailes, Emily J.; Barroso de Morais, Erica; Bull-Hereñu, Kester; Carrive, Laetitia; Chartier, Marion; Chomicki, Guillaume; Coiro, Mario; Cornette, Raphaël; El Ottra, Juliana H. L.; Epicoco, Cyril; Foster, Charles S. P.; Jabbour, Florian; Haevermans, Agathe; Haevermans, Thomas; Hernández, Rebeca; Little, Stefan A.; Löfstrand, Stefan; Luna, Javier A.; Massoni, Julien; Nadot, Sophie; Pamperl, Susanne; Prieu, Charlotte; Reyes, Elisabeth; dos Santos, Patrícia; Schoonderwoerd, Kristel M.; Sontag, Susanne; Soulebeau, Anaëlle; Staedler, Yannick; Tschan, Georg F.; Wing-Sze Leung, Amy; Schönenberger, Jürg

2017-01-01

Recent advances in molecular phylogenetics and a series of important palaeobotanical discoveries have revolutionized our understanding of angiosperm diversification. Yet, the origin and early evolution of their most characteristic feature, the flower, remains poorly understood. In particular, the structure of the ancestral flower of all living angiosperms is still uncertain. Here we report model-based reconstructions for ancestral flowers at the deepest nodes in the phylogeny of angiosperms, using the largest data set of floral traits ever assembled. We reconstruct the ancestral angiosperm flower as bisexual and radially symmetric, with more than two whorls of three separate perianth organs each (undifferentiated tepals), more than two whorls of three separate stamens each, and more than five spirally arranged separate carpels. Although uncertainty remains for some of the characters, our reconstruction allows us to propose a new plausible scenario for the early diversification of flowers, leading to new testable hypotheses for future research on angiosperms. PMID:28763051

Experimental evidence needed to demonstrate inter- and trans-generational effects of ancestral experiences in mammals.

PubMed

Dias, Brian G; Ressler, Kerry J

2014-10-01

Environmental factors routinely influence an organism's biology. The inheritance or transmission of such influences to descendant generations would be an efficient mode of information transfer across generations. The developmental stage at which a specific environment is encountered by the ancestral generation, and the number of generations over which information about that environment is registered, determines an inter- vs. trans-generational effect of ancestral influence. This commentary will outline the distinction between these influences. While seductive in principle, inter- and trans-generational inheritance in mammals is a hotly debated area of research inquiry. We present constructive criticism of such inheritance, and suggest potential experimental avenues for reconciliation. Finally, epigenetic mechanisms present an avenue for gene regulation that is dynamic. We briefly discuss how such malleability affords the potential for a reversal of any detrimental environmental influences that might have adversely impacted ancestral or descendant generations. © 2014 WILEY Periodicals, Inc.

Graphing with "LogoWriter."

ERIC Educational Resources Information Center

Yoder, Sharon K.

This book discusses four kinds of graphs that are taught in mathematics at the middle school level: pictographs, bar graphs, line graphs, and circle graphs. The chapters on each of these types of graphs contain information such as starting, scaling, drawing, labeling, and finishing the graphs using "LogoWriter." The final chapter of the…

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zhang, Fangyan; Zhang, Song; Chung Wong, Pak

Effectively visualizing large graphs and capturing the statistical properties are two challenging tasks. To aid in these two tasks, many sampling approaches for graph simplification have been proposed, falling into three categories: node sampling, edge sampling, and traversal-based sampling. It is still unknown which approach is the best. We evaluate commonly used graph sampling methods through a combined visual and statistical comparison of graphs sampled at various rates. We conduct our evaluation on three graph models: random graphs, small-world graphs, and scale-free graphs. Initial results indicate that the effectiveness of a sampling method is dependent on the graph model, themore » size of the graph, and the desired statistical property. This benchmark study can be used as a guideline in choosing the appropriate method for a particular graph sampling task, and the results presented can be incorporated into graph visualization and analysis tools.« less

Reconstruction of Ancestral Genomes in Presence of Gene Gain and Loss.

PubMed

Avdeyev, Pavel; Jiang, Shuai; Aganezov, Sergey; Hu, Fei; Alekseyev, Max A

2016-03-01

Since most dramatic genomic changes are caused by genome rearrangements as well as gene duplications and gain/loss events, it becomes crucial to understand their mechanisms and reconstruct ancestral genomes of the given genomes. This problem was shown to be NP-complete even in the "simplest" case of three genomes, thus calling for heuristic rather than exact algorithmic solutions. At the same time, a larger number of input genomes may actually simplify the problem in practice as it was earlier illustrated with MGRA, a state-of-the-art software tool for reconstruction of ancestral genomes of multiple genomes. One of the key obstacles for MGRA and other similar tools is presence of breakpoint reuses when the same breakpoint region is broken by several different genome rearrangements in the course of evolution. Furthermore, such tools are often limited to genomes composed of the same genes with each gene present in a single copy in every genome. This limitation makes these tools inapplicable for many biological datasets and degrades the resolution of ancestral reconstructions in diverse datasets. We address these deficiencies by extending the MGRA algorithm to genomes with unequal gene contents. The developed next-generation tool MGRA2 can handle gene gain/loss events and shares the ability of MGRA to reconstruct ancestral genomes uniquely in the case of limited breakpoint reuse. Furthermore, MGRA2 employs a number of novel heuristics to cope with higher breakpoint reuse and process datasets inaccessible for MGRA. In practical experiments, MGRA2 shows superior performance for simulated and real genomes as compared to other ancestral genome reconstruction tools.

An algorithm for finding a similar subgraph of all Hamiltonian cycles

NASA Astrophysics Data System (ADS)

Wafdan, R.; Ihsan, M.; Suhaimi, D.

2018-01-01

This paper discusses an algorithm to find a similar subgraph called findSimSubG algorithm. A similar subgraph is a subgraph with a maximum number of edges, contains no isolated vertex and is contained in every Hamiltonian cycle of a Hamiltonian Graph. The algorithm runs only on Hamiltonian graphs with at least two Hamiltonian cycles. The algorithm works by examining whether the initial subgraph of the first Hamiltonian cycle is a subgraph of comparison graphs. If the initial subgraph is not in comparison graphs, the algorithm will remove edges and vertices of the initial subgraph that are not in comparison graphs. There are two main processes in the algorithm, changing Hamiltonian cycle into a cycle graph and removing edges and vertices of the initial subgraph that are not in comparison graphs. The findSimSubG algorithm can find the similar subgraph without using backtracking method. The similar subgraph cannot be found on certain graphs, such as an n-antiprism graph, complete bipartite graph, complete graph, 2n-crossed prism graph, n-crown graph, n-möbius ladder, prism graph, and wheel graph. The complexity of this algorithm is O(m|V|), where m is the number of Hamiltonian cycles and |V| is the number of vertices of a Hamiltonian graph.

Mathematical foundations of the GraphBLAS

DOE PAGES

Kepner, Jeremy; Aaltonen, Peter; Bader, David; ...

2016-12-01

The GraphBLAS standard (GraphBlas.org) is being developed to bring the potential of matrix-based graph algorithms to the broadest possible audience. Mathematically, the GraphBLAS defines a core set of matrix-based graph operations that can be used to implement a wide class of graph algorithms in a wide range of programming environments. This study provides an introduction to the mathematics of the GraphBLAS. Graphs represent connections between vertices with edges. Matrices can represent a wide range of graphs using adjacency matrices or incidence matrices. Adjacency matrices are often easier to analyze while incidence matrices are often better for representing data. Fortunately, themore » two are easily connected by matrix multiplication. A key feature of matrix mathematics is that a very small number of matrix operations can be used to manipulate a very wide range of graphs. This composability of a small number of operations is the foundation of the GraphBLAS. A standard such as the GraphBLAS can only be effective if it has low performance overhead. Finally, performance measurements of prototype GraphBLAS implementations indicate that the overhead is low.« less

Fast ancestral gene order reconstruction of genomes with unequal gene content.

PubMed

Feijão, Pedro; Araujo, Eloi

2016-11-11

During evolution, genomes are modified by large scale structural events, such as rearrangements, deletions or insertions of large blocks of DNA. Of particular interest, in order to better understand how this type of genomic evolution happens, is the reconstruction of ancestral genomes, given a phylogenetic tree with extant genomes at its leaves. One way of solving this problem is to assume a rearrangement model, such as Double Cut and Join (DCJ), and find a set of ancestral genomes that minimizes the number of events on the input tree. Since this problem is NP-hard for most rearrangement models, exact solutions are practical only for small instances, and heuristics have to be used for larger datasets. This type of approach can be called event-based. Another common approach is based on finding conserved structures between the input genomes, such as adjacencies between genes, possibly also assigning weights that indicate a measure of confidence or probability that this particular structure is present on each ancestral genome, and then finding a set of non conflicting adjacencies that optimize some given function, usually trying to maximize total weight and minimizing character changes in the tree. We call this type of methods homology-based. In previous work, we proposed an ancestral reconstruction method that combines homology- and event-based ideas, using the concept of intermediate genomes, that arise in DCJ rearrangement scenarios. This method showed better rate of correctly reconstructed adjacencies than other methods, while also being faster, since the use of intermediate genomes greatly reduces the search space. Here, we generalize the intermediate genome concept to genomes with unequal gene content, extending our method to account for gene insertions and deletions of any length. In many of the simulated datasets, our proposed method had better results than MLGO and MGRA, two state-of-the-art algorithms for ancestral reconstruction with unequal gene content, while running much faster, making it more scalable to larger datasets. Studing ancestral reconstruction problems under a new light, using the concept of intermediate genomes, allows the design of very fast algorithms by greatly reducing the solution search space, while also giving very good results. The algorithms introduced in this paper were implemented in an open-source software called RINGO (ancestral Reconstruction with INtermediate GenOmes), available at https://github.com/pedrofeijao/RINGO .

Supercomputer Environments

DTIC Science & Technology

1990-01-09

data structures can easily be presented to the user interface. An emphasis of the Graph Browser was the realization of graph views and graph animation ... animation of the graph. Anima- tion of the graph includes changing node shapes, changing node and arc colors, changing node and arc text, and making...many graphs tend to be tree-like. Animtion of a graph is a useful feature. One of the primary goals of GMB was to support animated graphs. For animation

Probing Factors Influencing Students' Graph Comprehension Regarding Four Operations in Kinematics Graphs

ERIC Educational Resources Information Center

Phage, Itumeleng B.; Lemmer, Miriam; Hitge, Mariette

2017-01-01

Students' graph comprehension may be affected by the background of the students who are the readers or interpreters of the graph, their knowledge of the context in which the graph is set, and the inferential processes required by the graph operation. This research study investigated these aspects of graph comprehension for 152 first year…

A graph edit dictionary for correcting errors in roof topology graphs reconstructed from point clouds

NASA Astrophysics Data System (ADS)

Xiong, B.; Oude Elberink, S.; Vosselman, G.

2014-07-01

In the task of 3D building model reconstruction from point clouds we face the problem of recovering a roof topology graph in the presence of noise, small roof faces and low point densities. Errors in roof topology graphs will seriously affect the final modelling results. The aim of this research is to automatically correct these errors. We define the graph correction as a graph-to-graph problem, similar to the spelling correction problem (also called the string-to-string problem). The graph correction is more complex than string correction, as the graphs are 2D while strings are only 1D. We design a strategy based on a dictionary of graph edit operations to automatically identify and correct the errors in the input graph. For each type of error the graph edit dictionary stores a representative erroneous subgraph as well as the corrected version. As an erroneous roof topology graph may contain several errors, a heuristic search is applied to find the optimum sequence of graph edits to correct the errors one by one. The graph edit dictionary can be expanded to include entries needed to cope with errors that were previously not encountered. Experiments show that the dictionary with only fifteen entries already properly corrects one quarter of erroneous graphs in about 4500 buildings, and even half of the erroneous graphs in one test area, achieving as high as a 95% acceptance rate of the reconstructed models.

Comparative Genomics of Facultative Bacterial Symbionts Isolated from European Orius Species Reveals an Ancestral Symbiotic Association

PubMed Central

Chen, Xiaorui; Hitchings, Matthew D.; Mendoza, José E.; Balanza, Virginia; Facey, Paul D.; Dyson, Paul J.; Bielza, Pablo; Del Sol, Ricardo

2017-01-01

Pest control in agriculture employs diverse strategies, among which the use of predatory insects has steadily increased. The use of several species within the genus Orius in pest control is widely spread, particularly in Mediterranean Europe. Commercial mass rearing of predatory insects is costly, and research efforts have concentrated on diet manipulation and selective breeding to reduce costs and improve efficacy. The characterisation and contribution of microbial symbionts to Orius sp. fitness, behaviour, and potential impact on human health has been neglected. This paper provides the first genome sequence level description of the predominant culturable facultative bacterial symbionts associated with five Orius species (O. laevigatus, O. niger, O. pallidicornis, O. majusculus, and O. albidipennis) from several geographical locations. Two types of symbionts were broadly classified as members of the genera Serratia and Leucobacter, while a third constitutes a new genus within the Erwiniaceae. These symbionts were found to colonise all the insect specimens tested, which evidenced an ancestral symbiotic association between these bacteria and the genus Orius. Pangenome analyses of the Serratia sp. isolates offered clues linking Type VI secretion system effector–immunity proteins from the Tai4 sub-family to the symbiotic lifestyle. PMID:29067021

Genomic reconstruction of the history of extant populations of India reveals five distinct ancestral components and a complex structure

PubMed Central

Basu, Analabha; Sarkar-Roy, Neeta; Majumder, Partha P.

2016-01-01

India, occupying the center stage of Paleolithic and Neolithic migrations, has been underrepresented in genome-wide studies of variation. Systematic analysis of genome-wide data, using multiple robust statistical methods, on (i) 367 unrelated individuals drawn from 18 mainland and 2 island (Andaman and Nicobar Islands) populations selected to represent geographic, linguistic, and ethnic diversities, and (ii) individuals from populations represented in the Human Genome Diversity Panel (HGDP), reveal four major ancestries in mainland India. This contrasts with an earlier inference of two ancestries based on limited population sampling. A distinct ancestry of the populations of Andaman archipelago was identified and found to be coancestral to Oceanic populations. Analysis of ancestral haplotype blocks revealed that extant mainland populations (i) admixed widely irrespective of ancestry, although admixtures between populations was not always symmetric, and (ii) this practice was rapidly replaced by endogamy about 70 generations ago, among upper castes and Indo-European speakers predominantly. This estimated time coincides with the historical period of formulation and adoption of sociocultural norms restricting intermarriage in large social strata. A similar replacement observed among tribal populations was temporally less uniform. PMID:26811443

Coos, booms, and hoots: The evolution of closed-mouth vocal behavior in birds.

PubMed

Riede, Tobias; Eliason, Chad M; Miller, Edward H; Goller, Franz; Clarke, Julia A

2016-08-01

Most birds vocalize with an open beak, but vocalization with a closed beak into an inflating cavity occurs in territorial or courtship displays in disparate species throughout birds. Closed-mouth vocalizations generate resonance conditions that favor low-frequency sounds. By contrast, open-mouth vocalizations cover a wider frequency range. Here we describe closed-mouth vocalizations of birds from functional and morphological perspectives and assess the distribution of closed-mouth vocalizations in birds and related outgroups. Ancestral-state optimizations of body size and vocal behavior indicate that closed-mouth vocalizations are unlikely to be ancestral in birds and have evolved independently at least 16 times within Aves, predominantly in large-bodied lineages. Closed-mouth vocalizations are rare in the small-bodied passerines. In light of these results and body size trends in nonavian dinosaurs, we suggest that the capacity for closed-mouth vocalization was present in at least some extinct nonavian dinosaurs. As in birds, this behavior may have been limited to sexually selected vocal displays, and hence would have co-occurred with open-mouthed vocalizations. © 2016 The Author(s). Evolution © 2016 The Society for the Study of Evolution.

Genome-Wide Identification of the Mutation Underlying Fleece Variation and Discriminating Ancestral Hairy Species from Modern Woolly Sheep

PubMed Central

Cano, Margarita; Drouilhet, Laurence; Plisson-Petit, Florence; Bardou, Philippe; Fabre, Stéphane; Servin, Bertrand; Sarry, Julien; Woloszyn, Florent; Mulsant, Philippe; Foulquier, Didier; Carrière, Fabien; Aletru, Mathias; Rodde, Nathalie; Cauet, Stéphane; Bouchez, Olivier; Pirson, Maarten; Tosser-Klopp, Gwenola; Allain, Daniel

2017-01-01

Abstract The composition and structure of fleece variation observed in mammals is a consequence of a strong selective pressure for fiber production after domestication. In sheep, fleece variation discriminates ancestral species carrying a long and hairy fleece from modern domestic sheep (Ovis aries) owning a short and woolly fleece. Here, we report that the “woolly” allele results from the insertion of an antisense EIF2S2 retrogene (called asEIF2S2) into the 3′ UTR of the IRF2BP2 gene leading to an abnormal IRF2BP2 transcript. We provide evidence that this chimeric IRF2BP2/asEIF2S2 messenger 1) targets the genuine sense EIF2S2 RNA and 2) creates a long endogenous double-stranded RNA which alters the expression of both EIF2S2 and IRF2BP2 mRNA. This represents a unique example of a phenotype arising via a RNA-RNA hybrid, itself generated through a retroposition mechanism. Our results bring new insights on the sheep population history thanks to the identification of the molecular origin of an evolutionary phenotypic variation. PMID:28379502

Endangered Species Hold Clues to Human Evolution

PubMed Central

Bejerano, Gill; Salama, Sofie R.; Haussler, David

2010-01-01

We report that 18 conserved, and by extension functional, elements in the human genome are the result of retroposon insertions that are evolving under purifying selection in mammals. We show evidence that 1 of the 18 elements regulates the expression of ASXL3 during development by encoding an alternatively spliced exon that causes nonsense-mediated decay of the transcript. The retroposon that gave rise to these functional elements was quickly inactivated in the mammalian ancestor, and all traces of it have been lost due to neutral decay. However, the tuatara has maintained a near-ancestral version of this retroposon in its extant genome, which allows us to connect the 18 human elements to the evolutionary events that created them. We propose that conservation efforts over more than 100 years may not have only prevented the tuatara from going extinct but could have preserved our ability to understand the evolutionary history of functional elements in the human genome. Through simulations, we argue that species with historically low population sizes are more likely to harbor ancient mobile elements for long periods of time and in near-ancestral states, making these species indispensable in understanding the evolutionary origin of functional elements in the human genome. PMID:20332163

Derived immune and ancestral pigmentation alleles in a 7,000-year-old Mesolithic European.

PubMed

Olalde, Iñigo; Allentoft, Morten E; Sánchez-Quinto, Federico; Santpere, Gabriel; Chiang, Charleston W K; DeGiorgio, Michael; Prado-Martinez, Javier; Rodríguez, Juan Antonio; Rasmussen, Simon; Quilez, Javier; Ramírez, Oscar; Marigorta, Urko M; Fernández-Callejo, Marcos; Prada, María Encina; Encinas, Julio Manuel Vidal; Nielsen, Rasmus; Netea, Mihai G; Novembre, John; Sturm, Richard A; Sabeti, Pardis; Marquès-Bonet, Tomàs; Navarro, Arcadi; Willerslev, Eske; Lalueza-Fox, Carles

2014-03-13

Ancient genomic sequences have started to reveal the origin and the demographic impact of farmers from the Neolithic period spreading into Europe. The adoption of farming, stock breeding and sedentary societies during the Neolithic may have resulted in adaptive changes in genes associated with immunity and diet. However, the limited data available from earlier hunter-gatherers preclude an understanding of the selective processes associated with this crucial transition to agriculture in recent human evolution. Here we sequence an approximately 7,000-year-old Mesolithic skeleton discovered at the La Braña-Arintero site in León, Spain, to retrieve a complete pre-agricultural European human genome. Analysis of this genome in the context of other ancient samples suggests the existence of a common ancient genomic signature across western and central Eurasia from the Upper Paleolithic to the Mesolithic. The La Braña individual carries ancestral alleles in several skin pigmentation genes, suggesting that the light skin of modern Europeans was not yet ubiquitous in Mesolithic times. Moreover, we provide evidence that a significant number of derived, putatively adaptive variants associated with pathogen resistance in modern Europeans were already present in this hunter-gatherer.

Genetic Ancestry for Sleep Research: Leveraging Health Inequalities to Identify Causal Genetic Variants.

PubMed

Prasad, Bharati; Saxena, Richa; Goel, Namni; Patel, Sanjay R

2018-06-01

Recent evidence has highlighted the health inequalities in sleep behaviors and sleep disorders that adversely affect outcomes in select populations, including African-American and Hispanic-American subjects. Race-related sleep health inequalities are ascribed to differences in multilevel and interlinked health determinants, such as sociodemographic factors, health behaviors, and biology. African-American and Hispanic-American subjects are admixed populations whose genetic inheritance combines two or more ancestral populations originating from different continents. Racial inequalities in admixed populations can be parsed into relevant groups of mediating factors (environmental vs genetic) with the use of measures of genetic ancestry, including the proportion of an individual's genetic makeup that comes from each of the major ancestral continental populations. This review describes sleep health inequalities in African-American and Hispanic-American subjects and considers the potential utility of ancestry studies to exploit these differences to gain insight into the genetic underpinnings of these phenotypes. The inclusion of genetic approaches in future studies of admixed populations will allow greater understanding of the potential biological basis of race-related sleep health inequalities. Copyright © 2018 American College of Chest Physicians. Published by Elsevier Inc. All rights reserved.

Non-parallel coevolution of sender and receiver in the acoustic communication system of treefrogs.

PubMed

Schul, Johannes; Bush, Sarah L

2002-09-07

Advertisement calls of closely related species often differ in quantitative features such as the repetition rate of signal units. These differences are important in species recognition. Current models of signal-receiver coevolution predict two possible patterns in the evolution of the mechanism used by receivers to recognize the call: (i) classical sexual selection models (Fisher process, good genes/indirect benefits, direct benefits models) predict that close relatives use qualitatively similar signal recognition mechanisms tuned to different values of a call parameter; and (ii) receiver bias models (hidden preference, pre-existing bias models) predict that if different signal recognition mechanisms are used by sibling species, evidence of an ancestral mechanism will persist in the derived species, and evidence of a pre-existing bias will be detectable in the ancestral species. We describe qualitatively different call recognition mechanisms in sibling species of treefrogs. Whereas Hyla chrysoscelis uses pulse rate to recognize male calls, Hyla versicolor uses absolute measurements of pulse duration and interval duration. We found no evidence of either hidden preferences or pre-existing biases. The results are compared with similar data from katydids (Tettigonia sp.). In both taxa, the data are not adequately explained by current models of signal-receiver coevolution.

Indigenous ancestral sayings contribute to modern conservation partnerships: examples using Phormium tenax.

PubMed

Wehi, Priscilla M

2009-01-01

Traditional ecological knowledge (TEK) is central to indigenous worldviews and practices and is one of the most important contributions that indigenous people can bring to conservation management partnerships. However, researchers and managers may have difficulty accessing such knowledge, particularly where knowledge transmission has been damaged. A new methodological approach analyzes ancestral sayings from Maori oral traditions for ecological information about Phormium tenax, a plant with high cultural value that is a dominant component in many threatened wetland systems, and frequently used in restoration plantings in New Zealand. Maori ancestral sayings record an association with nectar-feeding native parrots that has only rarely been reported, as well as indications of important environmental parameters (rainfall and drought) for this species. These sayings provide evidence of indigenous management that has not been reported from interviews with elders, including evidence of fire use to create Phormium cultivations. TEK in Maori ancestral sayings imply landscape-scale processes in comparison to intensive, small-scale management methods often reported in interviews. TEK in ancestral sayings can be used to generate new scientific hypotheses, negotiate collaborative pathways, and identify ecological management strategies that support biodiversity retention. TEK can inform restoration ecology, historical ecology, and conservation management of species and ecosystems, especially where data from pollen records and archaeological artifacts are incomplete.

Shared Subgenome Dominance Following Polyploidization Explains Grass Genome Evolutionary Plasticity from a Seven Protochromosome Ancestor with 16K Protogenes

PubMed Central

Murat, Florent; Zhang, Rongzhi; Guizard, Sébastien; Flores, Raphael; Armero, Alix; Pont, Caroline; Steinbach, Delphine; Quesneville, Hadi; Cooke, Richard; Salse, Jerome

2013-01-01

Modern plant genomes are diploidized paleopolyploids. We revisited grass genome paleohistory in response to the diploidization process through a detailed investigation of the evolutionary fate of duplicated blocks. Ancestrally duplicated genes can be conserved, deleted, and shuffled, defining dominant (bias toward duplicate retention) and sensitive (bias toward duplicate erosion) chromosomal fragments. We propose a new grass genome paleohistory deriving from an ancestral karyotype structured in seven protochromosomes containing 16,464 protogenes and following evolutionary rules where 1) ancestral shared polyploidizations shaped conserved dominant (D) and sensitive (S) subgenomes, 2) subgenome dominance is revealed by both gene deletion and shuffling from the S blocks, 3) duplicate deletion/movement may have been mediated by single-/double-stranded illegitimate recombination mechanisms, 4) modern genomes arose through centromeric fusion of protochromosomes, leading to functional monocentric neochromosomes, 5) the fusion of two dominant blocks leads to supradominant neochromosomes (D + D = D) with higher ancestral gene retention compared with D + S = D (i.e., fusion of blocks with opposite sensitivity) or even S + S = S (i.e., fusion of two sensitive ancestral blocks). A new user-friendly online tool named “PlantSyntenyViewer,” available at http://urgi.versailles.inra.fr/synteny-cereal, presents the refined comparative genomics data. PMID:24317974

Deciphering the Diploid Ancestral Genome of the Mesohexaploid Brassica rapa[C][W

PubMed Central

Cheng, Feng; Mandáková, Terezie; Wu, Jian; Xie, Qi; Lysak, Martin A.; Wang, Xiaowu

2013-01-01

The genus Brassica includes several important agricultural and horticultural crops. Their current genome structures were shaped by whole-genome triplication followed by extensive diploidization. The availability of several crucifer genome sequences, especially that of Chinese cabbage (Brassica rapa), enables study of the evolution of the mesohexaploid Brassica genomes from their diploid progenitors. We reconstructed three ancestral subgenomes of B. rapa (n = 10) by comparing its whole-genome sequence to ancestral and extant Brassicaceae genomes. All three B. rapa paleogenomes apparently consisted of seven chromosomes, similar to the ancestral translocation Proto-Calepineae Karyotype (tPCK; n = 7), which is the evolutionarily younger variant of the Proto-Calepineae Karyotype (n = 7). Based on comparative analysis of genome sequences or linkage maps of Brassica oleracea, Brassica nigra, radish (Raphanus sativus), and other closely related species, we propose a two-step merging of three tPCK-like genomes to form the hexaploid ancestor of the tribe Brassiceae with 42 chromosomes. Subsequent diversification of the Brassiceae was marked by extensive genome reshuffling and chromosome number reduction mediated by translocation events and followed by loss and/or inactivation of centromeres. Furthermore, via interspecies genome comparison, we refined intervals for seven of the genomic blocks of the Ancestral Crucifer Karyotype (n = 8), thus revising the key reference genome for evolutionary genomics of crucifers. PMID:23653472

Kids in Korea: Comparing Students from Different Cultures.

ERIC Educational Resources Information Center

Fitzhugh, William P.

In a series of activities, intermediate grade students display data from a questionnaire completed by a selected class of Korean elementary school students. The students complete the same questionnaire. They tally results from both questionnaires and display data in an appropriate form: a graph or a Venn diagram. They compare the responses from…

The Health of Children--1970: Selected Data From the National Center for Health Statistics.

ERIC Educational Resources Information Center

National Center for Health Statistics (DHEW/PHS), Hyattsville, MD.

In this booklet, charts and graphs present data from four divisions of the National Center for Health Statistics. The divisions represented are those concerned with vital statistics (births, deaths, fetal deaths, marriages and divorces); health interview statistics (information on health and demographic factors related to illness); health…

Submarine Periscope Depth Course Selection Tactical Decision Aid

DTIC Science & Technology

1997-12-01

are translated to Cartesian coordinates. Co is own ship’s course. 8 X0 = DMho. cos(Co) Yo = DAho . sin(Co) Xc = DMht- cos(Ct) Yc = DMhbt sin(Ct) These...Display Graph. The input parameters of DAho , Ct, and DMiht along with Co as generated by the simulation are used to determine the Cartesian

The Effects of Observation Errors on the Attack Vulnerability of Complex Networks

DTIC Science & Technology

2012-11-01

more detail, to construct a true network we select a topology (erdos- renyi (Erdos & Renyi , 1959), scale-free (Barabási & Albert, 1999), small world...Efficiency of Scale-Free Networks: Error and Attack Tolerance. Physica A, Volume 320, pp. 622-642. 6. Erdos, P. & Renyi , A., 1959. On Random Graphs, I

Neural network-based retrieval from software reuse repositories

NASA Technical Reports Server (NTRS)

Eichmann, David A.; Srinivas, Kankanahalli

1992-01-01

A significant hurdle confronts the software reuser attempting to select candidate components from a software repository - discriminating between those components without resorting to inspection of the implementation(s). We outline an approach to this problem based upon neural networks which avoids requiring the repository administrators to define a conceptual closeness graph for the classification vocabulary.

Statistical Bulletin: Annual Report On Economic Indicators, 1979.

ERIC Educational Resources Information Center

American Samoa Development Planning Office, Pago Pago.

Designed to serve as the basis for systematic collection of statistical information for government and the private sector, this bulletin presents a wide variety of economic indicators in tabular form. The data, selected to facilitate government and private planning efforts, are displayed in 25 tables and 27 graphs. Information is organized under…

Comparison and Enumeration of Chemical Graphs

PubMed Central

Akutsu, Tatsuya; Nagamochi, Hiroshi

2013-01-01

Chemical compounds are usually represented as graph structured data in computers. In this review article, we overview several graph classes relevant to chemical compounds and the computational complexities of several fundamental problems for these graph classes. In particular, we consider the following problems: determining whether two chemical graphs are identical, determining whether one input chemical graph is a part of the other input chemical graph, finding a maximum common part of two input graphs, finding a reaction atom mapping, enumerating possible chemical graphs, and enumerating stereoisomers. We also discuss the relationship between the fifth problem and kernel functions for chemical compounds. PMID:24688697

A Selectivity based approach to Continuous Pattern Detection in Streaming Graphs

DOE Office of Scientific and Technical Information (OSTI.GOV)

Choudhury, Sutanay; Holder, Larry; Chin, George

2015-02-02

Cyber security is one of the most significant technical challenges in current times. Detecting adversarial activities, prevention of theft of intellectual properties and customer data is a high priority for corporations and government agencies around the world. Cyber defenders need to analyze massive-scale, high-resolution network flows to identify, categorize, and mitigate attacks involving net- works spanning institutional and national boundaries. Many of the cyber attacks can be described as subgraph patterns, with promi- nent examples being insider infiltrations (path queries), denial of service (parallel paths) and malicious spreads (tree queries). This motivates us to explore subgraph matching on streaming graphsmore » in a continuous setting. The novelty of our work lies in using the subgraph distributional statistics collected from the streaming graph to determine the query processing strategy. We introduce a “Lazy Search" algorithm where the search strategy is decided on a vertex-to-vertex basis depending on the likelihood of a match in the vertex neighborhood. We also propose a metric named “Relative Selectivity" that is used to se- lect between different query processing strategies. Our experiments performed on real online news, network traffic stream and a syn- thetic social network benchmark demonstrate 10-100x speedups over selectivity agnostic approaches.« less

A Multiatlas Segmentation Using Graph Cuts with Applications to Liver Segmentation in CT Scans

PubMed Central

2014-01-01

An atlas-based segmentation approach is presented that combines low-level operations, an affine probabilistic atlas, and a multiatlas-based segmentation. The proposed combination provides highly accurate segmentation due to registrations and atlas selections based on the regions of interest (ROIs) and coarse segmentations. Our approach shares the following common elements between the probabilistic atlas and multiatlas segmentation: (a) the spatial normalisation and (b) the segmentation method, which is based on minimising a discrete energy function using graph cuts. The method is evaluated for the segmentation of the liver in computed tomography (CT) images. Low-level operations define a ROI around the liver from an abdominal CT. We generate a probabilistic atlas using an affine registration based on geometry moments from manually labelled data. Next, a coarse segmentation of the liver is obtained from the probabilistic atlas with low computational effort. Then, a multiatlas segmentation approach improves the accuracy of the segmentation. Both the atlas selections and the nonrigid registrations of the multiatlas approach use a binary mask defined by coarse segmentation. We experimentally demonstrate that this approach performs better than atlas selections and nonrigid registrations in the entire ROI. The segmentation results are comparable to those obtained by human experts and to other recently published results. PMID:25276219

3D object retrieval using salient views

PubMed Central

Shapiro, Linda G.

2013-01-01

This paper presents a method for selecting salient 2D views to describe 3D objects for the purpose of retrieval. The views are obtained by first identifying salient points via a learning approach that uses shape characteristics of the 3D points (Atmosukarto and Shapiro in International workshop on structural, syntactic, and statistical pattern recognition, 2008; Atmosukarto and Shapiro in ACM multimedia information retrieval, 2008). The salient views are selected by choosing views with multiple salient points on the silhouette of the object. Silhouette-based similarity measures from Chen et al. (Comput Graph Forum 22(3):223–232, 2003) are then used to calculate the similarity between two 3D objects. Retrieval experiments were performed on three datasets: the Heads dataset, the SHREC2008 dataset, and the Princeton dataset. Experimental results show that the retrieval results using the salient views are comparable to the existing light field descriptor method (Chen et al. in Comput Graph Forum 22(3):223–232, 2003), and our method achieves a 15-fold speedup in the feature extraction computation time. PMID:23833704

Mean square cordial labelling related to some acyclic graphs and its rough approximations

NASA Astrophysics Data System (ADS)

Dhanalakshmi, S.; Parvathi, N.

2018-04-01

In this paper we investigate that the path Pn, comb graph Pn⊙K1, n-centipede graph,centipede graph (n,2) and star Sn admits mean square cordial labeling. Also we proved that the induced sub graph obtained by the upper approximation of any sub graph H of the above acyclic graphs admits mean square cordial labeling.

Relating zeta functions of discrete and quantum graphs

NASA Astrophysics Data System (ADS)

Harrison, Jonathan; Weyand, Tracy

2018-02-01

We write the spectral zeta function of the Laplace operator on an equilateral metric graph in terms of the spectral zeta function of the normalized Laplace operator on the corresponding discrete graph. To do this, we apply a relation between the spectrum of the Laplacian on a discrete graph and that of the Laplacian on an equilateral metric graph. As a by-product, we determine how the multiplicity of eigenvalues of the quantum graph, that are also in the spectrum of the graph with Dirichlet conditions at the vertices, depends on the graph geometry. Finally we apply the result to calculate the vacuum energy and spectral determinant of a complete bipartite graph and compare our results with those for a star graph, a graph in which all vertices are connected to a central vertex by a single edge.

Topic Model for Graph Mining.

PubMed

Xuan, Junyu; Lu, Jie; Zhang, Guangquan; Luo, Xiangfeng

2015-12-01

Graph mining has been a popular research area because of its numerous application scenarios. Many unstructured and structured data can be represented as graphs, such as, documents, chemical molecular structures, and images. However, an issue in relation to current research on graphs is that they cannot adequately discover the topics hidden in graph-structured data which can be beneficial for both the unsupervised learning and supervised learning of the graphs. Although topic models have proved to be very successful in discovering latent topics, the standard topic models cannot be directly applied to graph-structured data due to the "bag-of-word" assumption. In this paper, an innovative graph topic model (GTM) is proposed to address this issue, which uses Bernoulli distributions to model the edges between nodes in a graph. It can, therefore, make the edges in a graph contribute to latent topic discovery and further improve the accuracy of the supervised and unsupervised learning of graphs. The experimental results on two different types of graph datasets show that the proposed GTM outperforms the latent Dirichlet allocation on classification by using the unveiled topics of these two models to represent graphs.

Adaptive sampling in behavioral surveys.

PubMed

Thompson, S K

1997-01-01

Studies of populations such as drug users encounter difficulties because the members of the populations are rare, hidden, or hard to reach. Conventionally designed large-scale surveys detect relatively few members of the populations so that estimates of population characteristics have high uncertainty. Ethnographic studies, on the other hand, reach suitable numbers of individuals only through the use of link-tracing, chain referral, or snowball sampling procedures that often leave the investigators unable to make inferences from their sample to the hidden population as a whole. In adaptive sampling, the procedure for selecting people or other units to be in the sample depends on variables of interest observed during the survey, so the design adapts to the population as encountered. For example, when self-reported drug use is found among members of the sample, sampling effort may be increased in nearby areas. Types of adaptive sampling designs include ordinary sequential sampling, adaptive allocation in stratified sampling, adaptive cluster sampling, and optimal model-based designs. Graph sampling refers to situations with nodes (for example, people) connected by edges (such as social links or geographic proximity). An initial sample of nodes or edges is selected and edges are subsequently followed to bring other nodes into the sample. Graph sampling designs include network sampling, snowball sampling, link-tracing, chain referral, and adaptive cluster sampling. A graph sampling design is adaptive if the decision to include linked nodes depends on variables of interest observed on nodes already in the sample. Adjustment methods for nonsampling errors such as imperfect detection of drug users in the sample apply to adaptive as well as conventional designs.

Insect glycerol transporters evolved by functional co-option and gene replacement

PubMed Central

Finn, Roderick Nigel; Chauvigné, François; Stavang, Jon Anders; Belles, Xavier; Cerdà, Joan

2015-01-01

Transmembrane glycerol transport is typically facilitated by aquaglyceroporins in Prokaryota and Eukaryota. In holometabolan insects however, aquaglyceroporins are absent, yet several species possess polyol permeable aquaporins. It thus remains unknown how glycerol transport evolved in the Holometabola. By combining phylogenetic and functional studies, here we show that a more efficient form of glycerol transporter related to the water-selective channel AQP4 specifically evolved and multiplied in the insect lineage, resulting in the replacement of the ancestral branch of aquaglyceroporins in holometabolan insects. To recapitulate this evolutionary process, we generate specific mutants in distantly related insect aquaporins and human AQP4 and show that a single mutation in the selectivity filter converted a water-selective channel into a glycerol transporter at the root of the crown clade of hexapod insects. Integration of phanerozoic climate models suggests that these events were associated with the emergence of complete metamorphosis and the unparalleled radiation of insects. PMID:26183829

Efficient structure from motion for oblique UAV images based on maximal spanning tree expansion

NASA Astrophysics Data System (ADS)

Jiang, San; Jiang, Wanshou

2017-10-01

The primary contribution of this paper is an efficient Structure from Motion (SfM) solution for oblique unmanned aerial vehicle (UAV) images. First, an algorithm, considering spatial relationship constraints between image footprints, is designed for match pair selection with the assistance of UAV flight control data and oblique camera mounting angles. Second, a topological connection network (TCN), represented by an undirected weighted graph, is constructed from initial match pairs, which encodes the overlap areas and intersection angles into edge weights. Then, an algorithm, termed MST-Expansion, is proposed to extract the match graph from the TCN, where the TCN is first simplified by a maximum spanning tree (MST). By further analysis of the local structure in the MST, expansion operations are performed on the vertices of the MST for match graph enhancement, which is achieved by introducing critical connections in the expansion directions. Finally, guided by the match graph, an efficient SfM is proposed. Under extensive analysis and comparison, its performance is verified by using three oblique UAV datasets captured with different multi-camera systems. Experimental results demonstrate that the efficiency of image matching is improved, with speedup ratios ranging from 19 to 35, and competitive orientation accuracy is achieved from both relative bundle adjustment (BA) without GCPs (Ground Control Points) and absolute BA with GCPs. At the same time, images in the three datasets are successfully oriented. For the orientation of oblique UAV images, the proposed method can be a more efficient solution.

Preserving Differential Privacy in Degree-Correlation based Graph Generation

PubMed Central

Wang, Yue; Wu, Xintao

2014-01-01

Enabling accurate analysis of social network data while preserving differential privacy has been challenging since graph features such as cluster coefficient often have high sensitivity, which is different from traditional aggregate functions (e.g., count and sum) on tabular data. In this paper, we study the problem of enforcing edge differential privacy in graph generation. The idea is to enforce differential privacy on graph model parameters learned from the original network and then generate the graphs for releasing using the graph model with the private parameters. In particular, we develop a differential privacy preserving graph generator based on the dK-graph generation model. We first derive from the original graph various parameters (i.e., degree correlations) used in the dK-graph model, then enforce edge differential privacy on the learned parameters, and finally use the dK-graph model with the perturbed parameters to generate graphs. For the 2K-graph model, we enforce the edge differential privacy by calibrating noise based on the smooth sensitivity, rather than the global sensitivity. By doing this, we achieve the strict differential privacy guarantee with smaller magnitude noise. We conduct experiments on four real networks and compare the performance of our private dK-graph models with the stochastic Kronecker graph generation model in terms of utility and privacy tradeoff. Empirical evaluations show the developed private dK-graph generation models significantly outperform the approach based on the stochastic Kronecker generation model. PMID:24723987

Multi-atlas segmentation of subcortical brain structures via the AutoSeg software pipeline

PubMed Central

Wang, Jiahui; Vachet, Clement; Rumple, Ashley; Gouttard, Sylvain; Ouziel, Clémentine; Perrot, Emilie; Du, Guangwei; Huang, Xuemei; Gerig, Guido; Styner, Martin

2014-01-01

Automated segmenting and labeling of individual brain anatomical regions, in MRI are challenging, due to the issue of individual structural variability. Although atlas-based segmentation has shown its potential for both tissue and structure segmentation, due to the inherent natural variability as well as disease-related changes in MR appearance, a single atlas image is often inappropriate to represent the full population of datasets processed in a given neuroimaging study. As an alternative for the case of single atlas segmentation, the use of multiple atlases alongside label fusion techniques has been introduced using a set of individual “atlases” that encompasses the expected variability in the studied population. In our study, we proposed a multi-atlas segmentation scheme with a novel graph-based atlas selection technique. We first paired and co-registered all atlases and the subject MR scans. A directed graph with edge weights based on intensity and shape similarity between all MR scans is then computed. The set of neighboring templates is selected via clustering of the graph. Finally, weighted majority voting is employed to create the final segmentation over the selected atlases. This multi-atlas segmentation scheme is used to extend a single-atlas-based segmentation toolkit entitled AutoSeg, which is an open-source, extensible C++ based software pipeline employing BatchMake for its pipeline scripting, developed at the Neuro Image Research and Analysis Laboratories of the University of North Carolina at Chapel Hill. AutoSeg performs N4 intensity inhomogeneity correction, rigid registration to a common template space, automated brain tissue classification based skull-stripping, and the multi-atlas segmentation. The multi-atlas-based AutoSeg has been evaluated on subcortical structure segmentation with a testing dataset of 20 adult brain MRI scans and 15 atlas MRI scans. The AutoSeg achieved mean Dice coefficients of 81.73% for the subcortical structures. PMID:24567717

A general method for computing Tutte polynomials of self-similar graphs

NASA Astrophysics Data System (ADS)

Gong, Helin; Jin, Xian'an

2017-10-01

Self-similar graphs were widely studied in both combinatorics and statistical physics. Motivated by the construction of the well-known 3-dimensional Sierpiński gasket graphs, in this paper we introduce a family of recursively constructed self-similar graphs whose inner duals are of the self-similar property. By combining the dual property of the Tutte polynomial and the subgraph-decomposition trick, we show that the Tutte polynomial of this family of graphs can be computed in an iterative way and in particular the exact expression of the formula of the number of their spanning trees is derived. Furthermore, we show our method is a general one that is easily extended to compute Tutte polynomials for other families of self-similar graphs such as Farey graphs, 2-dimensional Sierpiński gasket graphs, Hanoi graphs, modified Koch graphs, Apollonian graphs, pseudofractal scale-free web, fractal scale-free network, etc.

Bipartite separability and nonlocal quantum operations on graphs

NASA Astrophysics Data System (ADS)

Dutta, Supriyo; Adhikari, Bibhas; Banerjee, Subhashish; Srikanth, R.

2016-07-01

In this paper we consider the separability problem for bipartite quantum states arising from graphs. Earlier it was proved that the degree criterion is the graph-theoretic counterpart of the familiar positive partial transpose criterion for separability, although there are entangled states with positive partial transpose for which the degree criterion fails. Here we introduce the concept of partially symmetric graphs and degree symmetric graphs by using the well-known concept of partial transposition of a graph and degree criteria, respectively. Thus, we provide classes of bipartite separable states of dimension m ×n arising from partially symmetric graphs. We identify partially asymmetric graphs that lack the property of partial symmetry. We develop a combinatorial procedure to create a partially asymmetric graph from a given partially symmetric graph. We show that this combinatorial operation can act as an entanglement generator for mixed states arising from partially symmetric graphs.

Parallel approach for bioinspired algorithms

NASA Astrophysics Data System (ADS)

Zaporozhets, Dmitry; Zaruba, Daria; Kulieva, Nina

2018-05-01

In the paper, a probabilistic parallel approach based on the population heuristic, such as a genetic algorithm, is suggested. The authors proposed using a multithreading approach at the micro level at which new alternative solutions are generated. On each iteration, several threads that independently used the same population to generate new solutions can be started. After the work of all threads, a selection operator combines obtained results in the new population. To confirm the effectiveness of the suggested approach, the authors have developed software on the basis of which experimental computations can be carried out. The authors have considered a classic optimization problem – finding a Hamiltonian cycle in a graph. Experiments show that due to the parallel approach at the micro level, increment of running speed can be obtained on graphs with 250 and more vertices.

Dataflow Design Tool: User's Manual

NASA Technical Reports Server (NTRS)

Jones, Robert L., III

1996-01-01

The Dataflow Design Tool is a software tool for selecting a multiprocessor scheduling solution for a class of computational problems. The problems of interest are those that can be described with a dataflow graph and are intended to be executed repetitively on a set of identical processors. Typical applications include signal processing and control law problems. The software tool implements graph-search algorithms and analysis techniques based on the dataflow paradigm. Dataflow analyses provided by the software are introduced and shown to effectively determine performance bounds, scheduling constraints, and resource requirements. The software tool provides performance optimization through the inclusion of artificial precedence constraints among the schedulable tasks. The user interface and tool capabilities are described. Examples are provided to demonstrate the analysis, scheduling, and optimization functions facilitated by the tool.

On the local edge antimagicness of m-splitting graphs

NASA Astrophysics Data System (ADS)

Albirri, E. R.; Dafik; Slamin; Agustin, I. H.; Alfarisi, R.

2018-04-01

Let G be a connected and simple graph. A split graph is a graph derived by adding new vertex v‧ in every vertex v‧ such that v‧ adjacent to v in graph G. An m-splitting graph is a graph which has m v‧-vertices, denoted by mSpl(G). A local edge antimagic coloring in G = (V, E) graph is a bijection f:V (G)\\to \\{1,2,3,\\ldots,|V(G)|\\} in which for any two adjacent edges e 1 and e 2 satisfies w({e}1)\

Survey of Approaches to Generate Realistic Synthetic Graphs

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lim, Seung-Hwan; Lee, Sangkeun; Powers, Sarah S

A graph is a flexible data structure that can represent relationships between entities. As with other data analysis tasks, the use of realistic graphs is critical to obtaining valid research results. Unfortunately, using the actual ("real-world") graphs for research and new algorithm development is difficult due to the presence of sensitive information in the data or due to the scale of data. This results in practitioners developing algorithms and systems that employ synthetic graphs instead of real-world graphs. Generating realistic synthetic graphs that provide reliable statistical confidence to algorithmic analysis and system evaluation involves addressing technical hurdles in a broadmore » set of areas. This report surveys the state of the art in approaches to generate realistic graphs that are derived from fitted graph models on real-world graphs.« less

Self-organizing maps for learning the edit costs in graph matching.

PubMed

Neuhaus, Michel; Bunke, Horst

2005-06-01

Although graph matching and graph edit distance computation have become areas of intensive research recently, the automatic inference of the cost of edit operations has remained an open problem. In the present paper, we address the issue of learning graph edit distance cost functions for numerically labeled graphs from a corpus of sample graphs. We propose a system of self-organizing maps (SOMs) that represent the distance measuring spaces of node and edge labels. Our learning process is based on the concept of self-organization. It adapts the edit costs in such a way that the similarity of graphs from the same class is increased, whereas the similarity of graphs from different classes decreases. The learning procedure is demonstrated on two different applications involving line drawing graphs and graphs representing diatoms, respectively.

Apparatuses and Methods for Producing Runtime Architectures of Computer Program Modules

NASA Technical Reports Server (NTRS)

Abi-Antoun, Marwan Elia (Inventor); Aldrich, Jonathan Erik (Inventor)

2013-01-01

Apparatuses and methods for producing run-time architectures of computer program modules. One embodiment includes creating an abstract graph from the computer program module and from containment information corresponding to the computer program module, wherein the abstract graph has nodes including types and objects, and wherein the abstract graph relates an object to a type, and wherein for a specific object the abstract graph relates the specific object to a type containing the specific object; and creating a runtime graph from the abstract graph, wherein the runtime graph is a representation of the true runtime object graph, wherein the runtime graph represents containment information such that, for a specific object, the runtime graph relates the specific object to another object that contains the specific object.

Solving a Hamiltonian Path Problem with a bacterial computer

PubMed Central

Baumgardner, Jordan; Acker, Karen; Adefuye, Oyinade; Crowley, Samuel Thomas; DeLoache, Will; Dickson, James O; Heard, Lane; Martens, Andrew T; Morton, Nickolaus; Ritter, Michelle; Shoecraft, Amber; Treece, Jessica; Unzicker, Matthew; Valencia, Amanda; Waters, Mike; Campbell, A Malcolm; Heyer, Laurie J; Poet, Jeffrey L; Eckdahl, Todd T

2009-01-01

Background The Hamiltonian Path Problem asks whether there is a route in a directed graph from a beginning node to an ending node, visiting each node exactly once. The Hamiltonian Path Problem is NP complete, achieving surprising computational complexity with modest increases in size. This challenge has inspired researchers to broaden the definition of a computer. DNA computers have been developed that solve NP complete problems. Bacterial computers can be programmed by constructing genetic circuits to execute an algorithm that is responsive to the environment and whose result can be observed. Each bacterium can examine a solution to a mathematical problem and billions of them can explore billions of possible solutions. Bacterial computers can be automated, made responsive to selection, and reproduce themselves so that more processing capacity is applied to problems over time. Results We programmed bacteria with a genetic circuit that enables them to evaluate all possible paths in a directed graph in order to find a Hamiltonian path. We encoded a three node directed graph as DNA segments that were autonomously shuffled randomly inside bacteria by a Hin/hixC recombination system we previously adapted from Salmonella typhimurium for use in Escherichia coli. We represented nodes in the graph as linked halves of two different genes encoding red or green fluorescent proteins. Bacterial populations displayed phenotypes that reflected random ordering of edges in the graph. Individual bacterial clones that found a Hamiltonian path reported their success by fluorescing both red and green, resulting in yellow colonies. We used DNA sequencing to verify that the yellow phenotype resulted from genotypes that represented Hamiltonian path solutions, demonstrating that our bacterial computer functioned as expected. Conclusion We successfully designed, constructed, and tested a bacterial computer capable of finding a Hamiltonian path in a three node directed graph. This proof-of-concept experiment demonstrates that bacterial computing is a new way to address NP-complete problems using the inherent advantages of genetic systems. The results of our experiments also validate synthetic biology as a valuable approach to biological engineering. We designed and constructed basic parts, devices, and systems using synthetic biology principles of standardization and abstraction. PMID:19630940

The Roadmaker's algorithm for the discrete pulse transform.

PubMed

Laurie, Dirk P

2011-02-01

The discrete pulse transform (DPT) is a decomposition of an observed signal into a sum of pulses, i.e., signals that are constant on a connected set and zero elsewhere. Originally developed for 1-D signal processing, the DPT has recently been generalized to more dimensions. Applications in image processing are currently being investigated. The time required to compute the DPT as originally defined via the successive application of LULU operators (members of a class of minimax filters studied by Rohwer) has been a severe drawback to its applicability. This paper introduces a fast method for obtaining such a decomposition, called the Roadmaker's algorithm because it involves filling pits and razing bumps. It acts selectively only on those features actually present in the signal, flattening them in order of increasing size by subtracing an appropriate positive or negative pulse, which is then appended to the decomposition. The implementation described here covers 1-D signal as well as two and 3-D image processing in a single framework. This is achieved by considering the signal or image as a function defined on a graph, with the geometry specified by the edges of the graph. Whenever a feature is flattened, nodes in the graph are merged, until eventually only one node remains. At that stage, a new set of edges for the same nodes as the graph, forming a tree structure, defines the obtained decomposition. The Roadmaker's algorithm is shown to be equivalent to the DPT in the sense of obtaining the same decomposition. However, its simpler operators are not in general equivalent to the LULU operators in situations where those operators are not applied successively. A by-product of the Roadmaker's algorithm is that it yields a proof of the so-called Highlight Conjecture, stated as an open problem in 2006. We pay particular attention to algorithmic details and complexity, including a demonstration that in the 1-D case, and also in the case of a complete graph, the Roadmaker's algorithm has optimal complexity: it runs in time O(m), where m is the number of arcs in the graph.

Genome-wide association study and ancestral origins of the slick-hair coat in tropically adapted cattle

PubMed Central

Huson, Heather J.; Kim, Eui-Soo; Godfrey, Robert W.; Olson, Timothy A.; McClure, Matthew C.; Chase, Chad C.; Rizzi, Rita; O'Brien, Ana M. P.; Van Tassell, Curt P.; Garcia, José F.; Sonstegard, Tad S.

2014-01-01

The slick hair coat (SLICK) is a dominantly inherited trait typically associated with tropically adapted cattle that are from Criollo descent through Spanish colonization of cattle into the New World. The trait is of interest relative to climate change, due to its association with improved thermo-tolerance and subsequent increased productivity. Previous studies localized the SLICK locus to a 4 cM region on chromosome (BTA) 20 and identified signatures of selection in this region derived from Senepol cattle. The current study compares three slick-haired Criollo-derived breeds including Senepol, Carora, and Romosinuano and three additional slick-haired cross-bred lineages to non-slick ancestral breeds. Genome-wide association (GWA), haplotype analysis, signatures of selection, runs of homozygosity (ROH), and identity by state (IBS) calculations were used to identify a 0.8 Mb (37.7–38.5 Mb) consensus region for the SLICK locus on BTA20 in which contains SKP2 and SPEF2 as possible candidate genes. Three specific haplotype patterns are identified in slick individuals, all with zero frequency in non-slick individuals. Admixture analysis identified common genetic patterns between the three slick breeds at the SLICK locus. Principal component analysis (PCA) and admixture results show Senepol and Romosinuano sharing a higher degree of genetic similarity to one another with a much lesser degree of similarity to Carora. Variation in GWA, haplotype analysis, and IBS calculations with accompanying population structure information supports potentially two mutations, one common to Senepol and Romosinuano and another in Carora, effecting genes contained within our refined location for the SLICK locus. PMID:24808908

Genome-wide association study and ancestral origins of the slick-hair coat in tropically adapted cattle.

PubMed

Huson, Heather J; Kim, Eui-Soo; Godfrey, Robert W; Olson, Timothy A; McClure, Matthew C; Chase, Chad C; Rizzi, Rita; O'Brien, Ana M P; Van Tassell, Curt P; Garcia, José F; Sonstegard, Tad S

2014-01-01

The slick hair coat (SLICK) is a dominantly inherited trait typically associated with tropically adapted cattle that are from Criollo descent through Spanish colonization of cattle into the New World. The trait is of interest relative to climate change, due to its association with improved thermo-tolerance and subsequent increased productivity. Previous studies localized the SLICK locus to a 4 cM region on chromosome (BTA) 20 and identified signatures of selection in this region derived from Senepol cattle. The current study compares three slick-haired Criollo-derived breeds including Senepol, Carora, and Romosinuano and three additional slick-haired cross-bred lineages to non-slick ancestral breeds. Genome-wide association (GWA), haplotype analysis, signatures of selection, runs of homozygosity (ROH), and identity by state (IBS) calculations were used to identify a 0.8 Mb (37.7-38.5 Mb) consensus region for the SLICK locus on BTA20 in which contains SKP2 and SPEF2 as possible candidate genes. Three specific haplotype patterns are identified in slick individuals, all with zero frequency in non-slick individuals. Admixture analysis identified common genetic patterns between the three slick breeds at the SLICK locus. Principal component analysis (PCA) and admixture results show Senepol and Romosinuano sharing a higher degree of genetic similarity to one another with a much lesser degree of similarity to Carora. Variation in GWA, haplotype analysis, and IBS calculations with accompanying population structure information supports potentially two mutations, one common to Senepol and Romosinuano and another in Carora, effecting genes contained within our refined location for the SLICK locus.

Network Analysis of Protein Adaptation: Modeling the Functional Impact of Multiple Mutations

PubMed Central

Beleva Guthrie, Violeta; Masica, David L; Fraser, Andrew; Federico, Joseph; Fan, Yunfan; Camps, Manel; Karchin, Rachel

2018-01-01

Abstract The evolution of new biochemical activities frequently involves complex dependencies between mutations and rapid evolutionary radiation. Mutation co-occurrence and covariation have previously been used to identify compensating mutations that are the result of physical contacts and preserve protein function and fold. Here, we model pairwise functional dependencies and higher order interactions that enable evolution of new protein functions. We use a network model to find complex dependencies between mutations resulting from evolutionary trade-offs and pleiotropic effects. We present a method to construct these networks and to identify functionally interacting mutations in both extant and reconstructed ancestral sequences (Network Analysis of Protein Adaptation). The time ordering of mutations can be incorporated into the networks through phylogenetic reconstruction. We apply NAPA to three distantly homologous β-lactamase protein clusters (TEM, CTX-M-3, and OXA-51), each of which has experienced recent evolutionary radiation under substantially different selective pressures. By analyzing the network properties of each protein cluster, we identify key adaptive mutations, positive pairwise interactions, different adaptive solutions to the same selective pressure, and complex evolutionary trajectories likely to increase protein fitness. We also present evidence that incorporating information from phylogenetic reconstruction and ancestral sequence inference can reduce the number of spurious links in the network, whereas preserving overall network community structure. The analysis does not require structural or biochemical data. In contrast to function-preserving mutation dependencies, which are frequently from structural contacts, gain-of-function mutation dependencies are most commonly between residues distal in protein structure. PMID:29522102

Three brown trout Salmo trutta lineages in Corsica described through allozyme variation.

PubMed

Berrebi, P

2015-01-01

The brown trout Salmo trutta is represented by three lineages in Corsica: (1) an ancestral Corsican lineage, (2) a Mediterranean lineage and (3) a recently stocked domestic Atlantic S. trutta lineage (all are interfertile); the main focus of this study was the ancestral Corsican S. trutta, but the other lineages were also considered. A total of 38 samples captured between 1993 and 1998 were analysed, with nearly 1000 individuals considered overall. The Corsican ancestral lineage (Adriatic lineage according to the mitochondrial DNA control region nomenclature, AD) mostly inhabits streams in the southern half of the island; the Mediterranean lineage (ME) is present more in the north, especially in Golu River, but most populations are an admixture of these lineages and the domestic Atlantic S. trutta (AT). Locations where the Corsican ancestral S. trutta is dominant are now protected against stocking and sometimes fishing is also forbidden. The presence of the Corsican S. trutta is unique in France. © 2014 The Fisheries Society of the British Isles.

A Universal Trend among Proteomes Indicates an Oily Last Common Ancestor

PubMed Central

Mannige, Ranjan V.; Brooks, Charles L.; Shakhnovich, Eugene I.

2012-01-01

Despite progresses in ancestral protein sequence reconstruction, much needs to be unraveled about the nature of the putative last common ancestral proteome that served as the prototype of all extant lifeforms. Here, we present data that indicate a steady decline (oil escape) in proteome hydrophobicity over species evolvedness (node number) evident in 272 diverse proteomes, which indicates a highly hydrophobic (oily) last common ancestor (LCA). This trend, obtained from simple considerations (free from sequence reconstruction methods), was corroborated by regression studies within homologous and orthologous protein clusters as well as phylogenetic estimates of the ancestral oil content. While indicating an inherent irreversibility in molecular evolution, oil escape also serves as a rare and universal reaction-coordinate for evolution (reinforcing Darwin's principle of Common Descent), and may prove important in matters such as (i) explaining the emergence of intrinsically disordered proteins, (ii) developing composition- and speciation-based “global” molecular clocks, and (iii) improving the statistical methods for ancestral sequence reconstruction. PMID:23300421

G-Hash: Towards Fast Kernel-based Similarity Search in Large Graph Databases.

PubMed

Wang, Xiaohong; Smalter, Aaron; Huan, Jun; Lushington, Gerald H

2009-01-01

Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and similarity search. With the fast accumulation of graph databases, similarity search in graph databases has emerged as an important research topic. Graph similarity search has applications in a wide range of domains including cheminformatics, bioinformatics, sensor network management, social network management, and XML documents, among others.Most of the current graph indexing methods focus on subgraph query processing, i.e. determining the set of database graphs that contains the query graph and hence do not directly support similarity search. In data mining and machine learning, various graph kernel functions have been designed to capture the intrinsic similarity of graphs. Though successful in constructing accurate predictive and classification models for supervised learning, graph kernel functions have (i) high computational complexity and (ii) non-trivial difficulty to be indexed in a graph database.Our objective is to bridge graph kernel function and similarity search in graph databases by proposing (i) a novel kernel-based similarity measurement and (ii) an efficient indexing structure for graph data management. Our method of similarity measurement builds upon local features extracted from each node and their neighboring nodes in graphs. A hash table is utilized to support efficient storage and fast search of the extracted local features. Using the hash table, a graph kernel function is defined to capture the intrinsic similarity of graphs and for fast similarity query processing. We have implemented our method, which we have named G-hash, and have demonstrated its utility on large chemical graph databases. Our results show that the G-hash method achieves state-of-the-art performance for k-nearest neighbor (k-NN) classification. Most importantly, the new similarity measurement and the index structure is scalable to large database with smaller indexing size, faster indexing construction time, and faster query processing time as compared to state-of-the-art indexing methods such as C-tree, gIndex, and GraphGrep.

GraphReduce: Processing Large-Scale Graphs on Accelerator-Based Systems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Sengupta, Dipanjan; Song, Shuaiwen; Agarwal, Kapil

2015-11-15

Recent work on real-world graph analytics has sought to leverage the massive amount of parallelism offered by GPU devices, but challenges remain due to the inherent irregularity of graph algorithms and limitations in GPU-resident memory for storing large graphs. We present GraphReduce, a highly efficient and scalable GPU-based framework that operates on graphs that exceed the device’s internal memory capacity. GraphReduce adopts a combination of edge- and vertex-centric implementations of the Gather-Apply-Scatter programming model and operates on multiple asynchronous GPU streams to fully exploit the high degrees of parallelism in GPUs with efficient graph data movement between the host andmore » device.« less

Comparing Internet Probing Methodologies Through an Analysis of Large Dynamic Graphs

DTIC Science & Technology

2014-06-01

comparable Internet topologies in less time. We compare these by modeling union of traceroute outputs as graphs, and using standard graph theoretical...topologies in less time. We compare these by modeling union of traceroute outputs as graphs, and using standard graph theoretical measurements as well...We compare these by modeling union of traceroute outputs as graphs, and study the graphs by using vertex and edge count, average vertex degree

GraphBench

DOE Office of Scientific and Technical Information (OSTI.GOV)

Sukumar, Sreenivas R.; Hong, Seokyong; Lee, Sangkeun

2016-06-01

GraphBench is a benchmark suite for graph pattern mining and graph analysis systems. The benchmark suite is a significant addition to conducting apples-apples comparison of graph analysis software (databases, in-memory tools, triple stores, etc.)

Asymptote Misconception on Graphing Functions: Does Graphing Software Resolve It?

ERIC Educational Resources Information Center

Öçal, Mehmet Fatih

2017-01-01

Graphing function is an important issue in mathematics education due to its use in various areas of mathematics and its potential roles for students to enhance learning mathematics. The use of some graphing software assists students' learning during graphing functions. However, the display of graphs of functions that students sketched by hand may…

Generalized graph states based on Hadamard matrices

DOE Office of Scientific and Technical Information (OSTI.GOV)

Cui, Shawn X.; Yu, Nengkun; Department of Mathematics and Statistics, University of Guelph, Guelph, Ontario N1G 2W1

2015-07-15

Graph states are widely used in quantum information theory, including entanglement theory, quantum error correction, and one-way quantum computing. Graph states have a nice structure related to a certain graph, which is given by either a stabilizer group or an encoding circuit, both can be directly given by the graph. To generalize graph states, whose stabilizer groups are abelian subgroups of the Pauli group, one approach taken is to study non-abelian stabilizers. In this work, we propose to generalize graph states based on the encoding circuit, which is completely determined by the graph and a Hadamard matrix. We study themore » entanglement structures of these generalized graph states and show that they are all maximally mixed locally. We also explore the relationship between the equivalence of Hadamard matrices and local equivalence of the corresponding generalized graph states. This leads to a natural generalization of the Pauli (X, Z) pairs, which characterizes the local symmetries of these generalized graph states. Our approach is also naturally generalized to construct graph quantum codes which are beyond stabilizer codes.« less

Graph processing platforms at scale: practices and experiences

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lim, Seung-Hwan; Lee, Sangkeun; Brown, Tyler C

2015-01-01

Graph analysis unveils hidden associations of data in many phenomena and artifacts, such as road network, social networks, genomic information, and scientific collaboration. Unfortunately, a wide diversity in the characteristics of graphs and graph operations make it challenging to find a right combination of tools and implementation of algorithms to discover desired knowledge from the target data set. This study presents an extensive empirical study of three representative graph processing platforms: Pegasus, GraphX, and Urika. Each system represents a combination of options in data model, processing paradigm, and infrastructure. We benchmarked each platform using three popular graph operations, degree distribution,more » connected components, and PageRank over a variety of real-world graphs. Our experiments show that each graph processing platform shows different strength, depending the type of graph operations. While Urika performs the best in non-iterative operations like degree distribution, GraphX outputforms iterative operations like connected components and PageRank. In addition, we discuss challenges to optimize the performance of each platform over large scale real world graphs.« less

A fast algorithm for vertex-frequency representations of signals on graphs

PubMed Central

Jestrović, Iva; Coyle, James L.; Sejdić, Ervin

2016-01-01

The windowed Fourier transform (short time Fourier transform) and the S-transform are widely used signal processing tools for extracting frequency information from non-stationary signals. Previously, the windowed Fourier transform had been adopted for signals on graphs and has been shown to be very useful for extracting vertex-frequency information from graphs. However, high computational complexity makes these algorithms impractical. We sought to develop a fast windowed graph Fourier transform and a fast graph S-transform requiring significantly shorter computation time. The proposed schemes have been tested with synthetic test graph signals and real graph signals derived from electroencephalography recordings made during swallowing. The results showed that the proposed schemes provide significantly lower computation time in comparison with the standard windowed graph Fourier transform and the fast graph S-transform. Also, the results showed that noise has no effect on the results of the algorithm for the fast windowed graph Fourier transform or on the graph S-transform. Finally, we showed that graphs can be reconstructed from the vertex-frequency representations obtained with the proposed algorithms. PMID:28479645

Interconnection networks

DOEpatents

Faber, V.; Moore, J.W.

1988-06-20

A network of interconnected processors is formed from a vertex symmetric graph selected from graphs GAMMA/sub d/(k) with degree d, diameter k, and (d + 1)exclamation/ (d /minus/ k + 1)exclamation processors for each d greater than or equal to k and GAMMA/sub d/(k, /minus/1) with degree d /minus/ 1, diameter k + 1, and (d + 1)exclamation/(d /minus/ k + 1)exclamation processors for each d greater than or equal to k greater than or equal to 4. Each processor has an address formed by one of the permutations from a predetermined sequence of letters chosen a selected number of letters at a time, and an extended address formed by appending to the address the remaining ones of the predetermined sequence of letters. A plurality of transmission channels is provided from each of the processors, where each processor has one less channel than the selected number of letters forming the sequence. Where a network GAMMA/sub d/(k, /minus/1) is provided, no processor has a channel connected to form an edge in a direction delta/sub 1/. Each of the channels has an identification number selected from the sequence of letters and connected from a first processor having a first extended address to a second processor having a second address formed from a second extended address defined by moving to the front of the first extended address the letter found in the position within the first extended address defined by the channel identification number. The second address is then formed by selecting the first elements of the second extended address corresponding to the selected number used to form the address permutations. 9 figs.

Strawberry: Fast and accurate genome-guided transcript reconstruction and quantification from RNA-Seq.

PubMed

Liu, Ruolin; Dickerson, Julie

2017-11-01

We propose a novel method and software tool, Strawberry, for transcript reconstruction and quantification from RNA-Seq data under the guidance of genome alignment and independent of gene annotation. Strawberry consists of two modules: assembly and quantification. The novelty of Strawberry is that the two modules use different optimization frameworks but utilize the same data graph structure, which allows a highly efficient, expandable and accurate algorithm for dealing large data. The assembly module parses aligned reads into splicing graphs, and uses network flow algorithms to select the most likely transcripts. The quantification module uses a latent class model to assign read counts from the nodes of splicing graphs to transcripts. Strawberry simultaneously estimates the transcript abundances and corrects for sequencing bias through an EM algorithm. Based on simulations, Strawberry outperforms Cufflinks and StringTie in terms of both assembly and quantification accuracies. Under the evaluation of a real data set, the estimated transcript expression by Strawberry has the highest correlation with Nanostring probe counts, an independent experiment measure for transcript expression. Strawberry is written in C++14, and is available as open source software at https://github.com/ruolin/strawberry under the MIT license.

Large fluctuations in anti-coordination games on scale-free graphs

NASA Astrophysics Data System (ADS)

Sabsovich, Daniel; Mobilia, Mauro; Assaf, Michael

2017-05-01

We study the influence of the complex topology of scale-free graphs on the dynamics of anti-coordination games (e.g. snowdrift games). These reference models are characterized by the coexistence (evolutionary stable mixed strategy) of two competing species, say ‘cooperators’ and ‘defectors’, and, in finite systems, by metastability and large-fluctuation-driven fixation. In this work, we use extensive computer simulations and an effective diffusion approximation (in the weak selection limit) to determine under which circumstances, depending on the individual-based update rules, the topology drastically affects the long-time behavior of anti-coordination games. In particular, we compute the variance of the number of cooperators in the metastable state and the mean fixation time when the dynamics is implemented according to the voter model (death-first/birth-second process) and the link dynamics (birth/death or death/birth at random). For the voter update rule, we show that the scale-free topology effectively renormalizes the population size and as a result the statistics of observables depend on the network’s degree distribution. In contrast, such a renormalization does not occur with the link dynamics update rule and we recover the same behavior as on complete graphs.

Unsupervised active learning based on hierarchical graph-theoretic clustering.

PubMed

Hu, Weiming; Hu, Wei; Xie, Nianhua; Maybank, Steve

2009-10-01

Most existing active learning approaches are supervised. Supervised active learning has the following problems: inefficiency in dealing with the semantic gap between the distribution of samples in the feature space and their labels, lack of ability in selecting new samples that belong to new categories that have not yet appeared in the training samples, and lack of adaptability to changes in the semantic interpretation of sample categories. To tackle these problems, we propose an unsupervised active learning framework based on hierarchical graph-theoretic clustering. In the framework, two promising graph-theoretic clustering algorithms, namely, dominant-set clustering and spectral clustering, are combined in a hierarchical fashion. Our framework has some advantages, such as ease of implementation, flexibility in architecture, and adaptability to changes in the labeling. Evaluations on data sets for network intrusion detection, image classification, and video classification have demonstrated that our active learning framework can effectively reduce the workload of manual classification while maintaining a high accuracy of automatic classification. It is shown that, overall, our framework outperforms the support-vector-machine-based supervised active learning, particularly in terms of dealing much more efficiently with new samples whose categories have not yet appeared in the training samples.

Interference graph-based dynamic frequency reuse in optical attocell networks

NASA Astrophysics Data System (ADS)

Liu, Huanlin; Xia, Peijie; Chen, Yong; Wu, Lan

2017-11-01

Indoor optical attocell network may achieve higher capacity than radio frequency (RF) or Infrared (IR)-based wireless systems. It is proposed as a special type of visible light communication (VLC) system using Light Emitting Diodes (LEDs). However, the system spectral efficiency may be severely degraded owing to the inter-cell interference (ICI), particularly for dense deployment scenarios. To address these issues, we construct the spectral interference graph for indoor optical attocell network, and propose the Dynamic Frequency Reuse (DFR) and Weighted Dynamic Frequency Reuse (W-DFR) algorithms to decrease ICI and improve the spectral efficiency performance. The interference graph makes LEDs can transmit data without interference and select the minimum sub-bands needed for frequency reuse. Then, DFR algorithm reuses the system frequency equally across service-providing cells to mitigate spectrum interference. While W-DFR algorithm can reuse the system frequency by using the bandwidth weight (BW), which is defined based on the number of service users. Numerical results show that both of the proposed schemes can effectively improve the average spectral efficiency (ASE) of the system. Additionally, improvement of the user data rate is also obtained by analyzing its cumulative distribution function (CDF).

Graph 500 on OpenSHMEM: Using a Practical Survey of Past Work to Motivate Novel Algorithmic Developments

DOE Office of Scientific and Technical Information (OSTI.GOV)

Grossman, Max; Pritchard Jr., Howard Porter; Budimlic, Zoran

2016-12-22

Graph500 [14] is an effort to offer a standardized benchmark across large-scale distributed platforms which captures the behavior of common communicationbound graph algorithms. Graph500 differs from other large-scale benchmarking efforts (such as HPL [6] or HPGMG [7]) primarily in the irregularity of its computation and data access patterns. The core computational kernel of Graph500 is a breadth-first search (BFS) implemented on an undirected graph. The output of Graph500 is a spanning tree of the input graph, usually represented by a predecessor mapping for every node in the graph. The Graph500 benchmark defines several pre-defined input sizes for implementers to testmore » against. This report summarizes investigation into implementing the Graph500 benchmark on OpenSHMEM, and focuses on first building a strong and practical understanding of the strengths and limitations of past work before proposing and developing novel extensions.« less

Graphing trillions of triangles.

PubMed

Burkhardt, Paul

2017-07-01

The increasing size of Big Data is often heralded but how data are transformed and represented is also profoundly important to knowledge discovery, and this is exemplified in Big Graph analytics. Much attention has been placed on the scale of the input graph but the product of a graph algorithm can be many times larger than the input. This is true for many graph problems, such as listing all triangles in a graph. Enabling scalable graph exploration for Big Graphs requires new approaches to algorithms, architectures, and visual analytics. A brief tutorial is given to aid the argument for thoughtful representation of data in the context of graph analysis. Then a new algebraic method to reduce the arithmetic operations in counting and listing triangles in graphs is introduced. Additionally, a scalable triangle listing algorithm in the MapReduce model will be presented followed by a description of the experiments with that algorithm that led to the current largest and fastest triangle listing benchmarks to date. Finally, a method for identifying triangles in new visual graph exploration technologies is proposed.

Alternative Fuels Data Center: Maps and Data

Science.gov Websites

fleet type from 1992-2014 Last update August 2016 View Graph Graph Download Data Generated_thumb20160830 Trend of S&FP AFV acquisitions by fuel type from 1992-2015 Last update August 2016 View Graph Graph transactions from 1997-2014 Last update August 2016 View Graph Graph Download Data Biofuelsatlas BioFuels Atlas

GraphReduce: Large-Scale Graph Analytics on Accelerator-Based HPC Systems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Sengupta, Dipanjan; Agarwal, Kapil; Song, Shuaiwen

2015-09-30

Recent work on real-world graph analytics has sought to leverage the massive amount of parallelism offered by GPU devices, but challenges remain due to the inherent irregularity of graph algorithms and limitations in GPU-resident memory for storing large graphs. We present GraphReduce, a highly efficient and scalable GPU-based framework that operates on graphs that exceed the device’s internal memory capacity. GraphReduce adopts a combination of both edge- and vertex-centric implementations of the Gather-Apply-Scatter programming model and operates on multiple asynchronous GPU streams to fully exploit the high degrees of parallelism in GPUs with efficient graph data movement between the hostmore » and the device.« less

Subcomplexes of Ancestral Respiratory Complex I Subunits Rapidly Turn Over in Vivo as Productive Assembly Intermediates in Arabidopsis*

PubMed Central

Li, Lei; Nelson, Clark J.; Carrie, Chris; Gawryluk, Ryan M. R.; Solheim, Cory; Gray, Michael W.; Whelan, James; Millar, A. Harvey

2013-01-01

Subcomplexes of mitochondrial respiratory complex I (CI; EC 1.6.5.3) are shown to turn over in vivo, and we propose a role in an ancestral assembly pathway. By progressively labeling Arabidopsis cell cultures with 15N and isolating mitochondria, we have identified CI subcomplexes through differences in 15N incorporation into their protein subunits. The 200-kDa subcomplex, containing the ancestral γ-carbonic anhydrase (γ-CA), γ-carbonic anhydrase-like, and 20.9-kDa subunits, had a significantly higher turnover rate than intact CI or CI+CIII2. In vitro import of precursors for these CI subunits demonstrated rapid generation of subcomplexes and revealed that their specific abundance varied when different ancestral subunits were imported. Time course studies of precursor import showed the further assembly of these subcomplexes into CI and CI+CIII2, indicating that the subcomplexes are productive intermediates of assembly. The strong transient incorporation of new subunits into the 200-kDa subcomplex in a γ-CA mutant is consistent with this subcomplex being a key initiator of CI assembly in plants. This evidence alongside the pattern of coincident occurrence of genes encoding these particular proteins broadly in eukaryotes, except for opisthokonts, provides a framework for the evolutionary conservation of these accessory subunits and evidence of their function in ancestral CI assembly. PMID:23271729

Calculating Payload for a Tethered Balloon System

Treesearch

Charles D. Tangren

1980-01-01

A graph method to calculate payload for a tethered balloon system, with the supporting helium lift and payload equations. is described. The balloon system is designed to collect emissions data during the convective-lift and no-convective-lift phases of a forest fire. A description of the balloon system and a list of factors affecting balloon selection are included....

Atlas of social and economic conditions and change in southern California.

Treesearch

Terry L. Raettig; Dawn M. Elmer; Harriet H. Christensen

2001-01-01

This atlas illustrates the spatial and temporal dimensions of social and economic changes in the social-economic assessment region in the decade since 1987/1988. Maps, interpretive text, and accompanying tables and graphs portray conditions, trends, and changes in selected social, economic, and natural resource-related indicators for the 26 counties of the diverse...

Data Analysis and Graphing in an Introductory Physics Laboratory: Spreadsheet versus Statistics Suite

ERIC Educational Resources Information Center

Peterlin, Primoz

2010-01-01

Two methods of data analysis are compared: spreadsheet software and a statistics software suite. Their use is compared analysing data collected in three selected experiments taken from an introductory physics laboratory, which include a linear dependence, a nonlinear dependence and a histogram. The merits of each method are compared. (Contains 7…

Why Are Shot Puts Thrown at 31[degrees]? Using Autograph for Applications of the Parabola

ERIC Educational Resources Information Center

Butler, Douglas

2010-01-01

Autograph is a two- and three-dimensional dynamic statistics and graphing utility, developed in England, that has grown out of direct classroom experience. A simple select-and-right-click interface, together with tools such as Autograph's unique Slow Plot, Scribble Tool, and dynamic Constant Controller help make the classroom experience…

Ten Important Words Plus: A Strategy for Building Word Knowledge

ERIC Educational Resources Information Center

Yopp, Ruth Helen; Yopp, Hallie Kay

2007-01-01

In this strategy, students individually select and record 10 important words on self-adhesive notes as they read a text. Then students build a group bar graph displaying their choices, write a sentence that summarizes the content, and then respond to prompts that ask them to think about words in powerful ways. Several prompts are suggested, each…

Study of solid rocket motor for space shuttle booster. Volume 4: Cost

NASA Technical Reports Server (NTRS)

1972-01-01

The cost data for solid propellant rocket engines for use with the space shuttle are presented. The data are based on the selected 156 inch parallel and series burn configurations. Summary cost data are provided for the production of the 120 inch and 260 inch configurations. Graphs depicting parametric cost estimating relationships are included.

Bayesian network ensemble as a multivariate strategy to predict radiation pneumonitis risk

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lee, Sangkyu, E-mail: sangkyu.lee@mail.mcgill.ca; Ybarra, Norma; Jeyaseelan, Krishinima

2015-05-15

Purpose: Prediction of radiation pneumonitis (RP) has been shown to be challenging due to the involvement of a variety of factors including dose–volume metrics and radiosensitivity biomarkers. Some of these factors are highly correlated and might affect prediction results when combined. Bayesian network (BN) provides a probabilistic framework to represent variable dependencies in a directed acyclic graph. The aim of this study is to integrate the BN framework and a systems’ biology approach to detect possible interactions among RP risk factors and exploit these relationships to enhance both the understanding and prediction of RP. Methods: The authors studied 54 nonsmall-cellmore » lung cancer patients who received curative 3D-conformal radiotherapy. Nineteen RP events were observed (common toxicity criteria for adverse events grade 2 or higher). Serum concentration of the following four candidate biomarkers were measured at baseline and midtreatment: alpha-2-macroglobulin, angiotensin converting enzyme (ACE), transforming growth factor, interleukin-6. Dose-volumetric and clinical parameters were also included as covariates. Feature selection was performed using a Markov blanket approach based on the Koller–Sahami filter. The Markov chain Monte Carlo technique estimated the posterior distribution of BN graphs built from the observed data of the selected variables and causality constraints. RP probability was estimated using a limited number of high posterior graphs (ensemble) and was averaged for the final RP estimate using Bayes’ rule. A resampling method based on bootstrapping was applied to model training and validation in order to control under- and overfit pitfalls. Results: RP prediction power of the BN ensemble approach reached its optimum at a size of 200. The optimized performance of the BN model recorded an area under the receiver operating characteristic curve (AUC) of 0.83, which was significantly higher than multivariate logistic regression (0.77), mean heart dose (0.69), and a pre-to-midtreatment change in ACE (0.66). When RP prediction was made only with pretreatment information, the AUC ranged from 0.76 to 0.81 depending on the ensemble size. Bootstrap validation of graph features in the ensemble quantified confidence of association between variables in the graphs where ten interactions were statistically significant. Conclusions: The presented BN methodology provides the flexibility to model hierarchical interactions between RP covariates, which is applied to probabilistic inference on RP. The authors’ preliminary results demonstrate that such framework combined with an ensemble method can possibly improve prediction of RP under real-life clinical circumstances such as missing data or treatment plan adaptation.« less

MEDRank: using graph-based concept ranking to index biomedical texts

PubMed Central

Herskovic, Jorge R.; Cohen, Trevor; Subramanian, Devika; Iyengar, M. Sriram; Smith, Jack W.; Bernstam, Elmer V.

2011-01-01

BACKGROUND As the volume of biomedical text increases exponentially, automatic indexing becomes increasingly important. However, existing approaches do not distinguish central (or core) concepts from concepts that were mentioned in passing. We focus on the problem of indexing MEDLINE records, a process that is currently performed by highly-trained humans at the National Library of Medicine (NLM). NLM indexers are assisted by a system called the Medical Text Indexer (MTI) that suggests candidate indexing terms. OBJECTIVE To improve the ability of MTI to select the core terms in MEDLINE abstracts. These core concepts are deemed to be most important and are designated as “major headings” by MEDLINE indexers. We introduce and evaluate a graph-based indexing methodology called MEDRank that generates concept graphs from biomedical text and then ranks the concepts within these graphs to identify the most important ones. METHODS We insert a MEDRank step into the MTI and compare MTI’s output with and without MEDRank to the MEDLINE indexers’ selected terms for a sample of 11,803 PubMed Central articles. We also tested whether human raters prefer terms generated by the MEDLINE indexers, MTI without MEDRank, and MTI with MEDRank for a sample of 36 PubMed Central articles. RESULTS MEDRank improved recall of major headings designated by 30% over MTI without MEDRank (0.489 vs 0.376). Overall recall was only slightly (6.5%) higher (0.490 vs 0.460) as was F2 (3%, 0.408 vs 0.396). However, overall precision was 3.9% lower (0.268 vs 0.279). Human raters preferred terms generated by MTI with MEDRank over terms generated by MTI without MEDRank (by an average of 1.00 more term per article), and preferred terms generated by MTI with MEDRank and the MEDLINE indexers at the same rate. CONCLUSIONS The addition of MEDRank to MTI significantly improved the retrieval of core concepts in MEDLINE abstracts and more closely matched human expectations compared to MTI without MEDRank. In addition, MEDRank slightly improved overall recall and F2. PMID:21439897

MEDRank: using graph-based concept ranking to index biomedical texts.

PubMed

Herskovic, Jorge R; Cohen, Trevor; Subramanian, Devika; Iyengar, M Sriram; Smith, Jack W; Bernstam, Elmer V

2011-06-01

As the volume of biomedical text increases exponentially, automatic indexing becomes increasingly important. However, existing approaches do not distinguish central (or core) concepts from concepts that were mentioned in passing. We focus on the problem of indexing MEDLINE records, a process that is currently performed by highly trained humans at the National Library of Medicine (NLM). NLM indexers are assisted by a system called the Medical Text Indexer (MTI) that suggests candidate indexing terms. To improve the ability of MTI to select the core terms in MEDLINE abstracts. These core concepts are deemed to be most important and are designated as "major headings" by MEDLINE indexers. We introduce and evaluate a graph-based indexing methodology called MEDRank that generates concept graphs from biomedical text and then ranks the concepts within these graphs to identify the most important ones. We insert a MEDRank step into the MTI and compare MTI's output with and without MEDRank to the MEDLINE indexers' selected terms for a sample of 11,803 PubMed Central articles. We also tested whether human raters prefer terms generated by the MEDLINE indexers, MTI without MEDRank, and MTI with MEDRank for a sample of 36 PubMed Central articles. MEDRank improved recall of major headings designated by 30% over MTI without MEDRank (0.489 vs. 0.376). Overall recall was only slightly (6.5%) higher (0.490 vs. 0.460) as was F(2) (3%, 0.408 vs. 0.396). However, overall precision was 3.9% lower (0.268 vs. 0.279). Human raters preferred terms generated by MTI with MEDRank over terms generated by MTI without MEDRank (by an average of 1.00 more term per article), and preferred terms generated by MTI with MEDRank and the MEDLINE indexers at the same rate. The addition of MEDRank to MTI significantly improved the retrieval of core concepts in MEDLINE abstracts and more closely matched human expectations compared to MTI without MEDRank. In addition, MEDRank slightly improved overall recall and F(2). Copyright © 2011 Elsevier Ireland Ltd. All rights reserved.

SING: Subgraph search In Non-homogeneous Graphs

PubMed Central

2010-01-01

Background Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image understanding. Since subgraph isomorphism is a computationally hard problem, indexing techniques have been intensively exploited to speed up the process. Such systems filter out those graphs which cannot contain the query, and apply a subgraph isomorphism algorithm to each residual candidate graph. The applicability of such systems is limited to databases of small graphs, because their filtering power degrades on large graphs. Results In this paper, SING (Subgraph search In Non-homogeneous Graphs), a novel indexing system able to cope with large graphs, is presented. The method uses the notion of feature, which can be a small subgraph, subtree or path. Each graph in the database is annotated with the set of all its features. The key point is to make use of feature locality information. This idea is used to both improve the filtering performance and speed up the subgraph isomorphism task. Conclusions Extensive tests on chemical compounds, biological networks and synthetic graphs show that the proposed system outperforms the most popular systems in query time over databases of medium and large graphs. Other specific tests show that the proposed system is effective for single large graphs. PMID:20170516

Spectral partitioning in equitable graphs.

PubMed

Barucca, Paolo

2017-06-01

Graph partitioning problems emerge in a wide variety of complex systems, ranging from biology to finance, but can be rigorously analyzed and solved only for a few graph ensembles. Here, an ensemble of equitable graphs, i.e., random graphs with a block-regular structure, is studied, for which analytical results can be obtained. In particular, the spectral density of this ensemble is computed exactly for a modular and bipartite structure. Kesten-McKay's law for random regular graphs is found analytically to apply also for modular and bipartite structures when blocks are homogeneous. An exact solution to graph partitioning for two equal-sized communities is proposed and verified numerically, and a conjecture on the absence of an efficient recovery detectability transition in equitable graphs is suggested. A final discussion summarizes results and outlines their relevance for the solution of graph partitioning problems in other graph ensembles, in particular for the study of detectability thresholds and resolution limits in stochastic block models.

Spectral partitioning in equitable graphs

NASA Astrophysics Data System (ADS)

Barucca, Paolo

2017-06-01

Graph partitioning problems emerge in a wide variety of complex systems, ranging from biology to finance, but can be rigorously analyzed and solved only for a few graph ensembles. Here, an ensemble of equitable graphs, i.e., random graphs with a block-regular structure, is studied, for which analytical results can be obtained. In particular, the spectral density of this ensemble is computed exactly for a modular and bipartite structure. Kesten-McKay's law for random regular graphs is found analytically to apply also for modular and bipartite structures when blocks are homogeneous. An exact solution to graph partitioning for two equal-sized communities is proposed and verified numerically, and a conjecture on the absence of an efficient recovery detectability transition in equitable graphs is suggested. A final discussion summarizes results and outlines their relevance for the solution of graph partitioning problems in other graph ensembles, in particular for the study of detectability thresholds and resolution limits in stochastic block models.

Well-Covered Graphs: A Survey

DTIC Science & Technology

1991-01-01

critical G’s/# G’s -) 0 as IV(G)I -- oo? References [B1] C. Berge, Regularizable graphs, Ann. Discrete Math ., 3, 1978, 11-19. [B2] _ _, Some common...Springer-Verlag, Berlin, 1980, 108-123. [B3] _ _, Some common properties for regularizable graphs, edge-critical graphs, and B-graphs, Ann. Discrete Math ., 12...graphs - an extension of the K6nig-Egervgiry theorem, Discrete Math ., 27, 1979, 23-33. [ER] M.N Ellingham and G.F. Royle, Well-covered cubic graphs

Study of Chromatic parameters of Line, Total, Middle graphs and Graph operators of Bipartite graph

NASA Astrophysics Data System (ADS)

Nagarathinam, R.; Parvathi, N.

2018-04-01

Chromatic parameters have been explored on the basis of graph coloring process in which a couple of adjacent nodes receives different colors. But the Grundy and b-coloring executes maximum colors under certain restrictions. In this paper, Chromatic, b-chromatic and Grundy number of some graph operators of bipartite graph has been investigat

GBS 1.0

DOE Office of Scientific and Technical Information (OSTI.GOV)

2010-09-30

The Umbra gbs (Graph-Based Search) library provides implementations of graph-based search/planning algorithms that can be applied to legacy graph data structures. Unlike some other graph algorithm libraries, this one does not require your graph class to inherit from a specific base class. Implementations of Dijkstra's Algorithm and A-Star search are included and can be used with graphs that are lazily-constructed.

Information visualisation based on graph models

NASA Astrophysics Data System (ADS)

Kasyanov, V. N.; Kasyanova, E. V.

2013-05-01

Information visualisation is a key component of support tools for many applications in science and engineering. A graph is an abstract structure that is widely used to model information for its visualisation. In this paper, we consider practical and general graph formalism called hierarchical graphs and present the Higres and Visual Graph systems aimed at supporting information visualisation on the base of hierarchical graph models.

Polysemy in the Domain-Specific Pedagogical Use of Graphs in Science Textbooks: The Case of an Electrocardiogram

ERIC Educational Resources Information Center

van Eijck, Michiel; Goedhart, Martin J.; Ellermeijer, Ton

2011-01-01

Polysemy in graph-related practices is the phenomenon that a single graph can sustain different meanings assigned to it. Considerable research has been done on polysemy in graph-related practices in school science in which graphs are rather used as scientific tools. However, graphs in science textbooks are also used rather pedagogically to…

Lamplighter groups, de Brujin graphs, spider-web graphs and their spectra

NASA Astrophysics Data System (ADS)

Grigorchuk, R.; Leemann, P.-H.; Nagnibeda, T.

2016-05-01

We study the infinite family of spider-web graphs \\{{{ S }}k,N,M\\}, k≥slant 2, N≥slant 0 and M≥slant 1, initiated in the 50s in the context of network theory. It was later shown in physical literature that these graphs have remarkable percolation and spectral properties. We provide a mathematical explanation of these properties by putting the spider-web graphs in the context of group theory and algebraic graph theory. Namely, we realize them as tensor products of the well-known de Bruijn graphs \\{{{ B }}k,N\\} with cyclic graphs \\{{C}M\\} and show that these graphs are described by the action of the lamplighter group {{ L }}k={Z}/k{Z}\\wr {Z} on the infinite binary tree. Our main result is the identification of the infinite limit of \\{{{ S }}k,N,M\\}, as N,M\\to ∞ , with the Cayley graph of the lamplighter group {{ L }}k which, in turn, is one of the famous Diestel-Leader graphs {{DL}}k,k. As an application we compute the spectra of all spider-web graphs and show their convergence to the discrete spectral distribution associated with the Laplacian on the lamplighter group.

New methods for analyzing semantic graph based assessments in science education

NASA Astrophysics Data System (ADS)

Vikaros, Lance Steven

This research investigated how the scoring of semantic graphs (known by many as concept maps) could be improved and automated in order to address issues of inter-rater reliability and scalability. As part of the NSF funded SENSE-IT project to introduce secondary school science students to sensor networks (NSF Grant No. 0833440), semantic graphs illustrating how temperature change affects water ecology were collected from 221 students across 16 schools. The graphing task did not constrain students' use of terms, as is often done with semantic graph based assessment due to coding and scoring concerns. The graphing software used provided real-time feedback to help students learn how to construct graphs, stay on topic and effectively communicate ideas. The collected graphs were scored by human raters using assessment methods expected to boost reliability, which included adaptations of traditional holistic and propositional scoring methods, use of expert raters, topical rubrics, and criterion graphs. High levels of inter-rater reliability were achieved, demonstrating that vocabulary constraints may not be necessary after all. To investigate a new approach to automating the scoring of graphs, thirty-two different graph features characterizing graphs' structure, semantics, configuration and process of construction were then used to predict human raters' scoring of graphs in order to identify feature patterns correlated to raters' evaluations of graphs' topical accuracy and complexity. Results led to the development of a regression model able to predict raters' scoring with 77% accuracy, with 46% accuracy expected when used to score new sets of graphs, as estimated via cross-validation tests. Although such performance is comparable to other graph and essay based scoring systems, cross-context testing of the model and methods used to develop it would be needed before it could be recommended for widespread use. Still, the findings suggest techniques for improving the reliability and scalability of semantic graph based assessments without requiring constraint of how ideas are expressed.

EvoGraph: On-The-Fly Efficient Mining of Evolving Graphs on GPU

DOE Office of Scientific and Technical Information (OSTI.GOV)

Sengupta, Dipanjan; Song, Shuaiwen

With the prevalence of the World Wide Web and social networks, there has been a growing interest in high performance analytics for constantly-evolving dynamic graphs. Modern GPUs provide massive AQ1 amount of parallelism for efficient graph processing, but the challenges remain due to their lack of support for the near real-time streaming nature of dynamic graphs. Specifically, due to the current high volume and velocity of graph data combined with the complexity of user queries, traditional processing methods by first storing the updates and then repeatedly running static graph analytics on a sequence of versions or snapshots are deemed undesirablemore » and computational infeasible on GPU. We present EvoGraph, a highly efficient and scalable GPU- based dynamic graph analytics framework.« less

Genome alignment with graph data structures: a comparison

PubMed Central

2014-01-01

Background Recent advances in rapid, low-cost sequencing have opened up the opportunity to study complete genome sequences. The computational approach of multiple genome alignment allows investigation of evolutionarily related genomes in an integrated fashion, providing a basis for downstream analyses such as rearrangement studies and phylogenetic inference. Graphs have proven to be a powerful tool for coping with the complexity of genome-scale sequence alignments. The potential of graphs to intuitively represent all aspects of genome alignments led to the development of graph-based approaches for genome alignment. These approaches construct a graph from a set of local alignments, and derive a genome alignment through identification and removal of graph substructures that indicate errors in the alignment. Results We compare the structures of commonly used graphs in terms of their abilities to represent alignment information. We describe how the graphs can be transformed into each other, and identify and classify graph substructures common to one or more graphs. Based on previous approaches, we compile a list of modifications that remove these substructures. Conclusion We show that crucial pieces of alignment information, associated with inversions and duplications, are not visible in the structure of all graphs. If we neglect vertex or edge labels, the graphs differ in their information content. Still, many ideas are shared among all graph-based approaches. Based on these findings, we outline a conceptual framework for graph-based genome alignment that can assist in the development of future genome alignment tools. PMID:24712884

Efficient dynamic graph construction for inductive semi-supervised learning.

PubMed

Dornaika, F; Dahbi, R; Bosaghzadeh, A; Ruichek, Y

2017-10-01

Most of graph construction techniques assume a transductive setting in which the whole data collection is available at construction time. Addressing graph construction for inductive setting, in which data are coming sequentially, has received much less attention. For inductive settings, constructing the graph from scratch can be very time consuming. This paper introduces a generic framework that is able to make any graph construction method incremental. This framework yields an efficient and dynamic graph construction method that adds new samples (labeled or unlabeled) to a previously constructed graph. As a case study, we use the recently proposed Two Phase Weighted Regularized Least Square (TPWRLS) graph construction method. The paper has two main contributions. First, we use the TPWRLS coding scheme to represent new sample(s) with respect to an existing database. The representative coefficients are then used to update the graph affinity matrix. The proposed method not only appends the new samples to the graph but also updates the whole graph structure by discovering which nodes are affected by the introduction of new samples and by updating their edge weights. The second contribution of the article is the application of the proposed framework to the problem of graph-based label propagation using multiple observations for vision-based recognition tasks. Experiments on several image databases show that, without any significant loss in the accuracy of the final classification, the proposed dynamic graph construction is more efficient than the batch graph construction. Copyright © 2017 Elsevier Ltd. All rights reserved.

Chemical Applications of Graph Theory: Part II. Isomer Enumeration.

ERIC Educational Resources Information Center

Hansen, Peter J.; Jurs, Peter C.

1988-01-01

Discusses the use of graph theory to aid in the depiction of organic molecular structures. Gives a historical perspective of graph theory and explains graph theory terminology with organic examples. Lists applications of graph theory to current research projects. (ML)

Ancient genomic architecture for mammalian olfactory receptor clusters

PubMed Central

Aloni, Ronny; Olender, Tsviya; Lancet, Doron

2006-01-01

Background Mammalian olfactory receptor (OR) genes reside in numerous genomic clusters of up to several dozen genes. Whole-genome sequence alignment nets of five mammals allow their comprehensive comparison, aimed at reconstructing the ancestral olfactory subgenome. Results We developed a new and general tool for genome-wide definition of genomic gene clusters conserved in multiple species. Syntenic orthologs, defined as gene pairs showing conservation of both genomic location and coding sequence, were subjected to a graph theory algorithm for discovering CLICs (clusters in conservation). When applied to ORs in five mammals, including the marsupial opossum, more than 90% of the OR genes were found within a framework of 48 multi-species CLICs, invoking a general conservation of gene order and composition. A detailed analysis of individual CLICs revealed multiple differences among species, interpretable through species-specific genomic rearrangements and reflecting complex mammalian evolutionary dynamics. One significant instance involves CLIC #1, which lacks a human member, implying the human-specific deletion of an OR cluster, whose mouse counterpart has been tentatively associated with isovaleric acid odorant detection. Conclusion The identified multi-species CLICs demonstrate that most of the mammalian OR clusters have a common ancestry, preceding the split between marsupials and placental mammals. However, only two of these CLICs were capable of incorporating chicken OR genes, parsimoniously implying that all other CLICs emerged subsequent to the avian-mammalian divergence. PMID:17010214

Graphing trillions of triangles

PubMed Central

Burkhardt, Paul

2016-01-01

The increasing size of Big Data is often heralded but how data are transformed and represented is also profoundly important to knowledge discovery, and this is exemplified in Big Graph analytics. Much attention has been placed on the scale of the input graph but the product of a graph algorithm can be many times larger than the input. This is true for many graph problems, such as listing all triangles in a graph. Enabling scalable graph exploration for Big Graphs requires new approaches to algorithms, architectures, and visual analytics. A brief tutorial is given to aid the argument for thoughtful representation of data in the context of graph analysis. Then a new algebraic method to reduce the arithmetic operations in counting and listing triangles in graphs is introduced. Additionally, a scalable triangle listing algorithm in the MapReduce model will be presented followed by a description of the experiments with that algorithm that led to the current largest and fastest triangle listing benchmarks to date. Finally, a method for identifying triangles in new visual graph exploration technologies is proposed. PMID:28690426

Exploring Text and Icon Graph Interpretation in Students with Dyslexia: An Eye-tracking Study.

PubMed

Kim, Sunjung; Wiseheart, Rebecca

2017-02-01

A growing body of research suggests that individuals with dyslexia struggle to use graphs efficiently. Given the persistence of orthographic processing deficits in dyslexia, this study tested whether graph interpretation deficits in dyslexia are directly related to difficulties processing the orthographic components of graphs (i.e. axes and legend labels). Participants were 80 college students with and without dyslexia. Response times and eye movements were recorded as students answered comprehension questions about simple data displayed in bar graphs. Axes and legends were labelled either with words (mixed-modality graphs) or icons (orthography-free graphs). Students also answered informationally equivalent questions presented in sentences (orthography-only condition). Response times were slower in the dyslexic group only for processing sentences. However, eye tracking data revealed group differences for processing mixed-modality graphs, whereas no group differences were found for the orthography-free graphs. When processing bar graphs, students with dyslexia differ from their able reading peers only when graphs contain orthographic features. Implications for processing informational text are discussed. Copyright © 2017 John Wiley & Sons, Ltd. Copyright © 2017 John Wiley & Sons, Ltd.

featsel: A framework for benchmarking of feature selection algorithms and cost functions

NASA Astrophysics Data System (ADS)

Reis, Marcelo S.; Estrela, Gustavo; Ferreira, Carlos Eduardo; Barrera, Junior

In this paper, we introduce featsel, a framework for benchmarking of feature selection algorithms and cost functions. This framework allows the user to deal with the search space as a Boolean lattice and has its core coded in C++ for computational efficiency purposes. Moreover, featsel includes Perl scripts to add new algorithms and/or cost functions, generate random instances, plot graphs and organize results into tables. Besides, this framework already comes with dozens of algorithms and cost functions for benchmarking experiments. We also provide illustrative examples, in which featsel outperforms the popular Weka workbench in feature selection procedures on data sets from the UCI Machine Learning Repository.

Towards noncontact skin melanoma selection by multispectral imaging analysis.

PubMed

Kuzmina, Ilona; Diebele, Ilze; Jakovels, Dainis; Spigulis, Janis; Valeine, Lauma; Kapostinsh, Janis; Berzina, Anna

2011-06-01

A clinical trial comprising 334 pigmented and vascular lesions has been performed in three Riga clinics by means of multispectral imaging analysis. The imaging system Nuance 2.4 (CRi) and self-developed software for mapping of the main skin chromophores were used. Specific features were observed and analyzed for malignant skin melanomas: notably higher absorbance (especially as the difference of optical density relative to the healthy skin), uneven chromophore distribution over the lesion area, and the possibility to select the "melanoma areas" in the correlation graphs of chromophores. The obtained results indicate clinical potential of this technology for noncontact selection of melanoma from other pigmented and vascular skin lesions.

Learning about Science Graphs and Word Games. Superific Science Book V. A Good Apple Science Activity Book for Grades 5-8+.

ERIC Educational Resources Information Center

Conway, Lorraine

This packet of student materials contains a variety of worksheet activities dealing with science graphs and science word games. These reproducible materials deal with: (1) bar graphs; (2) line graphs; (3) circle graphs; (4) pictographs; (5) histograms; (6) artgraphs; (7) designing your own graphs; (8) medical prefixes; (9) color prefixes; (10)…

TrajGraph: A Graph-Based Visual Analytics Approach to Studying Urban Network Centralities Using Taxi Trajectory Data.

PubMed

Huang, Xiaoke; Zhao, Ye; Yang, Jing; Zhang, Chong; Ma, Chao; Ye, Xinyue

2016-01-01

We propose TrajGraph, a new visual analytics method, for studying urban mobility patterns by integrating graph modeling and visual analysis with taxi trajectory data. A special graph is created to store and manifest real traffic information recorded by taxi trajectories over city streets. It conveys urban transportation dynamics which can be discovered by applying graph analysis algorithms. To support interactive, multiscale visual analytics, a graph partitioning algorithm is applied to create region-level graphs which have smaller size than the original street-level graph. Graph centralities, including Pagerank and betweenness, are computed to characterize the time-varying importance of different urban regions. The centralities are visualized by three coordinated views including a node-link graph view, a map view and a temporal information view. Users can interactively examine the importance of streets to discover and assess city traffic patterns. We have implemented a fully working prototype of this approach and evaluated it using massive taxi trajectories of Shenzhen, China. TrajGraph's capability in revealing the importance of city streets was evaluated by comparing the calculated centralities with the subjective evaluations from a group of drivers in Shenzhen. Feedback from a domain expert was collected. The effectiveness of the visual interface was evaluated through a formal user study. We also present several examples and a case study to demonstrate the usefulness of TrajGraph in urban transportation analysis.

Multiscale Feature Analysis of Salivary Gland Branching Morphogenesis

PubMed Central

Baydil, Banu; Daley, William P.; Larsen, Melinda; Yener, Bülent

2012-01-01

Pattern formation in developing tissues involves dynamic spatio-temporal changes in cellular organization and subsequent evolution of functional adult structures. Branching morphogenesis is a developmental mechanism by which patterns are generated in many developing organs, which is controlled by underlying molecular pathways. Understanding the relationship between molecular signaling, cellular behavior and resulting morphological change requires quantification and categorization of the cellular behavior. In this study, tissue-level and cellular changes in developing salivary gland in response to disruption of ROCK-mediated signaling by are modeled by building cell-graphs to compute mathematical features capturing structural properties at multiple scales. These features were used to generate multiscale cell-graph signatures of untreated and ROCK signaling disrupted salivary gland organ explants. From confocal images of mouse submandibular salivary gland organ explants in which epithelial and mesenchymal nuclei were marked, a multiscale feature set capturing global structural properties, local structural properties, spectral, and morphological properties of the tissues was derived. Six feature selection algorithms and multiway modeling of the data was performed to identify distinct subsets of cell graph features that can uniquely classify and differentiate between different cell populations. Multiscale cell-graph analysis was most effective in classification of the tissue state. Cellular and tissue organization, as defined by a multiscale subset of cell-graph features, are both quantitatively distinct in epithelial and mesenchymal cell types both in the presence and absence of ROCK inhibitors. Whereas tensor analysis demonstrate that epithelial tissue was affected the most by inhibition of ROCK signaling, significant multiscale changes in mesenchymal tissue organization were identified with this analysis that were not identified in previous biological studies. We here show how to define and calculate a multiscale feature set as an effective computational approach to identify and quantify changes at multiple biological scales and to distinguish between different states in developing tissues. PMID:22403724

Graphing Polar Curves

ERIC Educational Resources Information Center

Lawes, Jonathan F.

2013-01-01

Graphing polar curves typically involves a combination of three traditional techniques, all of which can be time-consuming and tedious. However, an alternative method--graphing the polar function on a rectangular plane--simplifies graphing, increases student understanding of the polar coordinate system, and reinforces graphing techniques learned…

On the locating-chromatic number for graphs with two homogenous components

NASA Astrophysics Data System (ADS)

Welyyanti, Des; Baskoro, Edy Tri; Simajuntak, Rinovia; Uttunggadewa, Saladin

2017-10-01

The locating-chromatic number of a graph was introduced by Chartrand et al. in 2002. The concept of the locating-chromatic number is a marriage between graph coloring and the notion of graph partition dimension. This concept is only for connected graphs. In [8], we extended this concept also for disconnected graphs. In this paper, we determine the locating- chromatic number of a graph with two components. In particular, we determine such values if the components are homogeneous and each component has locating-chromatic number 3.

Type III Effector Diversification via Both Pathoadaptation and Horizontal Transfer in Response to a Coevolutionary Arms Race

PubMed Central

Ma, Wenbo; Dong, Frederick F. T; Stavrinides, John; Guttman, David S

2006-01-01

The concept of the coevolutionary arms race holds a central position in our understanding of pathogen–host interactions. Here we identify the molecular mechanisms and follow the stepwise progression of an arms race in a natural system. We show how the evolution and function of the HopZ family of type III secreted effector proteins carried by the plant pathogen Pseudomonas syringae are influenced by a coevolutionary arms race between pathogen and host. We surveyed 96 isolates of P. syringae and identified three homologs (HopZ1, HopZ2, and HopZ3) distributed among ∼45% of the strains. All alleles were sequenced and their expression was confirmed. Evolutionary analyses determined that the diverse HopZ1 homologs are ancestral to P. syringae, and have diverged via pathoadaptive mutational changes into three functional and two degenerate forms, while HopZ2 and HopZ3 have been brought into P. syringae via horizontal transfer from other ecologically similar bacteria. A PAML selection analysis revealed that the C terminus of HopZ1 is under strong positive selection. Despite the extensive genetic variation observed in this family, all three homologs have cysteine–protease activity, although their substrate specificity may vary. The introduction of the ancestral hopZ1 allele into strains harboring alternate alleles results in a resistance protein-mediated defense response in their respective hosts, which is not observed with the endogenous allele. These data indicate that the P. syringae HopZ family has undergone allelic diversification via both pathoadaptive mutational changes and horizontal transfer in response to selection imposed by the host defense system. This genetic diversity permits the pathogen to avoid host defenses while still maintaining a virulence-associated protease, thereby allowing it to thrive on its current host, while simultaneously impacting its host range. PMID:17194219

Basic emotions and adaptation. A computational and evolutionary model.

PubMed

Pacella, Daniela; Ponticorvo, Michela; Gigliotta, Onofrio; Miglino, Orazio

2017-01-01

The core principles of the evolutionary theories of emotions declare that affective states represent crucial drives for action selection in the environment and regulated the behavior and adaptation of natural agents in ancestrally recurrent situations. While many different studies used autonomous artificial agents to simulate emotional responses and the way these patterns can affect decision-making, few are the approaches that tried to analyze the evolutionary emergence of affective behaviors directly from the specific adaptive problems posed by the ancestral environment. A model of the evolution of affective behaviors is presented using simulated artificial agents equipped with neural networks and physically inspired on the architecture of the iCub humanoid robot. We use genetic algorithms to train populations of virtual robots across generations, and investigate the spontaneous emergence of basic emotional behaviors in different experimental conditions. In particular, we focus on studying the emotion of fear, therefore the environment explored by the artificial agents can contain stimuli that are safe or dangerous to pick. The simulated task is based on classical conditioning and the agents are asked to learn a strategy to recognize whether the environment is safe or represents a threat to their lives and select the correct action to perform in absence of any visual cues. The simulated agents have special input units in their neural structure whose activation keep track of their actual "sensations" based on the outcome of past behavior. We train five different neural network architectures and then test the best ranked individuals comparing their performances and analyzing the unit activations in each individual's life cycle. We show that the agents, regardless of the presence of recurrent connections, spontaneously evolved the ability to cope with potentially dangerous environment by collecting information about the environment and then switching their behavior to a genetically selected pattern in order to maximize the possible reward. We also prove the determinant presence of an internal time perception unit for the robots to achieve the highest performance and survivability across all conditions.

Phosphoenolpyruvate carboxykinase 1 gene (Pck1) displays parallel evolution between Old World and New World fruit bats.

PubMed

Zhu, Lei; Yin, Qiuyuan; Irwin, David M; Zhang, Shuyi

2015-01-01

Bats are an ideal mammalian group for exploring adaptations to fasting due to their large variety of diets and because fasting is a regular part of their life cycle. Mammals fed on a carbohydrate-rich diet experience a rapid decrease in blood glucose levels during a fast, thus, the development of mechanisms to resist the consequences of regular fasts, experienced on a daily basis, must have been crucial in the evolution of frugivorous bats. Phosphoenolpyruvate carboxykinase 1 (PEPCK1, encoded by the Pck1 gene) is the rate-limiting enzyme in gluconeogenesis and is largely responsible for the maintenance of glucose homeostasis during fasting in fruit-eating bats. To test whether Pck1 has experienced adaptive evolution in frugivorous bats, we obtained Pck1 coding sequence from 20 species of bats, including five Old World fruit bats (OWFBs) (Pteropodidae) and two New World fruit bats (NWFBs) (Phyllostomidae). Our molecular evolutionary analyses of these sequences revealed that Pck1 was under purifying selection in both Old World and New World fruit bats with no evidence of positive selection detected in either ancestral branch leading to fruit bats. Interestingly, however, six specific amino acid substitutions were detected on the ancestral lineage of OWFBs. In addition, we found considerable evidence for parallel evolution, at the amino acid level, between the PEPCK1 sequences of Old World fruit bats and New World fruit bats. Test for parallel evolution showed that four parallel substitutions (Q276R, R503H, I558V and Q593R) were driven by natural selection. Our study provides evidence that Pck1 underwent parallel evolution between Old World and New World fruit bats, two lineages of mammals that feed on a carbohydrate-rich diet and experience regular periods of fasting as part of their life cycle.

Phosphoenolpyruvate Carboxykinase 1 Gene (Pck1) Displays Parallel Evolution between Old World and New World Fruit Bats

PubMed Central

Irwin, David M.; Zhang, Shuyi

2015-01-01

Bats are an ideal mammalian group for exploring adaptations to fasting due to their large variety of diets and because fasting is a regular part of their life cycle. Mammals fed on a carbohydrate-rich diet experience a rapid decrease in blood glucose levels during a fast, thus, the development of mechanisms to resist the consequences of regular fasts, experienced on a daily basis, must have been crucial in the evolution of frugivorous bats. Phosphoenolpyruvate carboxykinase 1 (PEPCK1, encoded by the Pck1 gene) is the rate-limiting enzyme in gluconeogenesis and is largely responsible for the maintenance of glucose homeostasis during fasting in fruit-eating bats. To test whether Pck1 has experienced adaptive evolution in frugivorous bats, we obtained Pck1 coding sequence from 20 species of bats, including five Old World fruit bats (OWFBs) (Pteropodidae) and two New World fruit bats (NWFBs) (Phyllostomidae). Our molecular evolutionary analyses of these sequences revealed that Pck1 was under purifying selection in both Old World and New World fruit bats with no evidence of positive selection detected in either ancestral branch leading to fruit bats. Interestingly, however, six specific amino acid substitutions were detected on the ancestral lineage of OWFBs. In addition, we found considerable evidence for parallel evolution, at the amino acid level, between the PEPCK1 sequences of Old World fruit bats and New World fruit bats. Test for parallel evolution showed that four parallel substitutions (Q276R, R503H, I558V and Q593R) were driven by natural selection. Our study provides evidence that Pck1 underwent parallel evolution between Old World and New World fruit bats, two lineages of mammals that feed on a carbohydrate-rich diet and experience regular periods of fasting as part of their life cycle. PMID:25807515

Enabling Graph Mining in RDF Triplestores using SPARQL for Holistic In-situ Graph Analysis

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lee, Sangkeun; Sukumar, Sreenivas R; Hong, Seokyong

The graph analysis is now considered as a promising technique to discover useful knowledge in data with a new perspective. We envi- sion that there are two dimensions of graph analysis: OnLine Graph Analytic Processing (OLGAP) and Graph Mining (GM) where each respectively focuses on subgraph pattern matching and automatic knowledge discovery in graph. Moreover, as these two dimensions aim to complementarily solve complex problems, holistic in-situ graph analysis which covers both OLGAP and GM in a single system is critical for minimizing the burdens of operating multiple graph systems and transferring intermediate result-sets between those systems. Nevertheless, most existingmore » graph analysis systems are only capable of one dimension of graph analysis. In this work, we take an approach to enabling GM capabilities (e.g., PageRank, connected-component analysis, node eccentricity, etc.) in RDF triplestores, which are originally developed to store RDF datasets and provide OLGAP capability. More specifically, to achieve our goal, we implemented six representative graph mining algorithms using SPARQL. The approach allows a wide range of available RDF data sets directly applicable for holistic graph analysis within a system. For validation of our approach, we evaluate performance of our implementations with nine real-world datasets and three different computing environments - a laptop computer, an Amazon EC2 instance, and a shared-memory Cray XMT2 URIKA-GD graph-processing appliance. The experimen- tal results show that our implementation can provide promising and scalable performance for real world graph analysis in all tested environments. The developed software is publicly available in an open-source project that we initiated.« less

The impact of home care nurses' numeracy and graph literacy on comprehension of visual display information: implications for dashboard design.

PubMed

Dowding, Dawn; Merrill, Jacqueline A; Onorato, Nicole; Barrón, Yolanda; Rosati, Robert J; Russell, David

2018-02-01

To explore home care nurses' numeracy and graph literacy and their relationship to comprehension of visualized data. A multifactorial experimental design using online survey software. Nurses were recruited from 2 Medicare-certified home health agencies. Numeracy and graph literacy were measured using validated scales. Nurses were randomized to 1 of 4 experimental conditions. Each condition displayed data for 1 of 4 quality indicators, in 1 of 4 different visualized formats (bar graph, line graph, spider graph, table). A mixed linear model measured the impact of numeracy, graph literacy, and display format on data understanding. In all, 195 nurses took part in the study. They were slightly more numerate and graph literate than the general population. Overall, nurses understood information presented in bar graphs most easily (88% correct), followed by tables (81% correct), line graphs (77% correct), and spider graphs (41% correct). Individuals with low numeracy and low graph literacy had poorer comprehension of information displayed across all formats. High graph literacy appeared to enhance comprehension of data regardless of numeracy capabilities. Clinical dashboards are increasingly used to provide information to clinicians in visualized format, under the assumption that visual display reduces cognitive workload. Results of this study suggest that nurses' comprehension of visualized information is influenced by their numeracy, graph literacy, and the display format of the data. Individual differences in numeracy and graph literacy skills need to be taken into account when designing dashboard technology. © The Author 2017. Published by Oxford University Press on behalf of the American Medical Informatics Association. All rights reserved. For Permissions, please email: journals.permissions@oup.com

GenoLink: a graph-based querying and browsing system for investigating the function of genes and proteins.

PubMed

Durand, Patrick; Labarre, Laurent; Meil, Alain; Divo, Jean-Louis; Vandenbrouck, Yves; Viari, Alain; Wojcik, Jérôme

2006-01-17

A large variety of biological data can be represented by graphs. These graphs can be constructed from heterogeneous data coming from genomic and post-genomic technologies, but there is still need for tools aiming at exploring and analysing such graphs. This paper describes GenoLink, a software platform for the graphical querying and exploration of graphs. GenoLink provides a generic framework for representing and querying data graphs. This framework provides a graph data structure, a graph query engine, allowing to retrieve sub-graphs from the entire data graph, and several graphical interfaces to express such queries and to further explore their results. A query consists in a graph pattern with constraints attached to the vertices and edges. A query result is the set of all sub-graphs of the entire data graph that are isomorphic to the pattern and satisfy the constraints. The graph data structure does not rely upon any particular data model but can dynamically accommodate for any user-supplied data model. However, for genomic and post-genomic applications, we provide a default data model and several parsers for the most popular data sources. GenoLink does not require any programming skill since all operations on graphs and the analysis of the results can be carried out graphically through several dedicated graphical interfaces. GenoLink is a generic and interactive tool allowing biologists to graphically explore various sources of information. GenoLink is distributed either as a standalone application or as a component of the Genostar/Iogma platform. Both distributions are free for academic research and teaching purposes and can be requested at academy@genostar.com. A commercial licence form can be obtained for profit company at info@genostar.com. See also http://www.genostar.org.

GenoLink: a graph-based querying and browsing system for investigating the function of genes and proteins

PubMed Central

Durand, Patrick; Labarre, Laurent; Meil, Alain; Divo1, Jean-Louis; Vandenbrouck, Yves; Viari, Alain; Wojcik, Jérôme

2006-01-01

Background A large variety of biological data can be represented by graphs. These graphs can be constructed from heterogeneous data coming from genomic and post-genomic technologies, but there is still need for tools aiming at exploring and analysing such graphs. This paper describes GenoLink, a software platform for the graphical querying and exploration of graphs. Results GenoLink provides a generic framework for representing and querying data graphs. This framework provides a graph data structure, a graph query engine, allowing to retrieve sub-graphs from the entire data graph, and several graphical interfaces to express such queries and to further explore their results. A query consists in a graph pattern with constraints attached to the vertices and edges. A query result is the set of all sub-graphs of the entire data graph that are isomorphic to the pattern and satisfy the constraints. The graph data structure does not rely upon any particular data model but can dynamically accommodate for any user-supplied data model. However, for genomic and post-genomic applications, we provide a default data model and several parsers for the most popular data sources. GenoLink does not require any programming skill since all operations on graphs and the analysis of the results can be carried out graphically through several dedicated graphical interfaces. Conclusion GenoLink is a generic and interactive tool allowing biologists to graphically explore various sources of information. GenoLink is distributed either as a standalone application or as a component of the Genostar/Iogma platform. Both distributions are free for academic research and teaching purposes and can be requested at academy@genostar.com. A commercial licence form can be obtained for profit company at info@genostar.com. See also . PMID:16417636

Enabling Graph Mining in RDF Triplestores using SPARQL for Holistic In-situ Graph Analysis

DOE PAGES

Lee, Sangkeun; Sukumar, Sreenivas R; Hong, Seokyong; ...

2016-01-01

The graph analysis is now considered as a promising technique to discover useful knowledge in data with a new perspective. We envi- sion that there are two dimensions of graph analysis: OnLine Graph Analytic Processing (OLGAP) and Graph Mining (GM) where each respectively focuses on subgraph pattern matching and automatic knowledge discovery in graph. Moreover, as these two dimensions aim to complementarily solve complex problems, holistic in-situ graph analysis which covers both OLGAP and GM in a single system is critical for minimizing the burdens of operating multiple graph systems and transferring intermediate result-sets between those systems. Nevertheless, most existingmore » graph analysis systems are only capable of one dimension of graph analysis. In this work, we take an approach to enabling GM capabilities (e.g., PageRank, connected-component analysis, node eccentricity, etc.) in RDF triplestores, which are originally developed to store RDF datasets and provide OLGAP capability. More specifically, to achieve our goal, we implemented six representative graph mining algorithms using SPARQL. The approach allows a wide range of available RDF data sets directly applicable for holistic graph analysis within a system. For validation of our approach, we evaluate performance of our implementations with nine real-world datasets and three different computing environments - a laptop computer, an Amazon EC2 instance, and a shared-memory Cray XMT2 URIKA-GD graph-processing appliance. The experimen- tal results show that our implementation can provide promising and scalable performance for real world graph analysis in all tested environments. The developed software is publicly available in an open-source project that we initiated.« less