Eran Halperin

According to our database1, Eran Halperin authored at least 68 papers between 1998 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Distinguishing Biological from Technical Sources of Variation Using a Combination of Methylation Datasets.
Proceedings of the Research in Computational Molecular Biology, 2019

2018
Faucet: streaming de novo assembly graph construction.
Bioinformatics, 2018

Tensor Composition Analysis Detects Cell-Type Specific Associations in Epigenetic Studies.
Proceedings of the Research in Computational Molecular Biology, 2018

2017
Association testing of bisulfite-sequencing methylation data via a Laplace approximation.
Bioinformatics, 2017

Recycler: an algorithm for detecting plasmids from de novo assembly graphs.
Bioinformatics, 2017

GLINT: a user-friendly toolset for the analysis of high-throughput DNA-methylation array data.
Bioinformatics, 2017

Using Stochastic Approximation Techniques to Efficiently Construct Confidence Intervals for Heritability.
Proceedings of the Research in Computational Molecular Biology, 2017

A Bayesian Framework for Estimating Cell Type Composition from DNA Methylation Without the Need for Methylation Reference.
Proceedings of the Research in Computational Molecular Biology, 2017

2015
A Note on the Relations Between Spatio-Genetic Models.
Journal of Computational Biology, 2015

Inferring parental genomic ancestries using pooled semi-Markov processes.
Bioinformatics, 2015

Multiple-Ancestor Localization for Recently Admixed Individuals.
Proceedings of the Algorithms in Bioinformatics - 15th International Workshop, 2015

2014
Historical Pedigree Reconstruction from Extant Populations Using PArtitioning of RElatives (PREPARE).
PLoS Computational Biology, 2014

Fast lossless compression via cascading Bloom filters.
BMC Bioinformatics, 2014

EPIQ - efficient detection of SNP-SNP epistatic interactions for quantitative traits.
Bioinformatics, 2014

2013
Probabilistic Inference of Viral Quasispecies Subject to Recombination.
Journal of Computational Biology, 2013

Analysis of Latino populations from GALA and MEC studies reveals genomic loci with biased local ancestry estimation.
Bioinformatics, 2013

Learning Natural Selection from the Site Frequency Spectrum.
Proceedings of the Research in Computational Molecular Biology, 2013

eALPS: Estimating Abundance Levels in Pooled Sequencing Using Available Genotyping Data.
Proceedings of the Research in Computational Molecular Biology, 2013

2012
Joint Analysis of Multiple Metagenomic Samples.
PLoS Computational Biology, 2012

MGMR: leveraging RNA-Seq population data to optimize expression estimation.
BMC Bioinformatics, 2012

Haplotype reconstruction using perfect phylogeny and sequence data.
BMC Bioinformatics, 2012

Fast and accurate inference of local ancestry in Latino populations.
Bioinformatics, 2012

Probabilistic Inference of Viral Quasispecies Subject to Recombination.
Proceedings of the Research in Computational Molecular Biology, 2012

CNVeM: Copy Number Variation Detection Using Uncertainty of Read Mapping.
Proceedings of the Research in Computational Molecular Biology, 2012

2011
Genotyping common and rare variation using overlapping pool sequencing.
BMC Bioinformatics, 2011

Pedigree Reconstruction Using Identity by Descent.
Proceedings of the Research in Computational Molecular Biology, 2011

2010
Haplotype Inference in Complex Pedigrees.
Journal of Computational Biology, 2010

miRNAkey: a software for microRNA deep sequencing analysis.
Bioinformatics, 2010

Accurate Estimation of Expression Levels of Homologous Genes in RNA-seq Experiments.
Proceedings of the Research in Computational Molecular Biology, 2010

2009
Inference of locus-specific ancestry in closely related populations.
Bioinformatics, 2009

Haplotype Inference in Complex Pedigrees.
Proceedings of the Research in Computational Molecular Biology, 2009

2008
On the Inference of Ancestries in Admixed Populations.
Proceedings of the Research in Computational Molecular Biology, 2008

2007
Algorithms for Efficient Near-Perfect Phylogenetic Tree Reconstruction in Theory and Practice.
IEEE/ACM Trans. Comput. Biology Bioinform., 2007

HAPLOPOOL: improving haplotype frequency estimation through DNA pools and phylogenetic modeling.
Bioinformatics, 2007

A rigorous analysis of population stratification with limited data.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

An Efficient and Accurate Graph-Based Approach to Detect Population Substructure.
Proceedings of the Research in Computational Molecular Biology, 2007

2006
HAPLOFREQ-Estimating Haplotype Frequencies Efficiently.
Journal of Computational Biology, 2006

A Note on Phasing Long Genomic Regions Using Local Haplotype Predictions.
J. Bioinformatics and Computational Biology, 2006

Simple Reconstruction of Binary Near-Perfect Phylogenetic Trees.
Proceedings of the Computational Science, 2006

Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

SNP and Haplotype Analysis - Algorithms and Applications.
Proceedings of the Combinatorial Pattern Matching, 17th Annual Symposium, 2006

2005
Asymmetric k-center is log* n-hard to approximate.
J. ACM, 2005

HAPLOFREQ - Estimating Haplotype Frequencies E.ciently.
Proceedings of the Research in Computational Molecular Biology, 2005

Tag SNP selection in genotype data for maximizing SNP prediction accuracy.
Proceedings of the Proceedings Thirteenth International Conference on Intelligent Systems for Molecular Biology 2005, 2005

2004
Haplotype reconstruction from genotype data using Imperfect Phylogeny.
Bioinformatics, 2004

Asymmetric k-center is log* n-hard to approximate.
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004

Perfect phylogeny and haplotype assignment.
Proceedings of the Eighth Annual International Conference on Computational Molecular Biology, 2004

The Minimum-Entropy Set Cover Problem.
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

2003
Tight lower bounds for the asymmetric k-center problem
Electronic Colloquium on Computational Complexity (ECCC), 2003

Polylogarithmic inapproximability.
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

A stochastic process on the hypercube with applications to peer-to-peer networks.
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

Integrality ratio for group Steiner trees and directed steiner trees.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Large scale reconstruction of haplotypes from genotype data.
Proceedings of the Sventh Annual International Conference on Computational Biology, 2003

Detecting protein sequence conservation via metric embeddings.
Proceedings of the Eleventh International Conference on Intelligent Systems for Molecular Biology, June 29, 2003

An Improved Approximation Algorithm for Vertex Cover with Hard Capacities.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002
Coloring k-colorable graphs using relatively small palettes.
J. Algorithms, 2002

MAX CUT in cubic graphs.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Reachability and distance queries via 2-hop labels.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Handling long targets and errors in sequencing by hybridization.
Proceedings of the Sixth Annual International Conference on Computational Biology, 2002

Improved Approximation Algorithms for the Partial Vertex Cover Problem.
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2002

2001
Combinatorial approximation algorithms for the maximum directed cut problem.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Coloring k-colorable graphs using smaller palettes.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

A Unified Framework for Obtaining Improved Approximation Algorithms for Maximum Graph Bisection Problems.
Proceedings of the Integer Programming and Combinatorial Optimization, 2001

Performance Aspects of Distributed Caches Using TTL-Based Consistency.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

2000
Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1999
FramePlus: aligning DNA to protein sequences.
Bioinformatics, 1999

Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs.
Proceedings of the Integer Programming and Combinatorial Optimization, 1999

1998
Bipartite subgraphs of integer weighted graphs.
Discrete Mathematics, 1998


  Loading...