Quasi-metrics, Similarities and Searches: aspects of geometry of protein datasets
Aleksandar Stojmirovic

TL;DR
This thesis explores the geometry of protein datasets using quasi-metrics, establishing a link between biological sequence similarity and asymmetric distance functions, and develops indexing methods for efficient similarity searches.
Contribution
It introduces a new theoretical framework connecting quasi-metrics with biological sequence similarity and develops practical indexing schemes for protein dataset searches.
Findings
High-dimensional quasi-metric spaces are nearly metric spaces
Novel bounds on indexing scheme performance are established
FSIndex significantly accelerates protein similarity searches
Abstract
A quasi-metric is a distance function which satisfies the triangle inequality but is not symmetric: it can be thought of as an asymmetric metric. The central result of this thesis, developed in Chapter 3, is that a natural correspondence exists between similarity measures between biological (nucleotide or protein) sequences and quasi-metrics. Chapter 2 presents basic concepts of the theory of quasi-metric spaces and introduces a new examples of them: the universal countable rational quasi-metric space and its bicompletion, the universal bicomplete separable quasi-metric space. Chapter 4 is dedicated to development of a notion of the quasi-metric space with Borel probability measure, or pq-space. The main result of this chapter indicates that `a high dimensional quasi-metric space is close to being a metric space'. Chapter 5 investigates the geometric aspects of the theory of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · Genome Rearrangement Algorithms · Machine Learning in Bioinformatics
