About the construction of the bisector of two strings

zbMATH Open1438.68299MaRDI QIDQ4627352FDOQ4627352

Authors: Ivan Budanaev 

Publication date: 7 March 2019

Recommendations

• scientific article; zbMATH DE number 7033807
• Hamming-like distances for ill-defined strings in linguistic classification
• About applications of distances on monoids of strings
• Generalized quasi-metric on strings
• A new distance metric on strings computable in linear time

zbMATH Keywords

Hamming distancequasimetricLevenshtein distancebisector of two stringsGraev distance

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cited In (4)

• The self-concatenation of isometric strings is isometric
• Hamming-like distances for ill-defined strings in linguistic classification
• Title not available (Why is that?)
• Efficiency and penalty factors on monoids of strings

This page was built for publication: About the construction of the bisector of two strings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4627352)