• Publications
  • Influence
A canonical decomposition theory for metrics on a finite set
Abstract We consider specific additive decompositions d = d 1 + … + d n of metrics, defined on a finite set X (where a metric may give distance zero to pairs of distinct points). The simplestExpand
DIALIGN: finding local similarities by multiple sequence alignment
It is shown that DIALIGN is able correctly to align conserved motifs in protein sequences and is especially adequate if sequences are not globally related, but share only local similarities, as is the case in genomic DNA sequences and in many protein families. Expand
Multiple DNA and protein sequence alignment based on segment-to-segment comparison.
A new way to think about, and to construct, pairwise as well as multiple alignments of DNA and protein sequences is proposed, which considers alignments as consistent equivalence relations defined on the set of all positions occurring in all sequences under consideration. Expand
Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces
Abstract The concept of tight extensions of a metric space is introduced, the existence of an essentially unique maximal tight extension T x —the “tight span,” being an abstract analogon of theExpand
Split decomposition: a new and useful approach to phylogenetic analysis of distance data.
  • H. Bandelt, A. Dress
  • Biology, Medicine
  • Molecular phylogenetics and evolution
  • 1 September 1992
This work proposes to use a new technique called split decomposition, which accurately dissects the given dissimilarity measure as a sum of elementary "split" metrics plus a (small) residue. Expand
Positional Dependence, Cliques, and Predictive Motifs in the bHLH Protein Domain
Abstract. Quantitative analyses were carried out on a large number of proteins that contain the highly conserved basic helix–loop–helix domain. Measures derived from information theory were used toExpand
Reconstructing the shape of a tree from observed dissimilarity data
Branching structures, alias topological tree structures are fundamental to any hierarchical classification that aims to relate objects according to their similarities or dissimilarities. This paperExpand
Valuated matroids: a new look at the greedy algorithm
A variant of the greedy algorithm for weight functions defined on the system of m-subsets of a given set E is studied and those classes of weight functions for which this algorithm works are characterized. Expand
Analyzing proteome topology and function by automated multidimensional fluorescence microscopy
By analyzing many cell and tissue types, this approach reveals rules of hierarchical protein network organization, in which the frequency distribution of different protein clusters obeys Zipf's law, and state-specific lead proteins appear to control protein network topology and function. Expand