Pages that link to "Item:Q3449864"

The following pages link to Bounds on the Expected Size of the Maximum Agreement Subtree (Q3449864):

Displaying 11 items.

• Counting Markov equivalence classes for DAG models on trees (Q1752602) (← links)
• On the extremal maximum agreement subtree problem (Q2197478) (← links)
• Extremal distances for subtree transfer operations in binary trees (Q2421307) (← links)
• Bounds on the Expected Size of the Maximum Agreement Subtree for a Given Tree Shape (Q4972755) (← links)
• On the Largest Common Subtree of Random Leaf-Labeled Binary Trees (Q5028357) (← links)
• On the Maximum Agreement Subtree Conjecture for Balanced Trees (Q5028359) (← links)
• Exchangeable and sampling-consistent distributions on rooted binary trees (Q5067211) (← links)
• Inducibility in Binary Trees and Crossings in Random Tanglegrams (Q5348495) (← links)
• Expected Number of Induced Subtrees Shared by Two Independent Copies of a Random Tree (Q5883268) (← links)
• Maximum agreement subtrees and Hölder homeomorphisms between Brownian trees (Q6122622) (← links)
• An improved lower bound on the largest common subtree of random leaf-labeled binary trees (Q6622735) (← links)