Trees and Hierarchical Structures

Proceedings of a Conference held at Bielefeld, FRG, Oct. 5–9th, 1987

  • Andreas Dress
  • Arndt von Haeseler

Part of the Lecture Notes in Biomathematics book series (LNBM, volume 84)

Table of contents

  1. Front Matter
    Pages ii-v
  2. Andreas W. M. Dress, Arndt von Haeseler
    Pages 1-7
  3. Hervé Abdi
    Pages 43-59
  4. Patrick L. Williams, Walter M. Fitch
    Pages 60-74
  5. Ulrich Höhle
    Pages 117-124
  6. Back Matter
    Pages 139-141

About these proceedings


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.


Phylogenie algorithms biology cluster analysis evolution molecular biology tree

Editors and affiliations

  • Andreas Dress
    • 1
  • Arndt von Haeseler
    • 2
  1. 1.Fakultät für MathematikUniversität BielefeldBielefeldGermany
  2. 2.Department of Mathematics DRB 306University of Southern CaliforniaLos AngelesUSA

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag Berlin Heidelberg 1990
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-52453-3
  • Online ISBN 978-3-662-10619-8
  • Series Print ISSN 0341-633X
  • Buy this book on publisher's site