Reconstructing trees from traces (Q2075329): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5823651 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global alignment of molecular sequences via ancestral state reconstruction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501353 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on tree edit distance and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Littlewood-type problems on subarcs of the unit circle / rank
 
Normal rank
Property / cites work
 
Property / cites work: New lower bounds for trace reconstruction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coded Trace Reconstruction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal mean-based algorithms for trace reconstruction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal mean-based algorithms for trace reconstruction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstruction from subsequences. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4680828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trace reconstruction with varying deletion probabilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for trace reconstruction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subpolynomial trace reconstruction for random strings and arbitrary deletion probability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579482 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A congruence theorem for trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a reconstruction problem for sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trace Reconstruction: Generalized and Parameterized / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topics in Graph Automorphisms and Reconstruction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient reconstruction of sequences from their subsequences of supersequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trace Reconstruction Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of results for deletion channels and related synchronization channels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trace reconstruction with exp(O(n <sup>1/3</sup> )) samples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3259049 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579483 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Fast Algorithms for the Editing Distance between Trees and Related Problems / rank
 
Normal rank

Latest revision as of 00:57, 28 July 2024

scientific article
Language Label Description Also known as
English
Reconstructing trees from traces
scientific article

    Statements

    Reconstructing trees from traces (English)
    0 references
    0 references
    0 references
    0 references
    14 February 2022
    0 references
    deletion channel
    0 references
    Littlewood polynomials
    0 references
    trace reconstruction
    0 references
    tree trace reconstruction
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references