Topology of strings: median string is NP-complete
Theoretical Computer Science
On the syllabic similarities of romance languages
CICLing'05 Proceedings of the 6th international conference on Computational Linguistics and Intelligent Text Processing
IEEE Transactions on Information Theory
A Multi-Criteria Decision Method Based on Rank Distance
Fundamenta Informaticae
A Generalization of the Assignment Problem, and its Application to the Rank Aggregation Problem
Fundamenta Informaticae
Spearman Permutation Distances and Shannon's Distinguishability
Fundamenta Informaticae
Local patch dissimilarity for images
ICONIP'12 Proceedings of the 19th international conference on Neural Information Processing - Volume Part I
Clustering based on rank distance with applications on DNA
ICONIP'12 Proceedings of the 19th international conference on Neural Information Processing - Volume Part V
Hi-index | 0.00 |
We exhibit a low-complexity but non-trivial distance between strings to be used in biology. The experimental results we provide were obtained on a standard laptop and, even if preliminary, are quite encouraging.