Joseph F. Walker

Joseph F. Walker

Auto-generated profile, based on publicly available information

Joseph F. Walker

Department of Biological Sciences, University of Illinois at Chicago, Chicago, IL 60607, USA

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
8 February 2017 in Bioinformatics
Verified
Journal Article
Open access
PDF file
JBJoseph W Brown
Joseph W Brown
JWJoseph F Walker
Joseph F Walker
SSStephen A Smith
Stephen A Smith
The ease with which phylogenomic data can be generated has drastically escalated the computational burden for even routine phylogenetic investigations. To address this, we present phyx: a collection of programs written in C ++ to explore, manipulate, analyze and simulate phylogenetic objects (alignments, trees and MCMC logs). Modelled after Unix/GNU/Linux command line tools, individual programs perform a single task and operate on standard I/O streams that can be piped to quickly and easily form complex analytical pipelines. Because of the stream-centric paradigm, memory requirements are minimized (often only a single tree or sequence in memory at any instance), and hence phyx is capable of efficiently processing very large datasets. phyx runs on POSIX-compliant operating systems. Source code, installation instructions, documentation and example files are freely available under the GNU General Public License at https://github.com/FePhyFoFum/phyx Supplementary data are available at Bioinformatics online.

14 February 2018 in American Journal of Botany
Verified
Journal Article
Open access
PDF file
JPJames B. Pease
James B. Pease
JBJoseph W. Brown
Joseph W. Brown
JWJoseph F. Walker
Joseph F. Walker
CHCody E. Hinchliff
Cody E. Hinchliff
SSStephen A. Smith
Stephen A. Smith
Premise of the Study: Phylogenetic support has been difficult to evaluate within the green plant tree of life partly due to a lack of specificity between conflicted versus poorly informed branches. As data sets continue to expand in both breadth and depth, new support measures are needed that are more efficient and informative.Methods: We describe the Quartet Sampling (QS) method, a quartet‐based evaluation system that synthesizes several phylogenetic and genomic analytical approaches. QS characterizes discordance in large‐sparse and genome‐wide data sets, overcoming issues of alignment sparsity and distinguishing strong conflict from weak support. We tested QS with simulations and recent plant phylogenies inferred from variously sized data sets.Key Results: QS scores demonstrated convergence with increasing replicates and were not strongly affected by branch depth. Patterns of QS support from different phylogenies led to a coherent understanding of ancestral branches defining key disagreements, including the relationships of Ginkgo to cycads, magnoliids to monocots and eudicots, and mosses to liverworts. The relationships of ANA‐grade angiosperms (Amborella, Nymphaeales, Austrobaileyales), major monocot groups, bryophytes, and fern families are likely highly discordant in their evolutionary histories, rather than poorly informed. QS can also detect discordance due to introgression in phylogenomic data.Conclusions: Quartet Sampling is an efficient synthesis of phylogenetic tests that offers more comprehensive and specific information on branch support than conventional measures. The QS method corroborates growing evidence that phylogenomic investigations that incorporate discordance testing are warranted when reconstructing complex evolutionary histories, in particular those surrounding ANA‐grade, monocots, and nonvascular plants.

17 May 2018 in PLOS ONE
Verified
Journal Article
Open access
PDF file
SSStephen A Smith
Stephen A Smith
JBJoseph W Brown
Joseph W Brown
JWJoseph F Walker
Joseph F Walker
Phylogenomic datasets have been successfully used to address questions involving evolutionary relationships, patterns of genome structure, signatures of selection, and gene and genome duplications. However, despite the recent explosion in genomic and transcriptomic data, the utility of these data sources for efficient divergence-time inference remains unexamined. Phylogenomic datasets pose two distinct problems for divergence-time estimation: (i) the volume of data makes inference of the entire dataset intractable, and (ii) the extent of underlying topological and rate heterogeneity across genes makes model mis-specification a real concern. “Gene shopping”, wherein a phylogenomic dataset is winnowed to a set of genes with desirable properties, represents an alternative approach that holds promise in alleviating these issues. We implemented an approach for phylogenomic datasets (available in SortaDate) that filters genes by three criteria: (i) clock-likeness, (ii) reasonable tree length (i.e., discernible information content), and (iii) least topological conflict with a focal species tree (presumed to have already been inferred). Such a winnowing procedure ensures that errors associated with model (both clock and topology) mis-specification are minimized, therefore reducing error in divergence-time estimation. We demonstrated the efficacy of this approach through simulation and applied it to published animal (Aves, Diplopoda, and Hymenoptera) and plant (carnivorous Caryophyllales, broad Caryophyllales, and Vitales) phylogenomic datasets. By quantifying rate heterogeneity across both genes and lineages we found that every empirical dataset examined included genes with clock-like, or nearly clock-like, behavior. Moreover, many datasets had genes that were clock-like, exhibited reasonable evolutionary rates, and were mostly compatible with the species tree. We identified overlap in age estimates when analyzing these filtered genes under strict clock and uncorrelated lognormal (UCLN) models. However, this overlap was often due to imprecise estimates from the UCLN model. We find that “gene shopping” can be an efficient approach to divergence-time inference for phylogenomic datasets that may otherwise be characterized by extensive gene tree heterogeneity.

24 September 2019 in PeerJ
Verified
Journal Article
Open access
PDF file
JWJoseph F. Walker
Joseph F. Walker
NWNathanael Walker-Hale
Nathanael Walker-Hale
OVOscar M. Vargas
Oscar M. Vargas
DLDrew A. Larson
Drew A. Larson
GSGregory W. Stull
Gregory W. Stull
Evolutionary relationships among plants have been inferred primarily using chloroplast data. To date, no study has comprehensively examined the plastome for gene tree conflict. Using a broad sampling of angiosperm plastomes, we characterize gene tree conflict among plastid genes at various time scales and explore correlates to conflict (e.g., evolutionary rate, gene length, molecule type). We uncover notable gene tree conflict against a backdrop of largely uninformative genes. We find alignment length and tree length are strong predictors of concordance, and that nucleotides outperform amino acids. Of the most commonly used markers, matK, greatly outperforms rbcL; however, the rarely used gene rpoC2 is the top-performing gene in every analysis. We find that rpoC2 reconstructs angiosperm phylogeny as well as the entire concatenated set of protein-coding chloroplast genes. Our results suggest that longer genes are superior for phylogeny reconstruction. The alleviation of some conflict through the use of nucleotides suggests that stochastic and systematic error is likely the root of most of the observed conflict, but further research on biological conflict within plastome is warranted given documented cases of heteroplasmic recombination. We suggest that researchers should filter genes for topological concordance when performing downstream comparative analyses on phylogenetic data, even when using chloroplast genomes.

25 September 2017 in New Phytologist
Verified
Journal Article
Closed access
PDF file
YYYa Yang
Ya Yang
MMMichael J. Moore
Michael J. Moore
SBSamuel F. Brockington
Samuel F. Brockington
JMJessica Mikenas
Jessica Mikenas
JOJulia Olivieri
Julia Olivieri
SSStephen A. Smith
Stephen A. Smith

1 March 2018 in American Journal of Botany
Verified
Journal Article
Open access
PDF file
JWJoseph F. Walker
Joseph F. Walker
YYYa Yang
Ya Yang
TFTao Feng
Tao Feng
ATAlfonso Timoneda
Alfonso Timoneda
JMJessica Mikenas
Jessica Mikenas
SSStephen A. Smith
Stephen A. Smith
Premise of the Study: The Caryophyllales contain ~12,500 species and are known for their cosmopolitan distribution, convergence of trait evolution, and extreme adaptations. Some relationships within the Caryophyllales, like those of many large plant clades, remain unclear, and phylogenetic studies often recover alternative hypotheses. We explore the utility of broad and dense transcriptome sampling across the order for resolving evolutionary relationships in Caryophyllales.Methods: We generated 84 transcriptomes and combined these with 224 publicly available transcriptomes to perform a phylogenomic analysis of Caryophyllales. To overcome the computational challenge of ortholog detection in such a large data set, we developed an approach for clustering gene families that allowed us to analyze >300 transcriptomes and genomes. We then inferred the species relationships using multiple methods and performed gene‐tree conflict analyses.Key Results: Our phylogenetic analyses resolved many clades with strong support, but also showed significant gene‐tree discordance. This discordance is not only a common feature of phylogenomic studies, but also represents an opportunity to understand processes that have structured phylogenies. We also found taxon sampling influences species‐tree inference, highlighting the importance of more focused studies with additional taxon sampling.Conclusions: Transcriptomes are useful both for species‐tree inference and for uncovering evolutionary complexity within lineages. Through analyses of gene‐tree conflict and multiple methods of species‐tree inference, we demonstrate that phylogenomic data can provide unparalleled insight into the evolutionary history of Caryophyllales. We also discuss a method for overcoming computational challenges associated with homolog clustering in large data sets.