2016/03/03 by Samer Assaf, Assaf, Samer
Biochemistry, Genetics and Molecular Biology · Computer Science · #54H25 #Algorithms and Data Compression #DNA and Biological Computing #FOS: Mathematics #General Topology (math.GN) #Primary 47H10 #Secondary 37C25
paper · pdf · doi:10.48550/arxiv.1603.01246
openalex publication_date 2016/03/03 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The distance on a set is a comparative function. The smaller the distance between two elements of that set, the closer, or more similar, those elements are. Fréchet axiomatized the distance into what is today known as a metric. In this thesis we study the generalization of Fréchet's axioms in various ways including a partial metric, strong partial metric, partial n-\mathfrakMetric and strong partial n-\mathfrakMetric. Those generalizations allow for negative distances, non-zero distances between a point and itself and even the comparison of n-tuples. We then present the scoring of a DNA sequence, a comparative function that is not a metric but can be modeled as a strong partial metric. Using the generalized metrics mentioned above we create topological spaces and investigate convergence, limits and continuity in them. As an application, we discuss contractiveness in the language of our generalized metrics and present Banach-like fixed, common fixed and coincidence point theorems.