Some Investigations on Similarity Measures Based on Absent Words

DOI10.3233/FI-2020-1874MaRDI QIDQ5114210zbMATH OpenFDO

Authors G. Castiglione, Sabrina Mantaci, Antonio Restivo

Publication date 21 June 2020

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/FI-2020-1874

zbMATH Keywords

minimal absent wordssequence comparisonsimilarity measures

Mathematics Subject Classification ID

Combinatorics on words (68R15) Algorithms on strings (68W32)

Recommendations

• scientific article; zbMATH DE number 1897932
• Alignment-free sequence comparison using absent words
• Some new approaches to constructing similarity measures

Cited in

(12)

• Measures of similarity among finite sequences
• Isometric words based on swap and mismatch distance
• scientific article; zbMATH DE number 7695992 (Why is no real title available?)
• Topologies for error-detecting variable-length codes
• Isometric words and edit distance: main notions and new variations
• Density of k-ary words with 0, 1, 2-error overlaps
• Partial cubes and Fibonacci dimension: insights and perspectives
• Characterization of isometric words based on swap and mismatch distance
• Isometric sets of words and generalizations of the Fibonacci cubes
• A family of partial cubes with minimal Fibonacci dimension
• Efficient computation of discriminative absent words for string collections
• Transformations between minimally f-free words

This page was built for publication: Some Investigations on Similarity Measures Based on Absent Words

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