( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
eALPS: Estimating Abundance Levels in Pooled Sequencing Using Available Genotyping Data.

, , , , , , и . RECOMB, том 7821 из Lecture Notes in Computer Science, стр. 32-44. Springer, (2013)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Emre Eran

Asl han Eran

Hasan Gündüz Eran

Eran Gündüz

Charles Halperin

 

Другие публикации лиц с тем же именем

A stochastic process on the hypercube with applications to peer-to-peer networks., , , и . STOC, стр. 575-584. ACM, (2003)Combinatorial approximation algorithms for the maximum directed cut problem., и . SODA, стр. 1-7. ACM/SIAM, (2001)Haplotype Inference in Complex Pedigrees., , , и . RECOMB, том 5541 из Lecture Notes in Computer Science, стр. 108-120. Springer, (2009)Recycler: an algorithm for detecting plasmids from de novo assembly graphs., , , , , , и . Bioinform., 33 (4): 475-482 (2017)Fast lossless compression via cascading Bloom filters., , и . BMC Bioinform., 15 (S-9): S7 (2014)Using Stochastic Approximation Techniques to Efficiently Construct Confidence Intervals for Heritability., , , , , и . RECOMB, том 10229 из Lecture Notes in Computer Science, стр. 241-256. (2017)Integrality ratio for group Steiner trees and directed steiner trees., , , , и . SODA, стр. 275-284. ACM/SIAM, (2003)Reachability and distance queries via 2-hop labels., , , и . SODA, стр. 937-946. ACM/SIAM, (2002)The Minimum-Entropy Set Cover Problem., и . ICALP, том 3142 из Lecture Notes in Computer Science, стр. 733-744. Springer, (2004)Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs., и . IPCO, том 1610 из Lecture Notes in Computer Science, стр. 202-217. Springer, (1999)