Publications

Found 82 results
Author Title Type [ Year(Asc)]
Filters: Author is Eran Halperin  [Clear All Filters]
2006
Marchini, J., Cutler D., Patterson N., Stephens M., Eskin E., Halperin E., et al. (2006).  A Comparison of Phasing Algorithms for Trios and Unrelated Individuals. American Journal of Human Genetics. 78(3), 437-450.
Blelloch, G. E., Dhamdhere K., Halperin E., Ravi RR., Schwartz R., & Sridhar S. (2006).  Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction. Proceedings of the 33rd International Colloquium on Automata, Languages, and Programming (ICALP 2006). 667-678.
Eskin, E., Halperin E., & Sharan R. (2006).  A Note on Optimally Phasing Long Genomic Regions Using Local Haplotype Predictions. Journal of Bioinformatics and Computational Biology. 4(3), 639-647.
Beckman, K.. B., Abel K.. A., Braun A.., & Halperin E. (2006).  Using DNA Pools for Genotyping Trios. Nucleic Acids Research. 34(19), 
2005
Chuzhoy, J., Guha S., Halperin E., Khanna S., Kortsarz G., Krauthgamer R., et al. (2005).  Asymmetric K-Center Is Log* N-Hard to Approximate. Journal of the ACM. 52(4), 538-551.
Halperin, E., & Hazan E. (2005).  Estimating Haplotype Frequencies Efficiently. Proceedings of the 9th Annual International Conference on Research in Computational Molecular Biology (RECOMB'05). 553-568.
Halperin, E., & Hazan E. (2005).  Haplofreq - Estimating Haplotype Frequencies Efficiently. Proceedings of the 9th Annual International Conference on Research in Computational Molecular Biology (RECOMB'05). 553-568.
Zaitlen, N., Kang H. Min, Feolo M. L., Sherry S. T., Halperin E., & Eskin E. (2005).  Inference and Analysis of Haplotypes from Combined Genotyping Studies Deposited in dbSNP. Genome Research. 15(11), 1594-1600.
Halperin, E., & Karp R. M. (2005).  The Minimum-Entropy Set Cover Problem. Theoretical Computer Science. 348(2), 240-250.
Cohen, E., Halperin E., & Kaplan H.. (2005).  Performance Aspects of Distributed Caches Using TTL-Based Consistency. Theoretical Computer Science. 331(1), 73-96.
Halperin, E., Kimmel G., & Shamir R. (2005).  Tag SNP Selection in Genotype Data for Maximizing SNP Prediction Accuracy. Proceedings of the 13th Annual International Conference on Intelligent Systems for Molecular Biology (ISMB 2005). 195-203.
Hinds, D.. A., Stuve L.. L., Nilsen G.. B., Halperin E., Eskin E., Ballinger D.. G., et al. (2005).  Whole-Genome Patterns of Common DNA Variation in Three Human Populations. Science. 307(5712), 1072-1079.
2004
Halperin, E., & Eskin E. (2004).  Haplotype Reconstruction from Genotype Data Using Imperfect Phylogeny. Bioinformatics.
Halperin, E., & Karp R. M. (2004).  The Minimum-Entropy Set Cover Problem. Proceedings of ICALP.
Eskin, E., Halperin E., & Sharan R. (2004).  Optimally Phasing Long Genomic Regions using Local Haplotype Predictions. Proceedings of the Second RECOMB Satellite Workshop on Computational Methods for SNPs and Haplotypes. 13-16.
Halperin, E., & Karp R. M. (2004).  Perfect Phylogeny and Haplotype Assignment. Proceedings of RECOMB.
Chuzhoy, J., Guha S., Halperin E., Khanna S., Kortsarz G., & Naor S.. (2004).  Tight Lower Bounds for the Asymetric k-Center Problem. Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC04).
2003
Halperin, E., Buhler J., Karp R. M., Krauthgamer R., & Westover B. P. (2003).  Detecting Protein Sequences via Metric Embeddings. Proceedings of the 11th International Conference on Intelligent Systems for Molecular Biology (ISMB). 122-129.
Eskin, E., Halperin E., & Karp R. M. (2003).  Efficient Reconstruction of Haplotype Structure Via Perfect Phylogeny. Journal of Bioinformatics and Computational Biology. 1(1), 1-20.
Gandhi, R., Halperin E., Khuller S., Kortsarz G., & Srinivasan A. (2003).  An Improved Approximation Algorithm for Vertex Cover with Hard Capacities. Proceedings of the 30th International Colloquium on Automata, Languages and Programming (ICALP 2003). 164-175.
Halperin, E., Kortsarz G., Krauthgamer R., Srinivasan A., & Wang N.. (2003).  Integrality Ratio for Group Steiner Trees and Directed Steiner Trees. Proceedings of the Twelfth Symposium on Discrete Algorithms (SODA).

Pages