scientific article; zbMATH DE number 6469234
From MaRDI portal
Publication:5501353
zbMath1318.68206MaRDI QIDQ5501353
Sampath Kannan, Andrew McGregor, Sanjeev Khanna, Tuğkan Batu
Publication date: 3 August 2015
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Algorithms on strings (68W32) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (12)
On the word fragment length for unambiguous reconstruction of a periodic word from a complete multiset of fragments of fixed length ⋮ Tree trace reconstruction using subtraces ⋮ Lower bounds for trace reconstruction ⋮ Optimal mean-based algorithms for trace reconstruction ⋮ Unnamed Item ⋮ Global alignment of molecular sequences via ancestral state reconstruction ⋮ Subpolynomial trace reconstruction for random strings and arbitrary deletion probability ⋮ New lower bounds for trace reconstruction ⋮ Reconstructing trees from traces ⋮ String Reconstruction from Substring Compositions ⋮ The trace reconstruction problem for spider graphs ⋮ Information-Theoretic Foundations of DNA Data Storage
This page was built for publication:
