Efficiency and Penalty Factors on Monoids of Strings
Închide
Conţinutul numărului revistei
Articolul precedent
Articolul urmator
65 4
Ultima descărcare din IBN:
2019-05-30 20:37
Căutarea după subiecte
similare conform CZU
519.71:004.89+004.424.4 (1)
Cibernetică matematică (60)
Inteligență artificială (81)
Programe. Software (100)
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
BibTeX
DataCite
Dublin Core
Computer Science Journal of Moldova
Numărul 2(77) / 2018 / ISSN 1561-4042

Efficiency and Penalty Factors on Monoids of Strings


CZU: 519.71:004.89+004.424.4
Pag. 99-114

Choban Mitrofan1, Budanaev Ivan12
 
1 Moldova Tiraspol State University,
2 Institute of Mathematics and Computer Science of the Academy of Sciences of Moldova
 
Disponibil în IBN: 12 septembrie 2018


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.