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

David Golan

dblp:60/7969 · DBLP profile ↗
← Back
7ranked-venue papers
4as first author
0since 2021 · last 2019
—ORCID · none

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

Applied, interdisciplinary, general and emerging computing · 6 · 4 first-authorArtificial intelligence and machine learning · 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
7 papers
Bioinformatics and computational biology · 100%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology
case-control study
0.412019
Maximum Likelihood for Gaussian Process Classification and Generalized Linear Mixed Models under Case-Control Sampling · J. Mach. Learn. Res. 2019
Bioinformatics and computational biology › statistical genetics
genetic association study
0.412019
Maximum Likelihood for Gaussian Process Classification and Generalized Linear Mixed Models under Case-Control Sampling · J. Mach. Learn. Res. 2019
Bioinformatics and computational biology › phylogenetics › phylogenetic inference
maximum likelihood estimation
0.412019
Maximum Likelihood for Gaussian Process Classification and Generalized Linear Mixed Models under Case-Control Sampling · J. Mach. Learn. Res. 2019
Bioinformatics and computational biology
genomics
0.322012
Weighted pooling - practical and cost-effective techniques for pooled high-throughput sequencing · Bioinform. 2012
lobSTR: A Short Tandem Repeat Profiler for Personal Genomes · RECOMB 2012
Bioinformatics and computational biology › sequence analysis › high-throughput sequencing data analysis
deep sequencing data analysis
0.212015
Deep sequencing analysis of viral infection and evolution allows rapid and detailed characterization of viral mutant spectrum · Bioinform. 2015
Bioinformatics and computational biology › genomics
viral genomics
0.212015
Deep sequencing analysis of viral infection and evolution allows rapid and detailed characterization of viral mutant spectrum · Bioinform. 2015
Bioinformatics and computational biology › sequence analysis
base calling
0.212013
Using state machines to model the Ion Torrent sequencing process and to improve read error rates · Bioinform. 2013
Bioinformatics and computational biology › genomics
sequencing
0.212013
Using state machines to model the Ion Torrent sequencing process and to improve read error rates · Bioinform. 2013
Bioinformatics and computational biology › genomics › high-throughput sequencing
pooled sequencing
0.112012
Weighted pooling - practical and cost-effective techniques for pooled high-throughput sequencing · Bioinform. 2012
Bioinformatics and computational biology › statistical genetics › rare variant analysis
rare variant detection
0.112012
Weighted pooling - practical and cost-effective techniques for pooled high-throughput sequencing · Bioinform. 2012
Bioinformatics and computational biology › genomics › genotyping
short tandem repeat genotyping
0.112012
lobSTR: A Short Tandem Repeat Profiler for Personal Genomes · RECOMB 2012
Bioinformatics and computational biology › genomics
genome-wide association study
0.112011
Accurate estimation of heritability in genome wide studies using random effects models · Bioinform. 2011
Bioinformatics and computational biology › statistical genetics
heritability estimation
0.112011
Accurate estimation of heritability in genome wide studies using random effects models · Bioinform. 2011
Bioinformatics and computational biology
statistical genetics
0.112011
Accurate estimation of heritability in genome wide studies using random effects models · Bioinform. 2011
Bioinformatics and computational biology › molecular evolution › evolutionary bioinformatics › evolutionary genomics
genome evolution
0.112010
Biased hosting of intronic microRNA genes · Bioinform. 2010
Bioinformatics and computational biology › gene regulation
regulatory genomics
0.112010
Biased hosting of intronic microRNA genes · Bioinform. 2010

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

expectation propagation · 0.4composite likelihood · 0.4variant calling · 0.2sequence assembly · 0.2viterbi algorithm · 0.2state machine · 0.2simulation · 0.1short tandem repeat genotyping · 0.1combinatorial pooling · 0.1markov chain monte carlo · 0.1
YearPublicationVenuePosition
2019 Maximum Likelihood for Gaussian Process Classification and Generalized Linear Mixed Models under Case-Control Sampling
abstract
Modern data sets in various domains often include units that were sampled non-randomly from the population and have a latent correlation structure. Here we investigate a common form of this setting, where every unit is associated with a latent variable, all latent variables are correlated, and the probability of sampling a unit depends on its response. Such settings often arise in case-control studies, where the sampled units are correlated due to spatial proximity, family relations, or other sources of relatedness. Maximum likelihood estimation in such settings is challenging from both a computational and statistical perspective, necessitating approximations that take the sampling scheme into account. We propose a family of approximate likelihood approaches which combine composite likelihood and expectation propagation. We demonstrate the efficacy of our solutions via extensive simulations. We utilize them to investigate the genetic architecture of several complex disorders collected in case-control genetic association studies, where hundreds of thousands of genetic variants are measured for every individual, and the underlying disease liabilities of individuals are correlated due to genetic similarity. Our work is the first to provide a tractable likelihood-based solution for case-control data with complex dependency structures.
Omer Weissbrod, Shachar Kaufman, David Golan, Saharon Rosset
J. Mach. Learn. Res.3
2015 Deep sequencing analysis of viral infection and evolution allows rapid and detailed characterization of viral mutant spectrum
abstract
MOTIVATION: The study of RNA virus populations is a challenging task. Each population of RNA virus is composed of a collection of different, yet related genomes often referred to as mutant spectra or quasispecies. Virologists using deep sequencing technologies face major obstacles when studying virus population dynamics, both experimentally and in natural settings due to the relatively high error rates of these technologies and the lack of high performance pipelines. In order to overcome these hurdles we developed a computational pipeline, termed ViVan (Viral Variance Analysis). ViVan is a complete pipeline facilitating the identification, characterization and comparison of sequence variance in deep sequenced virus populations. RESULTS: Applying ViVan on deep sequenced data obtained from samples that were previously characterized by more classical approaches, we uncovered novel and potentially crucial aspects of virus populations. With our experimental work, we illustrate how ViVan can be used for studies ranging from the more practical, detection of resistant mutations and effects of antiviral treatments, to the more theoretical temporal characterization of the population in evolutionary studies. AVAILABILITY AND IMPLEMENTATION: Freely available on the web at http://www.vivanbioinfo.org CONTACT: : [email protected] SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Ofer Isakov, Antonio V. Bordería, David Golan, Amir Hamenahem, Gershon Celniker, Liron Yoffe, Hervé Blanc, Marco Vignuzzi, Noam Shomron
Bioinform.3
2013 Using state machines to model the Ion Torrent sequencing process and to improve read error rates
abstract
MOTIVATION: The importance of fast and affordable DNA sequencing methods for current day life sciences, medicine and biotechnology is hard to overstate. A major player is Ion Torrent, a pyrosequencing-like technology which produces flowgrams--sequences of incorporation values--which are converted into nucleotide sequences by a base-calling algorithm. Because of its exploitation of ubiquitous semiconductor technology and innovation in chemistry, Ion Torrent has been gaining popularity since its debut in 2011. Despite the advantages, however, Ion Torrent read accuracy remains a significant concern. RESULTS: We present FlowgramFixer, a new algorithm for converting flowgrams into reads. Our key observation is that the incorporation signals of neighboring flows, even after normalization and phase correction, carry considerable mutual information and are important in making the correct base-call. We therefore propose that base-calling of flowgrams should be done on a read-wide level, rather than one flow at a time. We show that this can be done in linear-time by combining a state machine with a Viterbi algorithm to find the nucleotide sequence that maximizes the likelihood of the observed flowgram. FlowgramFixer is applicable to any flowgram-based sequencing platform. We demonstrate FlowgramFixer's superior performance on Ion Torrent Escherichia coli data, with a 4.8% improvement in the number of high-quality mapped reads and a 7.1% improvement in the number of uniquely mappable reads. AVAILABILITY: Binaries and source code of FlowgramFixer are freely available at: http://www.cs.tau.ac.il/~davidgo5/flowgramfixer.html.
David Golan, Paul Medvedev
Bioinform.1
2012 lobSTR: A Short Tandem Repeat Profiler for Personal Genomes
Melissa Gymrek, David Golan, Saharon Rosset, Yaniv Erlich
RECOMB2
2012 Weighted pooling - practical and cost-effective techniques for pooled high-throughput sequencing
abstract
MOTIVATION: Despite the rapid decline in sequencing costs, sequencing large cohorts of individuals is still prohibitively expensive. Recently, several sophisticated pooling designs were suggested that can identify carriers of rare alleles in large cohorts with a significantly smaller number of pools, thus dramatically reducing the cost of such large-scale sequencing projects. These approaches use combinatorial pooling designs where each individual is either present or absent from a pool. One can then infer the number of carriers in a pool, and by combining information across pools, reconstruct the identity of the carriers. RESULTS: We show that one can gain further efficiency and cost reduction by using 'weighted' designs, in which different individuals donate different amounts of DNA to the pools. Intuitively, in this situation, the number of mutant reads in a pool does not only indicate the number of carriers, but also their identity. We describe and study a powerful example of such weighted designs, using non-overlapping pools. We demonstrate that this approach is not only easier to implement and analyze but is also competitive in terms of accuracy with combinatorial designs when identifying rare variants, and is superior when sequencing common variants. We then discuss how weighting can be incorporated into existing combinatorial designs to increase their accuracy and demonstrate the resulting improvement using simulations. Finally, we argue that weighted designs have enough power to facilitate detection of common alleles, so they can be used as a cornerstone of whole-exome sequencing projects.
David Golan, Yaniv Erlich, Saharon Rosset
Bioinform.1
2011 Accurate estimation of heritability in genome wide studies using random effects models
abstract
MOTIVATION: Random effects models have recently been introduced as an approach for analyzing genome wide association studies (GWASs), which allows estimation of overall heritability of traits without explicitly identifying the genetic loci responsible. Using this approach, Yang et al. (2010) have demonstrated that the heritability of height is much higher than the ~10% associated with identified genetic factors. However, Yang et al. (2010) relied on a heuristic for performing estimation in this model. RESULTS: We adopt the model framework of Yang et al. (2010) and develop a method for maximum-likelihood (ML) estimation in this framework. Our method is based on Monte-Carlo expectation-maximization (MCEM; Wei et al., 1990), an expectation-maximization algorithm wherein a Markov chain Monte Carlo approach is used in the E-step. We demonstrate that this method leads to more stable and accurate heritability estimation compared to the approach of Yang et al. (2010), and it also allows us to find ML estimates of the portion of markers which are causal, indicating whether the heritability stems from a small number of powerful genetic factors or a large number of less powerful ones. CONTACT: [email protected].
David Golan, Saharon Rosset
Bioinform.1
2010 Biased hosting of intronic microRNA genes
abstract
MOTIVATION: MicroRNAs (miRNAs) are involved in an abundant class of post-transcriptional regulation activated through binding to the 3(') -untranslated region (UTR) of mRNAs. The current wealth of mammalian miRNA genes results mostly from genomic duplication events. Many of these events are located within introns of transcriptional units. In order to better understand the genomic expansion of miRNA genes, we investigated the distribution of intronic miRNAs. RESULTS: We observe that miRNA genes are hosted within introns of short genes much larger than expected by chance. IMPLEMENTATION: We explore several explanations for this phenomenon and conclude that miRNA integration into short genes might be evolutionary favorable due to interaction with the pre-mRNA splicing mechanism.
David Golan, Carmit Levy, Brad Friedman, Noam Shomron
Bioinform.1