Back

Preserving Hidden Hierarchical Structure: Poincare Distance for Enhanced Genomic Sequence Analysis

Ali, S.; Mansoor, H.; Chourasia, P.; Khan, I. U.; Patterson, M.

2024-10-13 genomics
10.1101/2024.10.11.617848 bioRxiv
Show abstract

The analysis of large volumes of molecular (genomic, proteomic, etc.) sequences has become a significant research field, especially after the recent coronavirus pandemic. Although it has proven beneficial to sequence analysis, machine learning (ML) is not without its difficulties, particularly when the feature space becomes highly dimensional. While most ML models operate with the conventional Euclidean distance, the hidden hierarchical structure present among a set of phylogenetically related sequences is difficult to represent in Euclidean space without losing much information or requiring many dimensions. Since such hierarchical structure can be informative to analysis tasks such as clustering and classification, we propose two measures for generating a distance matrix from a set of sequences based on distance in the Poincare disk model of hyperbolic geometry, or the Poincare distance, for short. Such a distance measure can allow to embedding of even a fully resolved phylogenetic tree in just two dimensions with minimal distortion to any hierarchical structure. Our first approach is based purely on the classical Poincare distance, while the other approach modifies this distance by combining the Euclidean norms and the dot product between the sequence representations. A thorough analysis of both measures demonstrates its superiority in a variety of genomic and proteomic sequence classification tasks in terms of efficiency, accuracy, predictive performance, and the capacity to capture significant sequence correlations. These approaches perform better than existing state-of-the-art methods across the majority of evaluation metrics.

Matching journals

The top 6 journals account for 50% of the predicted probability mass.

50% of probability mass above

"Similar papers" are the closest papers from that journal in the model's embedding space. They show what the match is built on, but the ranking comes mostly from a classifier over the whole training set, not from these examples alone.