Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

About applications of distances on monoids of strings

From MaRDI portal
Publication:1650369
Jump to:navigation, search

zbMath1390.68384MaRDI QIDQ1650369

Ivan Budanaev, Mitrofan M. Choban

Publication date: 3 July 2018

Published in: Computer Science Journal of Moldova (Search for Journal in Brave)

Full work available at URL: http://www.math.md/publications/csjm/issues/v24-n3/12256/


zbMATH Keywords

Hamming distancefree monoidquasimetricLevenshtein distanceparallel decompositioninvariant distanceproper similaritysemiparallel decompositionstring pattern matching


Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05) Protein sequences, DNA sequences (92D20) Algorithms on strings (68W32)


Related Items (1)

Unnamed Item







This page was built for publication: About applications of distances on monoids of strings

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1650369&oldid=13966004"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 04:27.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki