35 results on '"Bryant, David"'
Search Results
2. Giovanni Gabrieli
- Author
-
Bryant, David Douglas
- Subjects
Giovanni Gabrieli ,bibliography ,Settore L-ART/07 - Musicologia e Storia della Musica - Published
- 2017
3. Farsa (opera)
- Author
-
Bryant, David, primary
- Published
- 2002
- Full Text
- View/download PDF
4. Catania
- Author
-
Bryant, David, primary, Ficola, Daniele, additional, and Musumeci, Rosalba, additional
- Published
- 2001
- Full Text
- View/download PDF
5. Lambardi [Lambardo], Girolamo
- Author
-
Nagley, Judith, primary and Bryant, David, additional
- Published
- 2001
- Full Text
- View/download PDF
6. Gabrieli, Giovanni
- Author
-
Bryant, David, primary
- Published
- 2001
- Full Text
- View/download PDF
7. Gabrieli, Andrea
- Author
-
Bryant, David, primary
- Published
- 2001
- Full Text
- View/download PDF
8. Massaino [Massaini], Tiburzio
- Author
-
Bryant, David, primary
- Published
- 2001
- Full Text
- View/download PDF
9. Farsa
- Author
-
Bryant, David, primary
- Published
- 2001
- Full Text
- View/download PDF
10. Villani [Villano], Gabriele
- Author
-
Bryant, David, primary and Bussi, Francesco, additional
- Published
- 2001
- Full Text
- View/download PDF
11. Microbial Phylogenetic Context Using Phylogenetic Outlines.
- Author
-
Bagci C, Bryant D, Cetinkaya B, and Huson DH
- Subjects
- Bacteria genetics, Phylogeny, Algorithms, Genome, Archaeal
- Abstract
Microbial studies typically involve the sequencing and assembly of draft genomes for individual microbes or whole microbiomes. Given a draft genome, one first task is to determine its phylogenetic context, that is, to place it relative to the set of related reference genomes. We provide a new interactive graphical tool that addresses this task using Mash sketches to compare against all bacterial and archaeal representative genomes in the Genome Taxonomy Database taxonomy, all within the framework of SplitsTree5. The phylogenetic context of the query sequences is then displayed as a phylogenetic outline, a new type of phylogenetic network that is more general than a phylogenetic tree, but significantly less complex than other types of phylogenetic networks. We propose to use such networks, rather than trees, to represent phylogenetic context, because they can express uncertainty in the placement of taxa, whereas a tree must always commit to a specific branching pattern. We illustrate the new method using a number of draft genomes of different assembly quality., (© The Author(s) 2021. Published by Oxford University Press on behalf of the Society for Molecular Biology and Evolution.)
- Published
- 2021
- Full Text
- View/download PDF
12. Questioning COVID-19 Surface Stability and Fomite Spreading in Three Aeromedical Cases: A Case Series.
- Author
-
Horoho S, Musik S, Bryant D, Brooks W, and Porter IM
- Subjects
- Disease Outbreaks, Fomites, Humans, SARS-CoV-2, Air Ambulances, COVID-19
- Abstract
It is well established that coronavirus disease 2019 is primarily transmitted through respiratory droplets, and there is mounting research speculation that it may also be transmitted via fomites. Several studies have shown that the virus can persist on both porous and nonporous surfaces for hours to days, depending upon the material. This article examines three cases of polymerase chain reaction-proven severe acute respiratory syndrome coronavirus 2 infection with several additional individuals meeting CDC close contact criteria. In 1 case, 195 downstream contacts were all tested to prevent a mass outbreak in a deployment posture. Analysis of these contacts yielded only a single positive test, which could be reasonably ascribed to respiratory droplet transmission. While these cases and their contacts ultimately represent a small sample size, we suggest fomite spread may not be a significant means of transmission for severe acute respiratory syndrome coronavirus 2 in real-world operational scenarios., (Published by Oxford University Press on behalf of the Association of Military Surgeons of the United States 2020. This work is written by (a) US Government employee(s) and is in the public domain in the US.)
- Published
- 2021
- Full Text
- View/download PDF
13. Bayesian Inference of Species Trees using Diffusion Models.
- Author
-
Stoltz M, Baeumer B, Bouckaert R, Fox C, Hiscott G, and Bryant D
- Subjects
- Bayes Theorem, Computer Simulation, Phylogeny, Probability, Algorithms, Models, Genetic
- Abstract
We describe a new and computationally efficient Bayesian methodology for inferring species trees and demographics from unlinked binary markers. Likelihood calculations are carried out using diffusion models of allele frequency dynamics combined with novel numerical algorithms. The diffusion approach allows for analysis of data sets containing hundreds or thousands of individuals. The method, which we call Snapper, has been implemented as part of the BEAST2 package. We conducted simulation experiments to assess numerical error, computational requirements, and accuracy recovering known model parameters. A reanalysis of soybean SNP data demonstrates that the models implemented in Snapp and Snapper can be difficult to distinguish in practice, a characteristic which we tested with further simulations. We demonstrate the scale of analysis possible using a SNP data set sampled from 399 fresh water turtles in 41 populations. [Bayesian inference; diffusion models; multi-species coalescent; SNP data; species trees; spectral methods.]., (© The Author(s) 2020. Published by Oxford University Press, on behalf of the Society of Systematic Biologists. All rights reserved. For permissions, please email: journals.permissions@oup.com.)
- Published
- 2021
- Full Text
- View/download PDF
14. Failure to Recover Major Events of Gene Flux in Real Biological Data Due to Method Misapplication.
- Author
-
Kapust N, Nelson-Sathi S, Schönfeld B, Hazkani-Covo E, Bryant D, Lockhart PJ, Röttger M, Xavier JC, and Martin WF
- Subjects
- Archaea genetics, Chloroplast Proteins genetics, Eukaryota genetics, Genome, Plastid, Genomics, Models, Genetic, Software, Symbiosis genetics, Validation Studies as Topic, Computational Biology standards, Evolution, Molecular, Gene Transfer, Horizontal, Phylogeny, Plastids classification, Plastids genetics
- Abstract
In prokaryotes, known mechanisms of lateral gene transfer (transformation, transduction, conjugation, and gene transfer agents) generate new combinations of genes among chromosomes during evolution. In eukaryotes, whose host lineage is descended from archaea, lateral gene transfer from organelles to the nucleus occurs at endosymbiotic events. Recent genome analyses studying gene distributions have uncovered evidence for sporadic, discontinuous events of gene transfer from bacteria to archaea during evolution. Other studies have used traditional models designed to investigate gene family size evolution (Count) to support claims that gene transfer to archaea was continuous during evolution, rather than involving occasional periodic mass gene influx events. Here, we show that the methodology used in analyses favoring continuous gene transfers to archaea was misapplied in other studies and does not recover known events of single simultaneous origin for many genes followed by differential loss in real data: plastid genomes. Using the same software and the same settings, we reanalyzed presence/absence pattern data for proteins encoded in plastid genomes and for eukaryotic protein families acquired from plastids. Contrary to expectations under a plastid origin model, we found that the methodology employed inferred that gene acquisitions occurred uniformly across the plant tree. Sometimes as many as nine different acquisitions by plastid DNA were inferred for the same protein family. That is, the methodology that recovered gradual and continuous lateral gene transfer among lineages for archaea obtains the same result for plastids, even though it is known that massive gains followed by gradual differential loss is the true evolutionary process that generated plastid gene distribution data. Our findings caution against the use of models designed to study gene family size evolution for investigating gene transfer processes, especially when transfers involving more than one gene per event are possible.
- Published
- 2018
- Full Text
- View/download PDF
15. Can We "Future-Proof" Consensus Trees?
- Author
-
Bryant D, Francis A, and Steel M
- Subjects
- Algorithms, Biological Evolution, Classification methods, Phylogeny
- Abstract
Consensus methods are widely used for combining phylogenetic trees into a single estimate of the evolutionary tree for a group of species. As more taxa are added, the new source trees may begin to tell a different evolutionary story when restricted to the original set of taxa. However, if the new trees, restricted to the original set of taxa, were to agree exactly with the earlier trees, then we might hope that their consensus would either agree with or resolve the original consensus tree. In this article, we ask under what conditions consensus methods exist that are "future proof" in this sense. While we show that some methods (e.g., Adams consensus) have this property for specific types of input, we also establish a rather surprising "no-go" theorem: there is no "reasonable" consensus method that satisfies the future-proofing property in general. We then investigate a second notion of "future proofing" for consensus methods, in which trees (rather than taxa) are added, and establish some positive and negative results. We end with some questions for future work., (© The Author(s) 2017. Published by Oxford University Press, on behalf of the Society of Systematic Biologists. All rights reserved. For Permissions, please email: journals.permissions@oup.com.)
- Published
- 2017
- Full Text
- View/download PDF
16. Special Issue: Mathematical and Computational Evolutionary Biology-2015.
- Author
-
Bryant D and Gascuel O
- Subjects
- Classification, Congresses as Topic, Biological Evolution, Computational Biology
- Published
- 2017
- Full Text
- View/download PDF
17. Efficient Recycled Algorithms for Quantitative Trait Models on Phylogenies.
- Author
-
Hiscott G, Fox C, Parry M, and Bryant D
- Subjects
- Monte Carlo Method, Phenotype, Algorithms, Fabaceae genetics, Phylogeny, Quantitative Trait Loci genetics
- Abstract
We present an efficient and flexible method for computing likelihoods for phenotypic traits on a phylogeny. The method does not resort to Monte Carlo computation but instead blends Felsenstein's discrete character pruning algorithm with methods for numerical quadrature. It is not limited to Gaussian models and adapts readily to model uncertainty in the observed trait values. We demonstrate the framework by developing efficient algorithms for likelihood calculation and ancestral state reconstruction under Wright's threshold model, applying our methods to a data set of trait data for extrafloral nectaries across a phylogeny of 839 Fabales species., (© The Author(s) 2016. Published by Oxford University Press on behalf of the Society for Molecular Biology and Evolution.)
- Published
- 2016
- Full Text
- View/download PDF
18. Phase II double-blind placebo-controlled randomized study of armodafinil for brain radiation-induced fatigue.
- Author
-
Page BR, Shaw EG, Lu L, Bryant D, Grisell D, Lesser GJ, Monitto DC, Naughton MJ, Rapp SR, Savona SR, Shah S, Case D, and Chan MD
- Subjects
- Adult, Aged, Benzhydryl Compounds administration & dosage, Benzhydryl Compounds adverse effects, Double-Blind Method, Fatigue etiology, Female, Glioblastoma radiotherapy, Humans, Male, Meningioma radiotherapy, Middle Aged, Modafinil, Quality of Life, Treatment Outcome, Benzhydryl Compounds therapeutic use, Brain Neoplasms radiotherapy, Fatigue prevention & control, Glioblastoma complications, Meningioma complications, Radiotherapy adverse effects, Wakefulness-Promoting Agents therapeutic use
- Abstract
Background: Common acute-term side effects of brain radiotherapy (RT) include fatigue, drowsiness, decreased physical functioning, and decreased quality of life (QOL). We hypothesized that armodafinil (a wakefulness-promoting drug known to reduce fatigue and increase cognitive function in breast cancer patients receiving chemotherapy) would result in reduced fatigue and sleepiness for patients receiving brain RT., Methods: A phase II, multi-institutional, placebo-controlled randomized trial assessed feasibility of armodafinil 150 mg/day in participants receiving brain RT, from whom we obtained estimates of variability for fatigue, sleepiness, QOL, cognitive function, and treatment effect., Results: From September 20, 2010, to October 20, 2012, 54 participants enrolled with 80% retention and 94% self-reported compliance. There were no grade 4-5 toxicities, and the incidence of grade 2-3 toxicities was similar between treatment arms, the most common of which were anxiety and nausea (15%), headaches (19%), and insomnia (20%). There were no statistically significant differences in end-RT or 4 week post-RT outcomes between armodafinil and placebo in any outcomes (Functional Assessment of Chronic Illness Therapy [FACIT]-Fatigue, Brief Fatigue Inventory, Epworth Sleepiness Scale, FACT-Brain, and FACIT-cognitive function). However, in participants with more baseline fatigue, those treated with armodafinil did better than those who received the placebo on the end-RT assessments for several outcomes., Conclusion: Armodafinil 150 mg/day was well tolerated in primary brain tumor patients undergoing RT with good compliance. While there was no overall significant effect on fatigue, those with greater baseline fatigue experienced improved QOL and reduced fatigue when using armodafinil. These data suggest that a prospective, phase III randomized trial is warranted for patients with greater baseline fatigue., (© The Author(s) 2015. Published by Oxford University Press on behalf of the Society for Neuro-Oncology. All rights reserved. For permissions, please e-mail: journals.permissions@oup.com.)
- Published
- 2015
- Full Text
- View/download PDF
19. Monte Carlo Strategies for Selecting Parameter Values in Simulation Experiments.
- Author
-
Leigh JW and Bryant D
- Subjects
- Algorithms, Classification methods, Computer Simulation, Monte Carlo Method, Phylogeny
- Abstract
Simulation experiments are used widely throughout evolutionary biology and bioinformatics to compare models, promote methods, and test hypotheses. The biggest practical constraint on simulation experiments is the computational demand, particularly as the number of parameters increases. Given the extraordinary success of Monte Carlo methods for conducting inference in phylogenetics, and indeed throughout the sciences, we investigate ways in which Monte Carlo framework can be used to carry out simulation experiments more efficiently. The key idea is to sample parameter values for the experiments, rather than iterate through them exhaustively. Exhaustive analyses become completely infeasible when the number of parameters gets too large, whereas sampled approaches can fare better in higher dimensions. We illustrate the framework with applications to phylogenetics and genetic archaeology., (© The Author(s) 2015. Published by Oxford University Press, on behalf of the Society of Systematic Biologists. All rights reserved. For Permissions, please email: journals.permissions@oup.com.)
- Published
- 2015
- Full Text
- View/download PDF
20. How good are indirect tests at detecting recombination in human mtDNA?
- Author
-
White DJ, Bryant D, and Gemmell NJ
- Subjects
- Evolution, Molecular, Humans, Linkage Disequilibrium, DNA, Mitochondrial genetics, Mitochondria genetics, Recombination, Genetic
- Abstract
Empirical proof of human mitochondrial DNA (mtDNA) recombination in somatic tissues was obtained in 2004; however, a lack of irrefutable evidence exists for recombination in human mtDNA at the population level. Our inability to demonstrate convincingly a signal of recombination in population data sets of human mtDNA sequence may be due, in part, to the ineffectiveness of current indirect tests. Previously, we tested some well-established indirect tests of recombination (linkage disequilibrium vs. distance using D' and r(2), Homoplasy Test, Pairwise Homoplasy Index, Neighborhood Similarity Score, and Max χ(2)) on sequence data derived from the only empirically confirmed case of human mtDNA recombination thus far and demonstrated that some methods were unable to detect recombination. Here, we assess the performance of these six well-established tests and explore what characteristics specific to human mtDNA sequence may affect their efficacy by simulating sequence under various parameters with levels of recombination (ρ) that vary around an empirically derived estimate for human mtDNA (population parameter ρ = 5.492). No test performed infallibly under any of our scenarios, and error rates varied across tests, whereas detection rates increased substantially with ρ values > 5.492. Under a model of evolution that incorporates parameters specific to human mtDNA, including rate heterogeneity, population expansion, and ρ = 5.492, successful detection rates are limited to a range of 7-70% across tests with an acceptable level of false-positive results: the neighborhood similarity score incompatibility test performed best overall under these parameters. Population growth seems to have the greatest impact on recombination detection probabilities across all models tested, likely due to its impact on sequence diversity. The implications of our findings on our current understanding of mtDNA recombination in humans are discussed.
- Published
- 2013
- Full Text
- View/download PDF
21. Inferring species trees directly from biallelic genetic markers: bypassing gene trees in a full coalescent analysis.
- Author
-
Bryant D, Bouckaert R, Felsenstein J, Rosenberg NA, and RoyChoudhury A
- Subjects
- Algorithms, Amplified Fragment Length Polymorphism Analysis, Computer Simulation, Databases, Genetic, Genetic Markers, Likelihood Functions, New Zealand, Species Specificity, Alleles, Digitalis genetics, Genes, Plant genetics, Phylogeny
- Abstract
The multispecies coalescent provides an elegant theoretical framework for estimating species trees and species demographics from genetic markers. However, practical applications of the multispecies coalescent model are limited by the need to integrate or sample over all gene trees possible for each genetic marker. Here we describe a polynomial-time algorithm that computes the likelihood of a species tree directly from the markers under a finite-sites model of mutation effectively integrating over all possible gene trees. The method applies to independent (unlinked) biallelic markers such as well-spaced single nucleotide polymorphisms, and we have implemented it in SNAPP, a Markov chain Monte Carlo sampler for inferring species trees, divergence dates, and population sizes. We report results from simulation experiments and from an analysis of 1997 amplified fragment length polymorphism loci in 69 individuals sampled from six species of Ourisia (New Zealand native foxglove).
- Published
- 2012
- Full Text
- View/download PDF
22. Genome networks root the tree of life between prokaryotic domains.
- Author
-
Dagan T, Roettger M, Bryant D, and Martin W
- Subjects
- Archaea classification, Archaea genetics, Bacteria classification, Bacteria genetics, Genome, INDEL Mutation, Models, Genetic, Multigene Family, Prokaryotic Cells, Evolution, Molecular, Gene Regulatory Networks, Phylogeny
- Abstract
Eukaryotes arose from prokaryotes, hence the root in the tree of life resides among the prokaryotic domains. The position of the root is still debated, although pinpointing it would aid our understanding of the early evolution of life. Because prokaryote evolution was long viewed as a tree-like process of lineage bifurcations, efforts to identify the most ancient microbial lineage split have traditionally focused on positioning a root on a phylogenetic tree constructed from one or several genes. Such studies have delivered widely conflicting results on the position of the root, this being mainly due to methodological problems inherent to deep gene phylogeny and the workings of lateral gene transfer among prokaryotes over evolutionary time. Here, we report the position of the root determined with whole genome data using network-based procedures that take into account both gene presence or absence and the level of sequence similarity among all individual gene families that are shared across genomes. On the basis of 562,321 protein-coding gene families distributed across 191 genomes, we find that the deepest divide in the prokaryotic world is interdomain, that is, separating the archaebacteria from the eubacteria. This result resonates with some older views but conflicts with the results of most studies over the last decade that have addressed the issue. In particular, several studies have suggested that the molecular distinctness of archaebacteria is not evidence for their antiquity relative to eubacteria but instead stems from some kind of inherently elevated rate of archaebacterial sequence change. Here, we specifically test for such a rate elevation across all prokaryotic lineages through the analysis of all possible quartets among eight genes duplicated in all prokaryotes, hence the last common ancestor thereof. The results show that neither the archaebacteria as a group nor the eubacteria as a group harbor evidence for elevated evolutionary rates in the sampled genes, either in the recent evolutionary past or in their common ancestor. The interdomain prokaryotic position of the root is thus not attributable to lineage-specific rate variation.
- Published
- 2010
- Full Text
- View/download PDF
23. Properties of consensus methods for inferring species trees from gene trees.
- Author
-
Degnan JH, DeGiorgio M, Bryant D, and Rosenberg NA
- Subjects
- Algorithms, Biological Evolution, Genetic Speciation, Computational Biology methods, Models, Genetic, Phylogeny
- Abstract
Consensus methods provide a useful strategy for summarizing information from a collection of gene trees. An important application of consensus methods is to combine gene trees to estimate a species tree. To investigate the theoretical properties of consensus trees that would be obtained from large numbers of loci evolving according to a basic evolutionary model, we construct consensus trees from rooted gene trees that occur in proportion to gene-tree probabilities derived from coalescent theory. We consider majority-rule, rooted triple (R(*)), and greedy consensus trees obtained from known, rooted gene trees, both in the asymptotic case as numbers of gene trees approach infinity and for finite numbers of genes. Our results show that for some combinations of species-tree branch lengths, increasing the number of independent loci can make the rooted majority-rule consensus tree more likely to be at least partially unresolved. However, the probability that the R(*) consensus tree has the species-tree topology approaches 1 as the number of gene trees approaches infinity. Although the greedy consensus algorithm can be the quickest to converge on the correct species-tree topology when increasing the number of gene trees, it can also be positively misleading. The majority-rule consensus tree is not a misleading estimator of the species-tree topology, and the R(*) consensus tree is a statistically consistent estimator of the species-tree topology. Our results therefore suggest a method for using multiple loci to infer the species-tree topology, even when it is discordant with the most likely gene tree.
- Published
- 2009
- Full Text
- View/download PDF
24. Parsimony via consensus.
- Author
-
Bruen TC and Bryant D
- Subjects
- Computer Simulation, Genetic Speciation, Models, Genetic, Phylogeny
- Abstract
The parsimony score of a character on a tree equals the number of state changes required to fit that character onto the tree. We show that for unordered, reversible characters this score equals the number of tree rearrangements required to fit the tree onto the character. We discuss implications of this connection for the debate over the use of consensus trees or total evidence and show how it provides a link between incongruence of characters and recombination.
- Published
- 2008
- Full Text
- View/download PDF
25. A general comparison of relaxed molecular clock models.
- Author
-
Lepage T, Bryant D, Philippe H, and Lartillot N
- Subjects
- Bayes Theorem, Genetic Variation, Phylogeny, Time Factors, Models, Molecular
- Abstract
Several models have been proposed to relax the molecular clock in order to estimate divergence times. However, it is unclear which model has the best fit to real data and should therefore be used to perform molecular dating. In particular, we do not know whether rate autocorrelation should be considered or which prior on divergence times should be used. In this work, we propose a general bench mark of alternative relaxed clock models. We have reimplemented most of the already existing models, including the popular lognormal model, as well as various prior choices for divergence times (birth-death, Dirichlet, uniform), in a common Bayesian statistical framework. We also propose a new autocorrelated model, called the "CIR" process, with well-defined stationary properties. We assess the relative fitness of these models and priors, when applied to 3 different protein data sets from eukaryotes, vertebrates, and mammals, by computing Bayes factors using a numerical method called thermodynamic integration. We find that the 2 autocorrelated models, CIR and lognormal, have a similar fit and clearly outperform uncorrelated models on all 3 data sets. In contrast, the optimal choice for the divergence time prior is more dependent on the data investigated. Altogether, our results provide useful guidelines for model choice in the field of molecular dating while opening the way to more extensive model comparisons.
- Published
- 2007
- Full Text
- View/download PDF
26. DAVID Bioinformatics Resources: expanded annotation database and novel algorithms to better extract biology from large gene lists.
- Author
-
Huang DW, Sherman BT, Tan Q, Kir J, Liu D, Bryant D, Guo Y, Stephens R, Baseler MW, Lane HC, and Lempicki RA
- Subjects
- Algorithms, Data Interpretation, Statistical, Genomics, Humans, Internet, Oligonucleotide Array Sequence Analysis methods, Pattern Recognition, Automated, Software, Computational Biology methods, Databases, Genetic, Databases, Nucleic Acid, Gene Expression Profiling statistics & numerical data, Information Storage and Retrieval methods
- Abstract
All tools in the DAVID Bioinformatics Resources aim to provide functional interpretation of large lists of genes derived from genomic studies. The newly updated DAVID Bioinformatics Resources consists of the DAVID Knowledgebase and five integrated, web-based functional annotation tool suites: the DAVID Gene Functional Classification Tool, the DAVID Functional Annotation Tool, the DAVID Gene ID Conversion Tool, the DAVID Gene Name Viewer and the DAVID NIAID Pathogen Genome Browser. The expanded DAVID Knowledgebase now integrates almost all major and well-known public bioinformatics resources centralized by the DAVID Gene Concept, a single-linkage method to agglomerate tens of millions of diverse gene/protein identifiers and annotation terms from a variety of public bioinformatics databases. For any uploaded gene list, the DAVID Resources now provides not only the typical gene-term enrichment analysis, but also new tools and functions that allow users to condense large gene lists into gene functional groups, convert between gene/protein identifiers, visualize many-genes-to-many-terms relationships, cluster redundant and heterogeneous terms into groups, search for interesting and related genes or terms, dynamically view genes from their lists on bio-pathways and more. With DAVID (http://david.niaid.nih.gov), investigators gain more power to interpret the biological mechanisms associated with large gene lists.
- Published
- 2007
- Full Text
- View/download PDF
27. Accounting for gene rate heterogeneity in phylogenetic inference.
- Author
-
Bevan RB, Bryant D, and Lang BF
- Subjects
- Computer Simulation, Evolution, Molecular, Genes, Genetic Heterogeneity, Models, Genetic, Phylogeny
- Abstract
Traditionally, phylogenetic analyses over many genes combine data into a contiguous block. Under this concatenated model, all genes are assumed to evolve at the same rate. However, it is clear that genes evolve at very different rates and that accounting for this rate heterogeneity is important if we are to accurately infer phylogenies from heterogeneous multigene data sets. There remain open questions regarding how best to incorporate gene rate parameters into phylogenetic models and which properties of real data correlate with improved fit over the concatenated model. In this study, two methods of accounting for gene rate heterogeneity are compared: the n-parameter method, which allows for each of the n gene partitions to have a gene rate parameter, and the alpha-parameter method, which fits a distribution to the gene rates. Results demonstrate that the n-parameter method is both computationally faster and in general provides a better fit over the concatenated model than the alpha-parameter method. Furthermore, improved model fit over the concatenated model is highly correlated with the presence of a gene with a slow relative rate of evolution.
- Published
- 2007
- Full Text
- View/download PDF
28. Conditioned genome reconstruction: how to avoid choosing the conditioning genome.
- Author
-
Spencer M, Bryant D, and Susko E
- Subjects
- Bacteria genetics, Computer Simulation, Algorithms, Classification methods, Genes genetics, Genome genetics, Models, Genetic, Phylogeny
- Abstract
Genome phylogenies can be inferred from data on the presence and absence of genes across taxa. Logdet distances may be a good method, because they allow expected genome size to vary across the tree. Recently, Lake and Rivera proposed conditioned genome reconstruction (calculation of logdet distances using only those genes present in a conditioning genome) to deal with unobservable genes that are absent from every taxon of interest. We prove that their method can consistently estimate the topology for almost any choice of conditioning genome. Nevertheless, the choice of conditioning genome is important for small samples. For real bacterial genome data, different choices of conditioning genome can result in strong bootstrap support for different tree topologies. To overcome this problem, we developed supertree methods that combine information from all choices of conditioning genome. One of these methods, based on the BIONJ algorithm, performs well on simulated data and may have applications to other supertree problems. However, an analysis of 40 bacterial genomes using this method supports an incorrect clade of parasites. This is a common feature of model-based gene content methods and is due to parallel gene loss.
- Published
- 2007
- Full Text
- View/download PDF
29. A simple and robust statistical test for detecting the presence of recombination.
- Author
-
Bruen TC, Philippe H, and Bryant D
- Subjects
- Computer Simulation, Genetics, Population, Genotype, Likelihood Functions, Linkage Disequilibrium, Models, Genetic, Models, Statistical, Mutation, Probability, Recombination, Genetic
- Abstract
Recombination is a powerful evolutionary force that merges historically distinct genotypes. But the extent of recombination within many organisms is unknown, and even determining its presence within a set of homologous sequences is a difficult question. Here we develop a new statistic, phi(w), that can be used to test for recombination. We show through simulation that our test can discriminate effectively between the presence and absence of recombination, even in diverse situations such as exponential growth (star-like topologies) and patterns of substitution rate correlation. A number of other tests, Max chi2, NSS, a coalescent-based likelihood permutation test (from LDHat), and correlation of linkage disequilibrium (both r2 and /D'/) with distance, all tend to underestimate the presence of recombination under strong population growth. Moreover, both Max chi2 and NSS falsely infer the presence of recombination under a simple model of mutation rate correlation. Results on empirical data show that our test can be used to detect recombination between closely as well as distantly related samples, regardless of the suspected rate of recombination. The results suggest that phi(w) is one of the best approaches to distinguish recurrent mutation from recombination in a wide variety of circumstances.
- Published
- 2006
- Full Text
- View/download PDF
30. Application of phylogenetic networks in evolutionary studies.
- Author
-
Huson DH and Bryant D
- Subjects
- Animals, Evolution, Molecular, Models, Genetic, Phylogeny
- Abstract
The evolutionary history of a set of taxa is usually represented by a phylogenetic tree, and this model has greatly facilitated the discussion and testing of hypotheses. However, it is well known that more complex evolutionary scenarios are poorly described by such models. Further, even when evolution proceeds in a tree-like manner, analysis of the data may not be best served by using methods that enforce a tree structure but rather by a richer visualization of the data to evaluate its properties, at least as an essential first step. Thus, phylogenetic networks should be employed when reticulate events such as hybridization, horizontal gene transfer, recombination, or gene duplication and loss are believed to be involved, and, even in the absence of such events, phylogenetic networks have a useful role to play. This article reviews the terminology used for phylogenetic networks and covers both split networks and reticulate networks, how they are defined, and how they can be interpreted. Additionally, the article outlines the beginnings of a comprehensive statistical framework for applying split network methods. We show how split networks can represent confidence sets of trees and introduce a conservative statistical test for whether the conflicting signal in a network is treelike. Finally, this article describes a new program, SplitsTree4, an interactive and comprehensive tool for inferring different types of phylogenetic networks from sequences, distances, and trees.
- Published
- 2006
- Full Text
- View/download PDF
31. Calculating the evolutionary rates of different genes: a fast, accurate estimator with applications to maximum likelihood phylogenetic analysis.
- Author
-
Bevan RB, Lang BF, and Bryant D
- Subjects
- Algorithms, Classification methods, Computational Biology methods, Fungal Proteins classification, Likelihood Functions, Statistics as Topic methods, Computer Simulation, Evolution, Molecular, Models, Statistical, Phylogeny, Sequence Analysis, Protein methods
- Abstract
In phylogenetic analyses with combined multigene or multiprotein data sets, accounting for differing evolutionary dynamics at different loci is essential for accurate tree prediction. Existing maximum likelihood (ML) and Bayesian approaches are computationally intensive. We present an alternative approach that is orders of magnitude faster. The method, Distance Rates (DistR), estimates rates based upon distances derived from gene/protein sequence data. Simulation studies indicate that this technique is accurate compared with other methods and robust to missing sequence data. The DistR method was applied to a fungal mitochondrial data set, and the rate estimates compared well to those obtained using existing ML and Bayesian approaches. Inclusion of the protein rates estimated from the DistR method into the ML calculation of trees as a branch length multiplier resulted in a significantly improved fit as measured by the Akaike Information Criterion (AIC). Furthermore, bootstrap support for the ML topology was significantly greater when protein rates were used, and some evident errors in the concatenated ML tree topology (i.e., without protein rates) were corrected. [Bayesian credible intervals; DistR method; multigene phylogeny; PHYML; rate heterogeneity.].
- Published
- 2005
- Full Text
- View/download PDF
32. Biogeographic interpretation of splits graphs: least squares optimization of branch lengths.
- Author
-
Winkworth R, Bryant D, Lockhart P, Havell D, and Moulton V
- Subjects
- Boraginaceae genetics, Geography, Least-Squares Analysis, New Zealand, Ranunculus genetics, Species Specificity, Classification methods, Evolution, Molecular, Models, Genetic, Phylogeny
- Abstract
Although most often used to represent phylogenetic uncertainty, network methods are also potentially useful for describing the phylogenetic complexity expected to characterize recent species radiations. One network method with particular advantages in this context is split decomposition. However, in its standard implementation this approach is limited by a conservative criterion for branch length estimation. Here we extend the utility of split decomposition by introducing a least squares optimization technique for correcting branch lengths that may be underestimated by the standard implementation. This optimization of branch lengths is generally expected to improve divergence time estimates calculated from splits graphs. We illustrate the effect of least squares optimization on such estimates using the Australasian Myosotis and the Hawaiian silversword alliance as examples. We also discuss the biogeographic interpretation and limitations of splits graphs.
- Published
- 2005
- Full Text
- View/download PDF
33. A genome phylogeny for mitochondria among alpha-proteobacteria and a predominantly eubacterial ancestry of yeast nuclear genes.
- Author
-
Esser C, Ahmadinejad N, Wiegand C, Rotte C, Sebastiani F, Gelius-Dietrich G, Henze K, Kretschmann E, Richly E, Leister D, Bryant D, Steel MA, Lockhart PJ, Penny D, and Martin W
- Subjects
- Archaea genetics, Bacterial Proteins genetics, Carrier Proteins genetics, Evolution, Molecular, Genes, Archaeal, Genes, Bacterial, Genome, Mitochondria genetics, Mitochondrial Proteins genetics, Models, Genetic, Phylogeny, Rhodospirillum rubrum genetics, Saccharomyces cerevisiae genetics, Saccharomyces cerevisiae Proteins genetics, Sequence Homology, Amino Acid, Alphaproteobacteria genetics, Bacteria genetics, Genes, Fungal
- Abstract
Analyses of 55 individual and 31 concatenated protein data sets encoded in Reclinomonas americana and Marchantia polymorpha mitochondrial genomes revealed that current methods for constructing phylogenetic trees are insufficiently sensitive (or artifact-insensitive) to ascertain the sister of mitochondria among the current sample of eight alpha-proteobacterial genomes using mitochondrially-encoded proteins. However, Rhodospirillum rubrum came as close to mitochondria as any alpha-proteobacterium investigated. This prompted a search for methods to directly compare eukaryotic genomes to their prokaryotic counterparts to investigate the origin of the mitochondrion and its host from the standpoint of nuclear genes. We examined pairwise amino acid sequence identity in comparisons of 6,214 nuclear protein-coding genes from Saccharomyces cerevisiae to 177,117 proteins encoded in sequenced genomes from 45 eubacteria and 15 archaebacteria. The results reveal that approximately 75% of yeast genes having homologues among the present prokaryotic sample share greater amino acid sequence identity to eubacterial than to archaebacterial homologues. At high stringency comparisons, only the eubacterial component of the yeast genome is detectable. Our findings indicate that at the levels of overall amino acid sequence identity and gene content, yeast shares a sister-group relationship with eubacteria, not with archaebacteria, in contrast to the current phylogenetic paradigm based on ribosomal RNA. Among eubacteria and archaebacteria, proteobacterial and methanogen genomes, respectively, shared more similarity with the yeast genome than other prokaryotic genomes surveyed.
- Published
- 2004
- Full Text
- View/download PDF
34. Neighbor-net: an agglomerative method for the construction of phylogenetic networks.
- Author
-
Bryant D and Moulton V
- Subjects
- Animals, Bacterial Proteins genetics, Chaperonins genetics, Cluster Analysis, Computer Simulation, DNA, Mitochondrial genetics, Evolution, Molecular, Genes, Archaeal genetics, Humans, Models, Theoretical, Salmonella genetics, Software, Algorithms, Models, Genetic, Phylogeny
- Abstract
We present Neighbor-Net, a distance based method for constructing phylogenetic networks that is based on the Neighbor-Joining (NJ) algorithm of Saitou and Nei. Neighbor-Net provides a snapshot of the data that can guide more detailed analysis. Unlike split decomposition, Neighbor-Net scales well and can quickly produce detailed and informative networks for several hundred taxa. We illustrate the method by reanalyzing three published data sets: a collection of 110 highly recombinant Salmonella multi-locus sequence typing sequences, the 135 "African Eve" human mitochondrial sequences published by Vigilant et al., and a collection of 12 Archeal chaperonin sequences demonstrating strong evidence for gene conversion. Neighbor-Net is available as part of the SplitsTree4 software package.
- Published
- 2004
- Full Text
- View/download PDF
35. Matrix representations with parsimony or with distances: two sides of the same coin?
- Author
-
Lapointe FJ, Wilkinson M, and Bryant D
- Subjects
- Algorithms, Evolution, Molecular, Classification methods, Models, Theoretical, Phylogeny
- Published
- 2003
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.