Mumford dendrograms

Abstract

An effective $p$-adic encoding of dendrograms is presented through an explicit embedding into the Bruhat-Tits tree for a $p$-adic number field. This field depends on the number of children of a vertex and is a finite extension of the field of $p$-adic numbers. It is shown that fixing $p$-adic representatives of the residue field allows a natural way of encoding strings by identifying a given alphabet with such representatives. A simple $p$-adic hierarchic classification algorithm is derived for $p$-adic numbers, and is applied to strings over finite alphabets. Examples of DNA coding are presented and discussed. Finally, new geometric and combinatorial invariants of time series of $p$-adic dendrograms are developped.

16 pages, 7 figures; Incorporating Special Issue: Ultrametric and p-Adic Applications in Computer Science

References in corpus (4)

• A p-Adic Model of DNA Sequence and Genetic Code
• Genetic code on the dyadic plane
• Linear Fractional p-Adic and Adelic Dynamical Systems
• Degenerating families of dendrograms

Cited by in corpus (8)

• Symmetry in Data Mining and Analysis: A Unifying View based on Hierarchy
• Fast, Linear Time Hierarchical Clustering using the Baire Metric
• Degenerating families of dendrograms
• On $p$-adic Classification
• Versatile linkage: a family of space-conserving strategies for agglomerative hierarchical clustering
• Fast, Linear Time, m-Adic Hierarchical Clustering for Search and Retrieval using the Baire Metric, with linkages to Generalized Ultrametrics, Hashing, Formal Concept Analysis, and Precision of Data Measurement
• The Future of Search and Discovery in Big Data Analytics: Ultrametric Information Spaces
• Fast redshift clustering with the Baire (ultra) metric