✦ LIBER ✦

Reconstruction of rooted trees from subtrees

✍ Scribed by Meei Pyng Ng; Nicholas C. Wormald

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 888 KB
Volume: 69
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(95)00074-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Reconstructing trees from subtree weight

Reconstructing trees from subtree weights

✍ L Pachter; D Speyer 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 482 KB

The tree-metric theorem provides a necessary and sufficient condition for a dissimilarity matrix to be a tree metric, and has served as the foundation for numerous distance-based reconstruction methods in phylogenetics. Our main result is an extension of the tree-metric theorem to more general dissi

Reconstructing trees from two point dele

Reconstructing trees from two point deleted subtrees

✍ William B. Giles 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 984 KB

On Reconstructing Rooted Trees

✍ T. Andreae 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 667 KB

A probably very difficult question of Nash-Williams asks whether any two hypomorphic trees are isomorphic. In the present paper, we consider rooted trees rather than trees and give an affirmative answer to the corresponding version of Nash-Williams' question, i.e., we show that any two hypomorphic r

The decomposition of trees into subtrees

✍ Yair Caro 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 332 KB

## Abstract A necessary condition for the decomposition of a tree __T__ into subtrees, each isomorphic to a tree from a given set of trees is presented. We also present a characterization of the set of trees for which the condition is sufficient. Many examples are given.

A note on subtrees rooted along the prim

A note on subtrees rooted along the primary path of a binary tree

✍ Brent M. Troutman; Michael R. Karlinger 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 348 KB

Parallel Shortcutting of Rooted Trees

✍ Mikkel Thorup 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 305 KB

First it is shown that for any rooted tree T with n vertices, and parameter m G n, there is a ''shortcutting'' set S of at most m arcs from the transitive closure Ž . T\* of T such for any ¨, w g T \*, there is a dipath in T j S from ¨to w of length Ž Ž .. Ž O ␣ m, n . An equivalent result has been