An Algorithm to Calculate the p-Value of the Monge-Elkan Distance
The Monge-Elkan distance is a straightforward yet popular distance measure used to estimate the mutual similarity of two sets of objects. It was initially proposed in the field of databases, and it found broad usage in other fields. Nowadays, it is especially relevant to the analysis of new-generati...
Saved in:
Published in | Journal of computational biology Vol. 32; no. 8; pp. 797 - 812 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
United States
Mary Ann Liebert, Inc., publishers
01.08.2025
|
Subjects | |
Online Access | Get full text |
ISSN | 1557-8666 1557-8666 |
DOI | 10.1089/cmb.2024.0854 |
Cover
Loading…
Summary: | The Monge-Elkan distance is a straightforward yet popular distance measure used to estimate the mutual similarity of two sets of objects. It was initially proposed in the field of databases, and it found broad usage in other fields. Nowadays, it is especially relevant to the analysis of new-generation sequencing data as it represents a measure of dissimilarity between genomes of two distinct organisms, particularly when applied to unassembled reads. This article provides an algorithm to calculate the
p
-value associated with the Monge-Elkan distance. Given the object-level null distribution, that is, the distribution of distances between independently and identically sampled objects such as reads, the method yields the null distribution of the Monge-Elkan distance, which in turn allows for calculating the
p
-value. We also demonstrate an application on sequencing data, where individual reads are compared by the Levenshtein distance. |
---|---|
Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
ISSN: | 1557-8666 1557-8666 |
DOI: | 10.1089/cmb.2024.0854 |