✦ LIBER ✦

A VLSI algorithm for calculating the tree to tree distance

✍ Scribed by Meirui Xu; Xiaolin Liu

Book ID: 112948624
Publisher: Springer
Year: 1993
Tongue: English
Weight: 593 KB
Volume: 8
Category: Article
ISSN: 1000-9000
DOI: 10.1007/bf02946587

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A fast algorithm for constructing trees

A fast algorithm for constructing trees from distance matrices

✍ Joseph C. Culberson; Piotr Rudnicki 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 833 KB

A Tree Matching Algorithm and VLSI Archi

A Tree Matching Algorithm and VLSI Architecture for Real-Time 2D Object Classification

✍ M. Schaffer; T. Chen 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 77 KB

## A Tree Matching Algorithm and VLSI Architecture for Real-Time 2D Object Classification his paper presents a real-time classification algorithm for two-dimensional (2D) object contours using a tree model which is implemented in a modular very large scale integration (VLSI) Tar chitecture. The ha

Balanced vertices in trees and a simpler

Balanced vertices in trees and a simpler algorithm to compute the genomic distance

✍ Péter L. Erdős; Lajos Soukup; Jens Stoye 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 218 KB

This paper provides a short and transparent solution for the covering cost of white-grey trees which play a crucial role in the algorithm of Bergeron et al. to compute the rearrangement distance between two multichromosomal genomes in linear time (A. Bergeron, J. Mixtacki, J. Stoye, A new linear tim

A fast algorithm for the minimum spannin

A fast algorithm for the minimum spanning tree

✍ Francis Suraweera 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 408 KB

A combinatorial description of the close

A combinatorial description of the closest tree algorithm for finding evolutionary trees

✍ Michael D. Hendy 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 382 KB

The closest tree algorith¢a for estimating the evolutionary history of n species, from a set of homologous DNA or RNA sequences is designed to avoid the problem of inconsistency inherent in current methods. The algorithm, as previously described, required O(n~2 n) steps, making it impractical for va

A linear-time algorithm for connectedr-d

A linear-time algorithm for connectedr-domination and Steiner tree on distance-hereditary graphs

✍ Brandst�dt, Andreas; Dragan, Feodor F. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 83 KB 👁 1 views

A distance-hereditary graph is a connected graph in which every induced path is isometric, i.e., the distance of any two vertices in an induced path equals their distance in the graph. We present a linear time labeling algorithm for the minimum cardinality connected r-dominating set and Steiner tree