Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Steven H. Wu

dblp:41/11013 · DBLP profile ↗
← Back
9ranked-venue papers
4as first author
3since 2021 · last 2026
0000-0002-7685-8009ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 9 · 4 first-author · 3 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
2 papers
Bioinformatics and computational biology · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › genomics
variant calling
0.312018
accuMUlate: a mutation caller designed for mutation accumulation experiments · Bioinform. 2018
Bioinformatics and computational biology › statistical genetics
genotype calling
0.312017
Estimating error models for whole genome sequencing using mixtures of Dirichlet-multinomial distributions · Bioinform. 2017
Bioinformatics and computational biology › genomics
genotyping
0.312017
Estimating error models for whole genome sequencing using mixtures of Dirichlet-multinomial distributions · Bioinform. 2017
Bioinformatics and computational biology › genomics › genome sequencing
whole genome sequencing
0.312017
Estimating error models for whole genome sequencing using mixtures of Dirichlet-multinomial distributions · Bioinform. 2017

Methods — techniques the papers use, named apart from their topics

probabilistic modeling · 0.3dirichlet-multinomial mixture model · 0.3
YearPublicationVenuePosition
2026 A probabilistic approach for predicting indole-3-acetic acid synthesis in bacteria using genomic data
abstract
BACKGROUND: Indole-3-acetic acid (IAA) is a crucial plant hormone for growth and development. Among bacteria capable of IAA synthesis, tryptophan-dependent pathways are the primary pathway for IAA production. Identifying IAA-producing bacteria is essential for understanding plant–microbe interactions and developing sustainable agricultural practices. With the advancements in sequencing technologies which enable the acquisition of genomic data in a short amount of time at a reduced cost. This study developed a probabilistic framework to predict the likelihood of IAA synthesis in bacteria using their genomes, which offers a cost-effective screening approach compared to traditional wet-lab methods. RESULTS: The prediction framework incorporates four tryptophan-dependent pathways and consists of two models. The Binary Model provides a binary prediction of IAA synthesis, and the Logistic Model ranks bacteria based on their synthesis potential. The models were validated against a comprehensive dataset of more than 15,000 bacterial genomes, and the results suggest that only 1.7% of the bacteria have the potential to synthesize IAA. The most promising phyla are Actinobacteria, Proteobacteria, and Firmicutes. The Logistic Model shows that the top-ranked genera include Streptomyces, Paraburkholderia, Nonomuraea, Rhodococcus, and Nocardia. The model also suggests that the potential for IAA synthesis is likely to be strain-specific, emphasizing the importance of analyzing individual strains within a genus. CONCLUSION: The proposed probabilistic prediction framework is a cost-effective in-silico approach for identifying bacteria with a high potential for IAA synthesis. This serves as a pre-screening tool for resource-intensive downstream wet-lab validation, significantly reducing the time and effort required to identify potential plant growth-promoting bacteria. Furthermore, the model can be customized for other pathways of interest, and making it a versatile framework to explore various bacterial metabolic processes. The source code of the model is freely available at https://github.com/ComputationalAgronomy/bcpip
Zheng-Xiang Ye, Steven H. Wu
BMC Bioinform.2
2024 ViPRA-Haplo: De Novo Reconstruction of Viral Populations Using Paired End Sequencing Data
abstract
We present ViPRA-Haplo, a de novo strain-specific assembly workflow for reconstructing viral haplotypes in a viral population from paired-end next generation sequencing (NGS) data. The proposed Viral Path Reconstruction Algorithm (ViPRA) generates a subset of paths from a De Bruijn graph of reads using the pairing information of reads. The paths generated by ViPRA are an over-estimation of the true contigs. We propose two refinement methods to obtain an optimal set of contigs representing viral haplotypes. The first method clusters paths reconstructed by ViPRA using VSEARCH Deorowicz et al. 2015 based on sequence similarity, while the second method, MLEHaplo, generates a maximum likelihood estimate of viral populations. We evaluated our pipeline on both simulated and real viral quasispecies data from HIV (and real data from SARS-COV-2). Experimental results show that ViPRA-Haplo, although still an overestimation in the number of true contigs, outperforms the existing tool, PEHaplo, providing up to 9% better genome coverage on HIV real data. In addition, ViPRA-Haplo also retains higher diversity of the viral population as demonstrated by the presence of a higher percentage of contigs less than 1000 base pairs (bps), which also contain k-mers with counts less than 100 (representing rarer sequences), which are absent in PEHaplo. For SARS-CoV-2 sequencing data, ViPRA-Haplo reconstructs contigs that cover more than 90% of the reference genome and were able to validate known SARS-CoV-2 strains in the sequencing data.
Weiling Li, Raunaq Malhotra, Steven H. Wu, Manjari Jha, Allen G. Rodrigo, Mary Poss, Raj Acharya
IEEE ACM Trans. Comput. Biol. Bioinform.3
2021 An assembly-free method of phylogeny reconstruction using short-read sequences from pooled samples without barcodes
abstract
A current strategy for obtaining haplotype information from several individuals involves short-read sequencing of pooled amplicons, where fragments from each individual is identified by a unique DNA barcode. In this paper, we report a new method to recover the phylogeny of haplotypes from short-read sequences obtained using pooled amplicons from a mixture of individuals, without barcoding. The method, AFPhyloMix, accepts an alignment of the mixture of reads against a reference sequence, obtains the single-nucleotide-polymorphisms (SNP) patterns along the alignment, and constructs the phylogenetic tree according to the SNP patterns. AFPhyloMix adopts a Bayesian inference model to estimate the phylogeny of the haplotypes and their relative abundances, given that the number of haplotypes is known. In our simulations, AFPhyloMix achieved at least 80% accuracy at recovering the phylogenies and relative abundances of the constituent haplotypes, for mixtures with up to 15 haplotypes. AFPhyloMix also worked well on a real data set of kangaroo mitochondrial DNA sequences.
Thomas K. F. Wong, Louis Ranjard, Steven H. Wu, Jeet Sukumaran, Allen G. Rodrigo
PLoS Comput. Biol.4
2018 accuMUlate: a mutation caller designed for mutation accumulation experiments
abstract
Summary: Mutation accumulation (MA) is the most widely used method for directly studying the effects of mutation. By sequencing whole genomes from MA lines, researchers can directly study the rate and molecular spectra of spontaneous mutations and use these results to understand how mutation contributes to biological processes. At present there is no software designed specifically for identifying mutations from MA lines. Here we describe accuMUlate, a probabilistic mutation caller that reflects the design of a typical MA experiment while being flexible enough to accommodate properties unique to any particular experiment. Availability and implementation accuMUlate is available from https://github.com/dwinter/accuMUlate. Supplementary information: Supplementary data are available at Bioinformatics online.
David J. Winter, Steven H. Wu, Abigail A. Howell, Ricardo B. R. Azevedo, Rebecca A. Zufall, Reed A. Cartwright
Bioinform.2
2017 Estimating error models for whole genome sequencing using mixtures of Dirichlet-multinomial distributions
abstract
MOTIVATION: Accurate identification of genotypes is an essential part of the analysis of genomic data, including in identification of sequence polymorphisms, linking mutations with disease and determining mutation rates. Biological and technical processes that adversely affect genotyping include copy-number-variation, paralogous sequences, library preparation, sequencing error and reference-mapping biases, among others. RESULTS: We modeled the read depth for all data as a mixture of Dirichlet-multinomial distributions, resulting in significant improvements over previously used models. In most cases the best model was comprised of two distributions. The major-component distribution is similar to a binomial distribution with low error and low reference bias. The minor-component distribution is overdispersed with higher error and reference bias. We also found that sites fitting the minor component are enriched for copy number variants and low complexity regions, which can produce erroneous genotype calls. By removing sites that do not fit the major component, we can improve the accuracy of genotype calls. AVAILABILITY AND IMPLEMENTATION: Methods and data files are available at https://github.com/CartwrightLab/WuEtAl2017/ (doi:10.5281/zenodo.256858). CONTACT: [email protected]. SUPPLEMENTARY INFORMATION: Supplementary data is available at Bioinformatics online.
Steven H. Wu, Rachel Schwartz, David J. Winter, Donald F. Conrad, Reed A. Cartwright
Bioinform.1
2015 Estimation of evolutionary parameters using short, random and partial sequences from mixed samples of anonymous individuals
abstract
BACKGROUND: Over the last decade, next generation sequencing (NGS) has become widely available, and is now the sequencing technology of choice for most researchers. Nonetheless, NGS presents a challenge for the evolutionary biologists who wish to estimate evolutionary genetic parameters from a mixed sample of unlabelled or untagged individuals, especially when the reconstruction of full length haplotypes can be unreliable. We propose two novel approaches, least squares estimation (LS) and Approximate Bayesian Computation Markov chain Monte Carlo estimation (ABC-MCMC), to infer evolutionary genetic parameters from a collection of short-read sequences obtained from a mixed sample of anonymous DNA using the frequencies of nucleotides at each site only without reconstructing the full-length alignment nor the phylogeny. RESULTS: We used simulations to evaluate the performance of these algorithms, and our results demonstrate that LS performs poorly because bootstrap 95% Confidence Intervals (CIs) tend to under- or over-estimate the true values of the parameters. In contrast, ABC-MCMC 95% Highest Posterior Density (HPD) intervals recovered from ABC-MCMC enclosed the true parameter values with a rate approximately equivalent to that obtained using BEAST, a program that implements a Bayesian MCMC estimation of evolutionary parameters using full-length sequences. Because there is a loss of information with the use of sitewise nucleotide frequencies alone, the ABC-MCMC 95% HPDs are larger than those obtained by BEAST. CONCLUSION: We propose two novel algorithms to estimate evolutionary genetic parameters based on the proportion of each nucleotide. The LS method cannot be recommended as a standalone method for evolutionary parameter estimation. On the other hand, parameters recovered by ABC-MCMC are comparable to those obtained using BEAST, but with larger 95% HPDs. One major advantage of ABC-MCMC is that computational time scales linearly with the number of short-read sequences, and is independent of the number of full-length sequences in the original data. This allows us to perform the analysis on NGS datasets with large numbers of short read fragments. The source code for ABC-MCMC is available at https://github.com/stevenhwu/SF-ABC.
Steven H. Wu, Allen G. Rodrigo
BMC Bioinform.1
2015 Neutral Models of Microbiome Evolution
abstract
There has been an explosion of research on host-associated microbial communities (i.e.,microbiomes). Much of this research has focused on surveys of microbial diversities across a variety of host species, including humans, with a view to understanding how these microbiomes are distributed across space and time, and how they correlate with host health, disease, phenotype, physiology and ecology. Fewer studies have focused on how these microbiomes may have evolved. In this paper, we develop an agent-based framework to study the dynamics of microbiome evolution. Our framework incorporates neutral models of how hosts acquire their microbiomes, and how the environmental microbial community that is available to the hosts is assembled. Most importantly, our framework also incorporates a Wright-Fisher genealogical model of hosts, so that the dynamics of microbiome evolution is studied on an evolutionary timescale. Our results indicate that the extent of parental contribution to microbial availability from one generation to the next significantly impacts the diversity of microbiomes: the greater the parental contribution, the less diverse the microbiomes. In contrast, even when there is only a very small contribution from a constant environmental pool, microbial communities can remain highly diverse. Finally, we show that our models may be used to construct hypotheses about the types of processes that operate to assemble microbiomes over evolutionary time.
Qinglong Zeng, Jeet Sukumaran, Steven H. Wu, Allen G. Rodrigo
PLoS Comput. Biol.3
2012 A Bayesian model for classifying all differentially expressed proteins simultaneously in 2D PAGE gels
abstract
BACKGROUND: Two-dimensional polyacrylamide gel electrophoresis (2D PAGE) is commonly used to identify differentially expressed proteins under two or more experimental or observational conditions. Wu et al (2009) developed a univariate probabilistic model which was used to identify differential expression between Case and Control groups, by applying a Likelihood Ratio Test (LRT) to each protein on a 2D PAGE. In contrast to commonly used statistical approaches, this model takes into account the two possible causes of missing values in 2D PAGE: either (1) the non-expression of a protein; or (2) a level of expression that falls below the limit of detection. RESULTS: We develop a global Bayesian model which extends the previously described model. Unlike the univariate approach, the model reported here is able treat all differentially expressed proteins simultaneously. Whereas each protein is modelled by the univariate likelihood function previously described, several global distributions are used to model the underlying relationship between the parameters associated with individual proteins. These global distributions are able to combine information from each protein to give more accurate estimates of the true parameters. In our implementation of the procedure, all parameters are recovered by Markov chain Monte Carlo (MCMC) integration. The 95% highest posterior density (HPD) intervals for the marginal posterior distributions are used to determine whether differences in protein expression are due to differences in mean expression intensities, and/or differences in the probabilities of expression. CONCLUSIONS: Simulation analyses showed that the global model is able to accurately recover the underlying global distributions, and identify more differentially expressed proteins than the simple application of a LRT. Additionally, simulations also indicate that the probability of incorrectly identifying a protein as differentially expressed (i.e., the False Discovery Rate) is very low. The source code is available at https://github.com/stevenhwu/BIDE-2D.
Steven H. Wu, Mik Black, Robyn A. North, Allen G. Rodrigo
BMC Bioinform.1
2009 A Statistical Model to Identify Differentially Expressed Proteins in 2D PAGE Gels
abstract
Two dimensional polyacrylamide gel electrophoresis (2D PAGE) is used to identify differentially expressed proteins and may be applied to biomarker discovery. A limitation of this approach is the inability to detect a protein when its concentration falls below the limit of detection. Consequently, differential expression of proteins may be missed when the level of a protein in the cases or controls is below the limit of detection for 2D PAGE. Standard statistical techniques have difficulty dealing with undetected proteins. To address this issue, we propose a mixture model that takes into account both detected and non-detected proteins. Non-detected proteins are classified either as (a) proteins that are not expressed in at least one replicate, or (b) proteins that are expressed but are below the limit of detection. We obtain maximum likelihood estimates of the parameters of the mixture model, including the group-specific probability of expression and mean expression intensities. Differentially expressed proteins can be detected by using a Likelihood Ratio Test (LRT). Our simulation results, using data generated from biological experiments, show that the likelihood model has higher statistical power than standard statistical approaches to detect differentially expressed proteins. An R package, Slider (Statistical Likelihood model for Identifying Differential Expression in R), is freely available at http://www.cebl.auckland.ac.nz/slider.php.
Steven H. Wu, Mik Black, Robyn A. North, Kelly R. Atkinson, Allen G. Rodrigo
PLoS Comput. Biol.1