The Neighbor-Joining algorithm is a recursive procedure for reconstructing trees that is based on a transformation of pairwise distances between leaves. We present a generalization of the neighborjoining transformation, which uses estimates of phylogenetic diversity rather than pairwise distances in the tree. This leads to an improved neighbor-joining algorithm whose total running time is still...

We study the convergence rates of neighbor joining and several new phylogenetic reconstruction methods on families of trees of bounded diameter. Our study presents theoretically obtained convergence rates, as well as an empirical study based upon simulation of evolution on random birth-death trees. We find that the new phylogenetic methods offer an advantage over the neighbor joining method, ex...

Based on the concept of "Robot Oriented Design" which was presented at the 5th international symposium on robotics in construction In June 1988, this paper proposes a design analysis for the "ROD" robot-oriented-design synthesis of structural elements. The structural elements are beam and column including their joining system. A systematic method for analysing the design of a structural joining...

This research investigates how women’s groups facilitate people’s participation in the open source community by examining the joining activities in KDE Women. Leveraging literatures on group membership roles and socialization, and adopting a qualitative research method, a joining script of different kinds of participants was identified. It is found that members developed organizational and lead...

A new method called the neighbor-joining method is proposed for reconstructing phylogenetic trees from evolutionary distance data. The principle of this method is to find pairs of operational taxonomic units (OTUs [= neighbors]) that minimize the total branch length at each stage of clustering of OTUs starting with a starlike tree. The branch lengths as well as the topology of a parsimonious tr...