6 search results - page 1 / 2 » Trace reconstruction with constant deletion probability and ... |
SODA
2008
ACM
13 years 11 months ago
2008
ACM
SODA
2004
ACM
13 years 11 months ago
2004
ACM
We are given a collection of m random subsequences (traces) of a string t of length n where each trace is obtained by deleting each bit in the string with probability q. Our goal ...
RECOMB
2002
Springer
14 years 10 months ago
2002
Springer
We present an original approach to identifying sequence variants in a mixed DNA population from sequence trace data. The heart of the method is based on parsimony: given a wildtyp...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The stability of low-rank matrix reconstruction is investigated in this paper. The -constrained minimal singular value ( -CMSV) of the measurement operator is shown to determine t...
STOC
2006
ACM
14 years 10 months ago
2006
ACM
One of the major tasks of evolutionary biology is the reconstruction of phylogenetic trees from molecular data. The evolutionary model is given by a Markov chain on the true evolu...