Trees and hierarchical structures : proceedings of a conference held at Bielefeld, FRG, Oct. 5-9th, 1987
著者
書誌事項
Trees and hierarchical structures : proceedings of a conference held at Bielefeld, FRG, Oct. 5-9th, 1987
（Lecture notes in biomathematics, 84）
Springer-Verlag, c1990
- : gw
- : us
大学図書館所蔵 全31件
注記
"The Conference Trees and Hierarchical Structures"--P. 3
Includes bibliographies
内容説明・目次
内容説明
The "raison d'etre" of hierarchical dustering theory stems from one basic phe nomenon: This is the notorious non-transitivity of similarity relations. In spite of the fact that very often two objects may be quite similar to a third without being that similar to each other, one still wants to dassify objects according to their similarity. This should be achieved by grouping them into a hierarchy of non-overlapping dusters such that any two objects in ~ne duster appear to be more related to each other than they are to objects outside this duster. In everyday life, as well as in essentially every field of scientific investigation, there is an urge to reduce complexity by recognizing and establishing reasonable das sification schemes. Unfortunately, this is counterbalanced by the experience of seemingly unavoidable deadlocks caused by the existence of sequences of objects, each comparatively similar to the next, but the last rather different from the first.
目次
1. Introduction.- 2. Reconstruction of Phylogenies by Distance Data: Mathematical Framework and Statistical Analysis.- 3. Additive-Tree Representations.- 4. Finding the Minimal Change in a Given Tree.- 5. Search, Parallelism, Comparison, and Evaluation: Algorithms for Evolutionary Trees.- 6. The Phylogeny of Prochloron: Is there Numerical Evidence from SAB Values? A Response to van Valen.- 7. Evolution of the Collagen Fibril by Duplication and Diversification of a Small Primordial Exon Unit.- 8. The Poincare Paradox and The Cluster Problem.- 9. An incremental Error Correcting Evaluation Algorithm for Recursion Networks without Circuits.
「Nielsen BookData」 より