Recovering a tree from the lengths of subtrees spanned by a randomly chosen sequence of leaves (Q2412994): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q91472497, #quickstatements; #temporary_batch_1711565664090
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1506.01091 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proper caterpillars are distinguished by their chromatic symmetric function / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on tree isomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectra of large random trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5557023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3975132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost all trees share a complete set of immanantal polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the metric properties of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5403949 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some uses of the Farris transform in mathematics and phylogenetics -- A review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-isomorphic caterpillars with identical subtree data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability and real trees. Ecole d'Eté de Probabilités de Saint-Flour XXXV -- 2005. Lecture given at the Saint-Flour probability summer school, July 6--23, 2005. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4361713 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3838224 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Greedoid Polynomial Which Distinguishes Rooted Arborescences / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Reconstruction of a Tree from its Maximal Subtrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039929 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A congruence theorem for trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3720617 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The reconstruction of a tree from its number deck / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of Harary's conjecture on the reconstruction of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstruction of Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On distinguishing trees by their chromatic symmetric functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4189313 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with equal chromatic symmetric functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstructing trees from subtree weights. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the tree realizability of a distance matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: The graph isomorphism disease / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Structure of Homometric Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5676231 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4792088 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic permutations and evolutionary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A symmetric function generalization of the chromatic polynomial of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Patterns and pattern-matching in trees: An analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Matrix Functions and the Graph Isomorphism Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3259049 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5530466 / rank
 
Normal rank

Latest revision as of 10:55, 15 July 2024

scientific article
Language Label Description Also known as
English
Recovering a tree from the lengths of subtrees spanned by a randomly chosen sequence of leaves
scientific article

    Statements

    Recovering a tree from the lengths of subtrees spanned by a randomly chosen sequence of leaves (English)
    0 references
    0 references
    0 references
    6 April 2018
    0 references
    tree reconstruction
    0 references
    graph isomorphism
    0 references
    phylogenetic diversity
    0 references
    random tree
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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