✦ LIBER ✦

The agreement metric for labeled binary trees

✍ Scribed by Wayne Goddard; Ewa Kubicka; Grzegorz Kubicki; F.R. McMorris

Book ID: 116029778
Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 755 KB
Volume: 123
Category: Article
ISSN: 0025-5564
DOI: 10.1016/0025-5564(94)90012-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computing the nearest neighbor interchan

Computing the nearest neighbor interchange metric for unlabeled binary trees is NP-complete

✍ Mirko Křivánek 📂 Article 📅 1986 🏛 Springer 🌐 English ⚖ 282 KB

An O ( n log n ) Algorithm for the Maxim

An O ( n log n ) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees

✍ Cole, Richard; Farach-Colton, Martin; Hariharan, Ramesh; Przytycka, Teresa; Thor 📂 Article 📅 2000 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 238 KB

The binary identification problem for we

The binary identification problem for weighted trees

✍ Cicalese, Ferdinando; Jacobs, Tobias; Laber, Eduardo; Valentim, Caio 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 323 KB

Binary search trees for generalized meas

Binary search trees for generalized measurements

✍ Andersson, Erika; Oi, Daniel K. L. 📂 Article 📅 2008 🏛 The American Physical Society 🌐 English ⚖ 136 KB

The -total labeling problem for trees

✍ Toru Hasunuma; Toshimasa Ishii; Hirotaka Ono; Yushi Uno 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 433 KB

Limiting theorems for the nodes in binar

Limiting theorems for the nodes in binary search trees

✍ Jie Liu; Su Chun; Chen Yu 📂 Article 📅 2008 🏛 SP Science China Press 🌐 English ⚖ 234 KB