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

John Yin

dblp:34/1974 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
0since 2021 · last 2019
—ORCID · conflict

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

Applied, interdisciplinary, general and emerging computing · 4 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1

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%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 67% GPUs and heterogeneous computing · 33%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology
phylogenetics
0.412019
ASTRAL-MP: scaling ASTRAL to very large datasets using randomization and parallelization · Bioinform. 2019
Bioinformatics and computational biology › phylogenetics
species tree estimation
0.412019
ASTRAL-MP: scaling ASTRAL to very large datasets using randomization and parallelization · Bioinform. 2019
GPUs and heterogeneous computing
GPU computing
0.112019
ASTRAL-MP: scaling ASTRAL to very large datasets using randomization and parallelization · Bioinform. 2019
Parallel and multicore computing › parallel algorithms › dynamic programming
parallel dynamic programming
0.112019
ASTRAL-MP: scaling ASTRAL to very large datasets using randomization and parallelization · Bioinform. 2019
Parallel and multicore computing
parallel programming models
0.112019
ASTRAL-MP: scaling ASTRAL to very large datasets using randomization and parallelization · Bioinform. 2019
Bioinformatics and computational biology
systems biology
0.012003
Modeling biological systems using Dynetica-a simulator of dynamic networks · Bioinform. 2003

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

randomization · 0.8parallelization · 0.8dynamic programming · 0.8GPU computing · 0.8stochastic simulation · 0.0deterministic simulation · 0.0
YearPublicationVenuePosition
2019 ASTRAL-MP: scaling ASTRAL to very large datasets using randomization and parallelization
abstract
MOTIVATION: Evolutionary histories can change from one part of the genome to another. The potential for discordance between the gene trees has motivated the development of summary methods that reconstruct a species tree from an input collection of gene trees. ASTRAL is a widely used summary method and has been able to scale to relatively large datasets. However, the size of genomic datasets is quickly growing. Despite its relative efficiency, the current single-threaded implementation of ASTRAL is falling behind the data growth trends is not able to analyze the largest available datasets in a reasonable time. RESULTS: ASTRAL uses dynamic programing and is not trivially parallel. In this paper, we introduce ASTRAL-MP, the first version of ASTRAL that can exploit parallelism and also uses randomization techniques to speed up some of its steps. Importantly, ASTRAL-MP can take advantage of not just multiple CPU cores but also one or several graphics processing units (GPUs). The ASTRAL-MP code scales very well with increasing CPU cores, and its GPU version, implemented in OpenCL, can have up to 158× speedups compared to ASTRAL-III. Using GPUs and multiple cores, ASTRAL-MP is able to analyze datasets with 10 000 species or datasets with more than 100 000 genes in <2 days. AVAILABILITY AND IMPLEMENTATION: ASTRAL-MP is available at https://github.com/smirarab/ASTRAL/tree/MP. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
John Yin, Chao Zhang 0055, Siavash Mirarab
Bioinform.1
2009 Computational Fitness Landscape for All Gene-Order Permutations of an RNA Virus
abstract
How does the growth of a virus depend on the linear arrangement of genes in its genome? Answering this question may enhance our basic understanding of virus evolution and advance applications of viruses as live attenuated vaccines, gene-therapy vectors, or anti-tumor therapeutics. We used a mathematical model for vesicular stomatitis virus (VSV), a prototype RNA virus that encodes five genes (N-P-M-G-L), to simulate the intracellular growth of all 120 possible gene-order variants. Simulated yields of virus infection varied by 6,000-fold and were found to be most sensitive to gene-order permutations that increased levels of the L gene transcript or reduced levels of the N gene transcript, the lowest and highest expressed genes of the wild-type virus, respectively. Effects of gene order on virus growth also depended upon the host-cell environment, reflecting different resources for protein synthesis and different cell susceptibilities to infection. Moreover, by computationally deleting intergenic attenuations, which define a key mechanism of transcriptional regulation in VSV, the variation in growth associated with the 120 gene-order variants was drastically narrowed from 6,000- to 20-fold, and many variants produced higher progeny yields than wild-type. These results suggest that regulation by intergenic attenuation preceded or co-evolved with the fixation of the wild type gene order in the evolution of VSV. In summary, our models have begun to reveal how gene functions, gene regulation, and genomic organization of viruses interact with their host environments to define processes of viral growth and evolution.
Kwang-il Lim, John Yin
PLoS Comput. Biol.2
2006 Model-Based Design of Growth-Attenuated Viruses
abstract
Live-virus vaccines activate both humoral and cell-mediated immunity, require only a single boosting, and generally provide longer immune protection than killed or subunit vaccines. However, growth of live-virus vaccines must be attenuated to minimize their potential pathogenic effects, and mechanisms of attenuation by conventional serial-transfer viral adaptation are not well-understood. New methods of attenuation based on rational engineering of viral genomes may offer a potentially greater control if one can link defined genetic modifications to changes in virus growth. To begin to establish such links between genotype and growth phenotype, we developed a computer model for the intracellular growth of vesicular stomatitis virus (VSV), a well-studied, nonsegmented, negative-stranded RNA virus. Our model incorporated established regulatory mechanisms of VSV while integrating key wild-type infection steps: hijacking of host resources, transcription, translation, and replication, followed by assembly and release of progeny VSV particles. Generalization of the wild-type model to allow for genome rearrangements matched the experimentally observed attenuation ranking for recombinant VSV strains that altered the genome position of their nucleocapsid gene. Finally, our simulations captured previously reported experimental results showing how altering the positions of other VSV genes has the potential to attenuate the VSV growth while overexpressing the immunogenic VSV surface glycoprotein. Such models will facilitate the engineering of new live-virus vaccines by linking genomic manipulations to controlled changes in virus gene-expression and growth.
Kwang-il Lim, Tobias Lang 0002, Vy Lam, John Yin
PLoS Comput. Biol.4
2003 Modeling biological systems using Dynetica-a simulator of dynamic networks
abstract
UNLABELLED: We present Dynetica, a user-friendly simulator of dynamic networks for constructing, visualizing, and analyzing kinetic models of biological systems. In addition to generic reaction networks, Dynetica facilitates construction of models of genetic networks, where many reactions are gene expression and interactions among gene products. Further, it integrates the capability of conducting both deterministic and stochastic simulations. AVAILABILITY AND SUPPLEMENTARY INFORMATION: Dynetica 1.0, example models, and the user's guide are available at http://www.its.caltech.edu/~you/Dynetica/Dynetica_page.htm
Lingchong You, Apirak Hoonlor, John Yin
Bioinform.3
1995 A pseudo-distance measure for 2D shapes based on turning angle
abstract
We describe a pseudo-distance function for planar shapes that can be used for similarity retrieval based on shape in image database applications. A shape is represented as a vector of turning angles, and the distance between two vectors is computed using a dynamic programming algorithm. We improve the method over previous similar approaches by allowing multiple starting points along the object perimeter. The results of shape retrieval to match either user hand-drawn shapes or stored object shapes in a database of approximately 2300 shapes demonstrate the methods capabilities.
Wayne Niblack, John Yin
ICIP (3)2