A Low-complexity Distance for DNA Strings

Authors:
Liviu P. Dinu;Andrea Sgarro
Affiliations:
University of Bucharest, Faculty of Mathematics and Computer Science, Academiei 14, 010014, Bucharest, Romania. E-mail: ldinu@funinf.cs.unibuc.ro;University of Trieste + CBM, Area Science Park, 34100 Trieste, Italy. E-mail: sgarro@units.it
Venue:
Fundamenta Informaticae
Year:
2006

Citing 4
Cited 6

Topology of strings: median string is NP-complete

Theoretical Computer Science
Pattern recognition techniques for the emerging field of bioinformatics: A review

Pattern Recognition
On the syllabic similarities of romance languages

CICLing'05 Proceedings of the 6th international conference on Computational Linguistics and Intelligent Text Processing
The similarity metric

IEEE Transactions on Information Theory

Parikh matrices and amiable words

Theoretical Computer Science
A Generalization of the Assignment Problem, and its Application to the Rank Aggregation Problem

Fundamenta Informaticae
A Multi-Criteria Decision Method Based on Rank Distance

Fundamenta Informaticae
Total rank distance and scaled total rank distance: two alternative metrics in computational linguistics

LD '06 Proceedings of the Workshop on Linguistic Distances
Meta-search: aggregating search engine results using rank-distance

Proceedings of the Fourth International Conference on SImilarity Search and APplications
On the closest string via rank distance

CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.