The similarity of two strings of fuzzy sets.

MaRDI QIDQ5389673zbMATH OpenFDO

Authors Gabriela Andrejková

Publication date 23 April 2012

Full work available at URL https://eudml.org/doc/33510, http://www.kybernetika.cz/content/2000/6/671

zbMATH Keywords

fuzzy setpolynomial-time algorithms

Mathematics Subject Classification ID

Theory of fuzzy sets, etc. (03E72) Algorithms on strings (68W32)

Recommendations

• The set closest common subsequence problem
• Approximate string matching by fuzzy automata
• On obtaining intuitionistic fuzzy estimates for similarity of strings
• scientific article; zbMATH DE number 1794217
• Similarity measures for fuzzy sets

Cites work

• A longest common subsequence algorithm suitable for similar text strings
• Algorithms for the Longest Common Subsequence Problem
• Archimedean components of triangular norms
• Fuzzy sets as a basis for a theory of possibility
• scientific article; zbMATH DE number 420884 (Why is no real title available?)
• scientific article; zbMATH DE number 3518800 (Why is no real title available?)
• Shortest string containing all permutations
• The set closest common subsequence problem
• The set LCS problem
• The set-set LCS problem

This page was built for publication: The similarity of two strings of fuzzy sets.

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