Reconstructing trees from traces
From MaRDI portal
Publication:2075329
DOI10.1214/21-AAP1662MaRDI QIDQ2075329
Sami Davies, Miklós Z. Rácz, Cyrus Rashtchian
Publication date: 14 February 2022
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1902.05101
Analysis of algorithms and problem complexity (68Q25) Combinatorics on words (68R15) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Source coding (94A29) Algorithms on strings (68W32)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A survey on tree edit distance and related problems
- Global alignment of molecular sequences via ancestral state reconstruction
- A congruence theorem for trees
- A survey of results for deletion channels and related synchronization channels
- On a reconstruction problem for sequences
- Reconstruction from subsequences.
- Optimal mean-based algorithms for trace reconstruction
- Subpolynomial trace reconstruction for random strings and arbitrary deletion probability
- New lower bounds for trace reconstruction
- Lower bounds for trace reconstruction
- Topics in Graph Automorphisms and Reconstruction
- Trace Reconstruction Revisited
- Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
- Littlewood-type problems on subarcs of the unit circle
- Trace reconstruction with exp(O(n 1/3 )) samples
- Optimal mean-based algorithms for trace reconstruction
- Trace Reconstruction: Generalized and Parameterized
- Coded Trace Reconstruction
- Trace reconstruction with varying deletion probabilities
- Efficient reconstruction of sequences from their subsequences of supersequences
This page was built for publication: Reconstructing trees from traces
