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

Daniel Taliun

dblp:56/10819 · DBLP profile ↗
← Back
7ranked-venue papers
3as first author
1since 2021 · last 2021
0000-0002-8874-5044ORCID · corroborated

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

Applied, interdisciplinary, general and emerging computing · 7 · 3 first-author · 1 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
5 papers
Bioinformatics and computational biology · 100%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology
population genetics
0.722019
emeraLD: rapid linkage disequilibrium estimation with massive datasets · Bioinform. 2019
LASER server: ancestry tracing with genotypes or sequence reads · Bioinform. 2017
Bioinformatics and computational biology › genomics › genome-wide association study
GWAS visualization
0.512021
LocusZoom.js: interactive and embeddable visualization of genetic association study results · Bioinform. 2021
Bioinformatics and computational biology › population genetics
linkage disequilibrium
0.412019
emeraLD: rapid linkage disequilibrium estimation with massive datasets · Bioinform. 2019
Bioinformatics and computational biology › population genetics
ancestry inference
0.312017
LASER server: ancestry tracing with genotypes or sequence reads · Bioinform. 2017
Bioinformatics and computational biology › statistical genetics
genotype data analysis
0.312017
LASER server: ancestry tracing with genotypes or sequence reads · Bioinform. 2017
Bioinformatics and computational biology › genomics
genome-wide association study
0.322019
GWAtoolbox: an R package for fast quality control and handling of genome-wide association studies meta-analysis data · Bioinform. 2012
emeraLD: rapid linkage disequilibrium estimation with massive datasets · Bioinform. 2019
Bioinformatics and computational biology
genetic epidemiology
0.212016
FamAgg: an R package to evaluate familial aggregation of traits in large pedigrees · Bioinform. 2016
Bioinformatics and computational biology › statistical genetics
pedigree analysis
0.212016
FamAgg: an R package to evaluate familial aggregation of traits in large pedigrees · Bioinform. 2016
Bioinformatics and computational biology
statistical genetics
0.212016
FamAgg: an R package to evaluate familial aggregation of traits in large pedigrees · Bioinform. 2016
Bioinformatics and computational biology › genomics
genome visualization
0.112021
LocusZoom.js: interactive and embeddable visualization of genetic association study results · Bioinform. 2021
Bioinformatics and computational biology › genomics › genome-wide association study
summary statistics
0.112019
emeraLD: rapid linkage disequilibrium estimation with massive datasets · Bioinform. 2019

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

web upload service · 0.5javascript library · 0.5sparsity exploitation · 0.4haplotype structure exploitation · 0.4ancestry space projection · 0.3permutation testing · 0.2bayesian inference · 0.2statistical quality control · 0.1
YearPublicationVenuePosition
2021 LocusZoom.js: interactive and embeddable visualization of genetic association study results
abstract
SUMMARY: LocusZoom.js is a JavaScript library for creating interactive web-based visualizations of genetic association study results. It can display one or more traits in the context of relevant biological data (such as gene models and other genomic annotation), and allows interactive refinement of analysis models (by selecting linkage disequilibrium reference panels, identifying sets of likely causal variants, or comparisons to the GWAS catalog). It can be embedded in web pages to enable data sharing and exploration. Views can be customized and extended to display other data types such as phenome-wide association study (PheWAS) results, chromatin co-accessibility, or eQTL measurements. A new web upload service harmonizes datasets, adds annotations, and makes it easy to explore user-provided result sets. AVAILABILITY AND IMPLEMENTATION: LocusZoom.js is open-source software under a permissive MIT license. Code and documentation are available at: https://github.com/statgen/locuszoom/. Installable packages for all versions are also distributed via NPM. Additional features are provided as standalone libraries to promote reuse. Use with your own GWAS results at https://my.locuszoom.org/. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Andrew P. Boughton, Ryan P. Welch, Matthew Flickinger, Peter VandeHaar, Daniel Taliun, Gonçalo R. Abecasis, Michael Boehnke
Bioinform.5
2019 emeraLD: rapid linkage disequilibrium estimation with massive datasets
abstract
Summary: Estimating linkage disequilibrium (LD) is essential for a wide range of summary statistics-based association methods for genome-wide association studies. Large genetic datasets, e.g. the TOPMed WGS project and UK Biobank, enable more accurate and comprehensive LD estimates, but increase the computational burden of LD estimation. Here, we describe emeraLD (Efficient Methods for Estimation and Random Access of LD), a computational tool that leverages sparsity and haplotype structure to estimate LD up to 2 orders of magnitude faster than current tools. Availability and implementation: emeraLD is implemented in C++, and is open source under GPLv3. Source code and documentation are freely available at http://github.com/statgen/emeraLD. Supplementary information: Supplementary data are available at Bioinformatics online.
Corbin Quick, Christian Fuchsberger, Daniel Taliun, Gonçalo R. Abecasis, Michael Boehnke, Hyun Min Kang
Bioinform.3
2017 LASER server: ancestry tracing with genotypes or sequence reads
abstract
SUMMARY: To enable direct comparison of ancestry background in different studies, we developed LASER to estimate individual ancestry by placing either sezquenced or genotyped samples in a common ancestry space, regardless of the sequencing strategy or genotyping array used to characterize each sample. Here we describe the LASER server to facilitate application of the method to a wide range of genetic studies. The server provides genetic ancestry estimation for different geographic regions and user-friendly interactive visualization of the results. AVAILABILITY AND IMPLEMENTATION: The LASER server is freely accessible at http://laser.sph.umich.edu/. CONTACT: [email protected] or [email protected]. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Daniel Taliun, Sonia P. Chothani, Sebastian Schönherr, Lukas Forer, Michael Boehnke, Gonçalo R. Abecasis, Chaolong Wang
Bioinform.1
2016 FamAgg: an R package to evaluate familial aggregation of traits in large pedigrees
abstract
UNLABELLED: Familial aggregation analysis is the first fundamental step to perform when assessing the extent of genetic background of a disease. However, there is a lack of software to analyze the familial clustering of complex phenotypes in very large pedigrees. Such pedigrees can be utilized to calculate measures that express trait aggregation on both the family and individual level, providing valuable directions in choosing families for detailed follow-up studies. We developed FamAgg, an open source R package that contains both established and novel methods to investigate familial aggregation of traits in large pedigrees. We demonstrate its use and interpretation by analyzing a publicly available cancer dataset with more than 20 000 participants distributed across approximately 400 families. AVAILABILITY AND IMPLEMENTATION: The FamAgg package is freely available at the Bioconductor repository, http://www.bioconductor.org/packages/FamAgg CONTACT: [email protected] SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Johannes Rainer, Daniel Taliun, Yuri D'Elia, Cristian Pattaro, Francisco S. Domingues, Christian X. Weichenberger
Bioinform.2
2016 Fast Sampling-Based Whole-Genome Haplotype Block Recognition
abstract
Scaling linkage disequilibrium (LD) based haplotype block recognition to the entire human genome has always been a challenge. The best-known algorithm has quadratic runtime complexity and, even when sophisticated search space pruning is applied, still requires several days of computations. Here, we propose a novel sampling-based algorithm, called S-MIG (++), where the main idea is to estimate the area that most likely contains all haplotype blocks by sampling a very small number of SNP pairs. A subsequent refinement step computes the exact blocks by considering only the SNP pairs within the estimated area. This approach significantly reduces the number of computed LD statistics, making the recognition of haplotype blocks very fast. We theoretically and empirically prove that the area containing all haplotype blocks can be estimated with a very high degree of certainty. Through experiments on the 243,080 SNPs on chromosome 20 from the 1,000 Genomes Project, we compared our previous algorithm MIG (++) with the new S-MIG (++) and observed a runtime reduction from 2.8 weeks to 34.8 hours. In a parallelized version of the S-MIG (++) algorithm using 32 parallel processes, the runtime was further reduced to 5.1 hours.
Daniel Taliun, Johann Gamper, Ulf Leser, Cristian Pattaro
IEEE ACM Trans. Comput. Biol. Bioinform.1
2014 Efficient haplotype block recognition of very long and dense genetic sequences
abstract
BACKGROUND: The new sequencing technologies enable to scan very long and dense genetic sequences, obtaining datasets of genetic markers that are an order of magnitude larger than previously available. Such genetic sequences are characterized by common alleles interspersed with multiple rarer alleles. This situation has renewed the interest for the identification of haplotypes carrying the rare risk alleles. However, large scale explorations of the linkage-disequilibrium (LD) pattern to identify haplotype blocks are not easy to perform, because traditional algorithms have at least Θ(n2) time and memory complexity. RESULTS: We derived three incremental optimizations of the widely used haplotype block recognition algorithm proposed by Gabriel et al. in 2002. Our most efficient solution, called MIG ++, has only Θ(n) memory complexity and, on a genome-wide scale, it omits >80% of the calculations, which makes it an order of magnitude faster than the original algorithm. Differently from the existing software, the MIG ++ analyzes the LD between SNPs at any distance, avoiding restrictions on the maximal block length. The haplotype block partition of the entire HapMap II CEPH dataset was obtained in 457 hours. By replacing the standard likelihood-based D' variance estimator with an approximated estimator, the runtime was further improved. While producing a coarser partition, the approximate method allowed to obtain the full-genome haplotype block partition of the entire 1000 Genomes Project CEPH dataset in 44 hours, with no restrictions on allele frequency or long-range correlations. These experiments showed that LD-based haplotype blocks can span more than one million base-pairs in both HapMap II and 1000 Genomes datasets. An application to the North American Rheumatoid Arthritis Consortium (NARAC) dataset shows how the MIG ++ can support genome-wide haplotype association studies. CONCLUSIONS: The MIG ++ enables to perform LD-based haplotype block recognition on genetic sequences of any length and density. In the new generation sequencing era, this can help identify haplotypes that carry rare variants of interest. The low computational requirements open the possibility to include the haplotype block structure into genome-wide association scans, downstream analyses, and visual interfaces for online genome browsers.
Daniel Taliun, Johann Gamper, Cristian Pattaro
BMC Bioinform.1
2012 GWAtoolbox: an R package for fast quality control and handling of genome-wide association studies meta-analysis data
abstract
SUMMARY: The GWAtoolbox is an R package that standardizes and accelerates the handling of data from genome-wide association studies (GWAS), particularly in the context of large-scale GWAS meta-analyses. A key feature of GWAtoolbox is its ability to perform quality control (QC) of any number of files in a matter of minutes. The implemented workflow has been structured to check three particular data quality aspects: (i) data formatting, (ii) quality of the GWAS results and (iii) data consistency across studies. Output consists of an extensive list of quality statistics and plots which allow inspection of individual files and between-study comparison to identify systematic bias. AVAILABILITY: http://www.eurac.edu/GWAtoolbox CONTACT: [email protected]; [email protected] SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Christian Fuchsberger, Daniel Taliun, Peter P. Pramstaller, Cristian Pattaro
Bioinform.2