Twenty similarity functions for two finite sequences

DOI10.1134/S0361768823050031zbMATH Open1543.68475MaRDI QIDQ6535140FDOQ6535140

Authors: I. B. Burdonov, A. Yu. Maksimov 

Publication date: 10 November 2023

Published in: Programming and Computer Software (Search for Journal in Brave)

Recommendations

• Measures of similarity among finite sequences
• Sequence similarity measures based on bounded Hamming distance
• scientific article; zbMATH DE number 5968858
• scientific article; zbMATH DE number 13327
• Frequency-based similarity for parameterized sequences: formal framework, algorithms, and applications

zbMATH Keywords

sequence analysiscanonical embeddingcommon subsequencessimilarity axiomsalgorithms for subsequence and embeddings combinatoricslongest and maximal common subsequencesmatching joint embeddings

Mathematics Subject Classification ID

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

Cites Work

• The String-to-String Correction Problem
• Algorithms for subsequence combinatorics
• Enumeration of maximal common subsequences between two strings

This page was built for publication: Twenty similarity functions for two finite sequences

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