Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
12
click to vote
SODA
2008
ACM
favorite
Email
discuss
report
69
views
Algorithms
»
more
SODA 2008
»
Trace reconstruction with constant deletion probability and related results
14 years 8 days ago
Download
theory.stanford.edu
Thomas Holenstein, Michael Mitzenmacher, Rina Pani
Real-time Traffic
Algorithms
|
SODA 2008
|
claim paper
Related Content
»
Reconstructing strings from random traces
»
Deconvolving sequence variation in mixed DNA populations
»
The Stability of LowRank Matrix Reconstruction a Constrained Singular Value View
»
Optimal phylogenetic reconstruction
»
Comparison of methods for estimating the nucleotide substitution matrix
more »
Post Info
More Details (n/a)
Added
30 Oct 2010
Updated
30 Oct 2010
Type
Conference
Year
2008
Where
SODA
Authors
Thomas Holenstein, Michael Mitzenmacher, Rina Panigrahy, Udi Wieder
Comments
(0)
Researcher Info
Algorithms Study Group
Computer Vision