๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A simple parallel algorithm for computing the diameters of all vertices in a tree and its application

โœ Scribed by Zhi-Zhong Chen

Book ID
107766013
Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
499 KB
Volume
42
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

pNJTree: A parallel program for reconstr
pNJTree: A parallel program for reconstruction of neighbor-joining tree and its application in ClustalW
โœ Zhihua Du; Feng Lin ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 347 KB

Neighbor-joining (NJ) is a distance-based method for tree construction. It is the most widely used method with polynomial time complexity at present. However, a fundamental problem with the previous implementations of this method is its limitation to handle large taxa sets within a reasonable time a

A fast algorithm for the computation of
A fast algorithm for the computation of axial moments and its application to the orthogonal fitting of curves
โœ Roman M. Palenichka; Marek B. Zaremba ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 343 KB

This paper describes a fast algorithm to compute local axial moments used in the detection of objects of interest in images. The basic idea is the elimination of redundant operations while computing axial moments for two neighboring angles of orientation. The main result is that the complexity of th