160 citations · 224 across the 30 of their papers we have counts for
16 papers · 1 filter
Testing Convex Truncation
Anindya De, Shivam Nadimpalli, Rocco A. Servedio
We study the basic statistical problem of testing whether normally distributed -dimensional data has been truncated, i.e. altered by only retaining points that lie in some unkno…
Approximate Trace Reconstruction from a Single Trace
Xi Chen, Anindya De, Chin Ho Lee +2
The well-known trace reconstruction problem is the problem of inferring an unknown source string from independent "traces", i.e. copies of that have been corr…
Reconstructing Ultrametric Trees from Noisy Experiments
Eshwar Ram Arunachaleswaran, Anindya De, Sampath Kannan
The problem of reconstructing evolutionary trees or phylogenies is of great interest in computational biology. A popular model for this problem assumes that we are given the set of…
Near-Optimal Average-Case Approximate Trace Reconstruction from Few Traces
Xi Chen, Anindya De, Chin Ho Lee +2
In the standard trace reconstruction problem, the goal is to \emph{exactly} reconstruct an unknown source string from independent "traces", which are cop…
Approximating Sumset Size
Anindya De, Shivam Nadimpalli, Rocco A. Servedio
Given a subset of the -dimensional Boolean hypercube , the sumset is the set where addition is in . Sumsets pla…
Polynomial-time trace reconstruction in the low deletion rate regime
Xi Chen, Anindya De, Chin Ho Lee +2
In the \emph{trace reconstruction problem}, an unknown source string is transmitted through a probabilistic \emph{deletion channel} which independently deletes ea…