| Articolul precedent |
| Articolul urmator |
 |
 649 0 |
 SM ISO690:2012CHOBAN, Mitrofan, BUDANAEV, Ivan. Measures of Similarity on Monoids of Strings. In: Conference on Mathematical Foundations of Informatics, Ed. 2017, 9-11 noiembrie 2017, Chișinău. Chișinău, Republica Moldova: "VALINEX" SRL, 2017, pp. 51-58. ISBN 978‐9975‐4237‐6‐2. |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
| Conference on Mathematical Foundations of Informatics 2017 | ||||||
|
Conferința "Conference on Mathematical Foundations of Informatics" 2017, Chișinău, Moldova, 9-11 noiembrie 2017 | ||||||
|
||||||
| Pag. 51-58 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
In information theory, linguistics and computer science are important distinct string metrics for measuring the difference between two given strings (sequences). In this article we introduce the efficiency, measure of similarity and penalty for given parallel decompositions of two strings. The relations between these characteristics are established. |
||||||
| Cuvinte-cheie invariant distance, measure of similarity, penalty, Hamming distance, Levenshtein distance |
||||||
|
|
|
|
