Conţinutul numărului revistei |
Articolul precedent |
Articolul urmator |
840 6 |
Ultima descărcare din IBN: 2023-05-02 14:33 |
Căutarea după subiecte similare conform CZU |
519.71:004.89+004.424.4 (1) |
Cibernetică matematică (93) |
Inteligență artificială (295) |
Programe. Software (293) |
SM ISO690:2012 CHOBAN, Mitrofan, BUDANAEV, Ivan. Efficiency and Penalty Factors on Monoids of Strings. In: Computer Science Journal of Moldova, 2018, nr. 2(77), pp. 99-114. ISSN 1561-4042. |
EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
Computer Science Journal of Moldova | |||||
Numărul 2(77) / 2018 / ISSN 1561-4042 /ISSNe 2587-4330 | |||||
|
|||||
CZU: 519.71:004.89+004.424.4 | |||||
Pag. 99-114 | |||||
|
|||||
Descarcă PDF | |||||
Rezumat | |||||
In information theory, linguistics and computer science, metrics for measuring similarity between two given strings (sequences) are important. In this article we introduce efficiency, measure of similarity and penalty for given parallel decompositions of two strings. Relations between these characteristics are established. In this way, we continue the research from [3], [4]. |
|||||
Cuvinte-cheie invariant distance, measure of similarity, Leven- shtein distance, Hamming distance, Graev method, penalty. |
|||||
|