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

Zhanyong Wang

dblp:18/1802 · DBLP profile ↗
← Back
12ranked-venue papers
2as first author
0since 2021 · last 2017
—ORCID · conflict

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

Applied, interdisciplinary, general and emerging computing · 9 · 2 first-authorTheory of computation · 2Graphics, 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
5 papers
Bioinformatics and computational biology · 100%
Theoretical computer science
1 paper
Algorithms and data structures · 100%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › statistical genetics › gene-gene interaction
gene-gene interaction detection
0.212014
Gene-Gene Interactions Detection Using a Two-Stage Model · RECOMB 2014
Bioinformatics and computational biology › genomics
haplotype inference
0.212013
Leveraging reads that span multiple single nucleotide polymorphisms for haplotype inference from sequencing data · Bioinform. 2013
Bioinformatics and computational biology › population genetics
pedigree reconstruction
0.212013
IPED: Inheritance Path Based Pedigree Reconstruction Algorithm Using Genotype Data · RECOMB 2013
Bioinformatics and computational biology › genomics › structural variation
copy number variation
0.112012
CNVeM: Copy Number Variation Detection Using Uncertainty of Read Mapping · RECOMB 2012
Bioinformatics and computational biology › cancer genomics › copy number analysis
copy number variation detection
0.112012
CNVeM: Copy Number Variation Detection Using Uncertainty of Read Mapping · RECOMB 2012
Bioinformatics and computational biology › sequence analysis › read mapping
read mapping uncertainty
0.112012
CNVeM: Copy Number Variation Detection Using Uncertainty of Read Mapping · RECOMB 2012
Bioinformatics and computational biology › statistical genetics
genetic linkage analysis
0.112008
Identification of linked regions using high-density SNP genotype data in linkage analysis · Bioinform. 2008
Bioinformatics and computational biology › statistical genetics
genotype data analysis
0.112008
Identification of linked regions using high-density SNP genotype data in linkage analysis · Bioinform. 2008

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

genotype data analysis · 0.3two-stage model · 0.2probabilistic sampling · 0.2hidden markov model · 0.2simulation · 0.1rule-based program · 0.1
YearPublicationVenuePosition
2017 IPED2: Inheritance Path Based Pedigree Reconstruction Algorithm for Complicated Pedigrees
abstract
Reconstruction of family trees, or pedigree reconstruction, for a group of individuals is a fundamental problem in genetics. The problem is known to be NP-hard even for datasets known to only contain siblings. Some recent methods have been developed to accurately and efficiently reconstruct pedigrees. These methods, however, still consider relatively simple pedigrees, for example, they are not able to handle half-sibling situations where a pair of individuals only share one parent. In this work, we propose an efficient method, IPED2, based on our previous work, which specifically targets reconstruction of complicated pedigrees that include half-siblings. We note that the presence of half-siblings makes the reconstruction problem significantly more challenging which is why previous methods exclude the possibility of half-siblings. We proposed a novel model as well as an efficient graph algorithm and experiments show that our algorithm achieves relatively accurate reconstruction. To our knowledge, this is the first method that is able to handle pedigree reconstruction from genotype data when half-sibling exists in any generation of the pedigree.
Dan He 0001, Zhanyong Wang, Laxmi Parida, Eleazar Eskin
IEEE ACM Trans. Comput. Biol. Bioinform.2
2015 MINED: An Efficient Mutual Information Based Epistasis Detection Method to Improve Quantitative Genetic Trait Prediction
Dan He 0001, Zhanyong Wang, Laxmi Parida
ISBRA2
2015 Data-driven encoding for quantitative genetic trait prediction
abstract
MOTIVATION: Given a set of biallelic molecular markers, such as SNPs, with genotype values on a collection of plant, animal or human samples, the goal of quantitative genetic trait prediction is to predict the quantitative trait values by simultaneously modeling all marker effects. Quantitative genetic trait prediction is usually represented as linear regression models which require quantitative encodings for the genotypes: the three distinct genotype values, corresponding to one heterozygous and two homozygous alleles, are usually coded as integers, and manipulated algebraically in the model. Further, epistasis between multiple markers is modeled as multiplication between the markers: it is unclear that the regression model continues to be effective under this. In this work we investigate the effects of encodings to the quantitative genetic trait prediction problem. RESULTS: We first showed that different encodings lead to different prediction accuracies, in many test cases. We then proposed a data-driven encoding strategy, where we encode the genotypes according to their distribution in the phenotypes and we allow each marker to have different encodings. We show in our experiments that this encoding strategy is able to improve the performance of the genetic trait prediction method and it is more helpful for the oligogenic traits, whose values rely on a relatively small set of markers. To the best of our knowledge, this is the first paper that discusses the effects of encodings to the genetic trait prediction problem.
Dan He 0001, Zhanyong Wang, Laxmi Parida
BMC Bioinform.2
2014 Gene-Gene Interactions Detection Using a Two-Stage Model
Zhanyong Wang, Jae Hoon Sul, Sagi Snir, José Antonio Lozano 0001, Eleazar Eskin
RECOMB1
2013 IPED: Inheritance Path Based Pedigree Reconstruction Algorithm Using Genotype Data
Dan He 0001, Zhanyong Wang, Buhm Han, Laxmi Parida, Eleazar Eskin
RECOMB2
2013 Leveraging reads that span multiple single nucleotide polymorphisms for haplotype inference from sequencing data
abstract
MOTIVATION: Haplotypes, defined as the sequence of alleles on one chromosome, are crucial for many genetic analyses. As experimental determination of haplotypes is extremely expensive, haplotypes are traditionally inferred using computational approaches from genotype data, i.e. the mixture of the genetic information from both haplotypes. Best performing approaches for haplotype inference rely on Hidden Markov Models, with the underlying assumption that the haplotypes of a given individual can be represented as a mosaic of segments from other haplotypes in the same population. Such algorithms use this model to predict the most likely haplotypes that explain the observed genotype data conditional on reference panel of haplotypes. With rapid advances in short read sequencing technologies, sequencing is quickly establishing as a powerful approach for collecting genetic variation information. As opposed to traditional genotyping-array technologies that independently call genotypes at polymorphic sites, short read sequencing often collects haplotypic information; a read spanning more than one polymorphic locus (multi-single nucleotide polymorphic read) contains information on the haplotype from which the read originates. However, this information is generally ignored in existing approaches for haplotype phasing and genotype-calling from short read data. RESULTS: In this article, we propose a novel framework for haplotype inference from short read sequencing that leverages multi-single nucleotide polymorphic reads together with a reference panel of haplotypes. The basis of our approach is a new probabilistic model that finds the most likely haplotype segments from the reference panel to explain the short read sequencing data for a given individual. We devised an efficient sampling method within a probabilistic model to achieve superior performance than existing methods. Using simulated sequencing reads from real individual genotypes in the HapMap data and the 1000 Genomes projects, we show that our method is highly accurate and computationally efficient. Our haplotype predictions improve accuracy over the basic haplotype copying model by ∼20% with comparable computational time, and over another recently proposed approach Hap-SeqX by ∼10% with significantly reduced computational time and memory usage. AVAILABILITY: Publicly available software is available at http://genetics.cs.ucla.edu/harsh CONTACT: [email protected] or [email protected].
Wen-Yun Yang, Farhad Hormozdiari, Zhanyong Wang, Dan He 0001, Bogdan Pasaniuc, Eleazar Eskin
Bioinform.3
2012 CNVeM: Copy Number Variation Detection Using Uncertainty of Read Mapping
Zhanyong Wang, Farhad Hormozdiari, Wen-Yun Yang, Eran Halperin, Eleazar Eskin
RECOMB1
2009 Approximation Algorithms for Reconstructing the Duplication History of Tandem Repeats
Zhi-Zhong Chen, Lusheng Wang 0001, Zhanyong Wang
Algorithmica3
2009 Linked region detection using high-density SNP genotype data via the minimum recombinant model of pedigree haplotype inference
abstract
BACKGROUND: With the rapid development of high-throughput genotyping technologies, efficient methods for identifying linked regions using high-density SNP genotype data have become more and more important. Recently, a deterministic method that works very well on SNP genotyping data has been developed (Lin et al. Bioinformatics 2008, 24(1): 86-93). However, that program can only work on a limited number of family structures. In particular, the results (if any) will be poor when the genotype data for the whole chromosome of one of the parents in a nuclear family is missing. RESULTS: We have developed a software package (LIden) for identifying linked regions using high-density SNP genotype data. We focus on handling the case where the genotype data for the whole chromosome of one of the parents in a nuclear family is missing. We use the minimum recombinant model for haplotype inference in pedigrees. Several local optimization algorithms are used to infer the haplotype of each individual and determine the linked regions based on the inferred haplotype data. We have developed a more flexible method to combine nuclear families to further refine (reduce the length of) the linked regions. CONCLUSION: Our new package (LIden) is efficient software for linked region detection using high-density SNP genotype data. LIden can handle some important cases where the existing programs do not work well. In particular, the new package can handle many cases where the genotype data of one of the two parents is missing for the entire chromosome. The running time of the program is O(mn), where m is the number of members in the family and n is the number of SNP sites in the chromosome. LIden is specifically suitable for handling big sized families. This research also demonstrates another practical use of the minimum recombinant model for haplotype inference in pedigrees. The software package can be downloaded at http://www.cs.cityu.edu.hk/~lwang/software/Link.
Lusheng Wang 0001, Zhanyong Wang, Wanling Yang
BMC Bioinform.2
2008 Identification of linked regions using high-density SNP genotype data in linkage analysis
abstract
MOTIVATION: With the knowledge of large number of SNPs in human genome and the fast development in high-throughput genotyping technologies, identification of linked regions in linkage analysis through allele sharing status determination will play an ever important role, while consideration of recombination fractions becomes unnecessary. RESULTS: In this study, we have developed a rule-based program that identifies linked regions for underlined diseases using allele sharing information among family members. Our program uses high-density SNP genotype data and works in the face of genotyping errors. It works on nuclear family structures with two or more siblings. The program graphically displays allele sharing status for all members in a pedigree and identifies regions that are potentially linked to the underlined diseases according to user-specified inheritance mode and penetrance. Extensive simulations based on the chi(2) model for recombination show that our program identifies linked regions with high sensitivity and accuracy. Graphical display of allele sharing status helps to detect misspecification of inheritance mode and penetrance, as well as mislabeling or misdiagnosis. Allele sharing determination may represent the future direction of linkage analysis due to its better adaptation to high-density SNP genotyping data. AVAILABILITY: http://paed.hku.hk/uploadarea/yangwl/html/index.html
Guohui Lin, Zhanyong Wang, Lusheng Wang 0001, Yu-Lung Lau, Wanling Yang
Bioinform.2
2007 Approximation Algorithms for Reconstructing the Duplication History of Tandem Repeats
Lusheng Wang 0001, Zhanyong Wang, Zhi-Zhong Chen
COCOON2
2007 Identification of Distinguishing Motifs
Wangsen Feng, Zhanyong Wang, Lusheng Wang 0001
CPM2