Frequency-based similarity for parameterized sequences: formal framework, algorithms, and applications

DOI10.1016/j.ins.2013.03.016zbMath1320.68135DBLPjournals/isci/GrecoT13OpenAlexW2072780137WikidataQ57782836 ScholiaQ57782836MaRDI QIDQ497185

Giorgio Terracina, Gianluigi Greco

Publication date: 23 September 2015

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2013.03.016

zbMATH Keywords

sequence similarityalignment problemmining technique

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Algorithms on strings (68W32)

Related Items (1)

A brief history of parameterized matching problems

Uses Software

• MODELLER

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parameterized matching with mismatches
• On the longest common parameterized subsequence
• Subsumption and implication
• Parameterized pattern matching: Algorithms and applications
• Faster suffix tree construction with missing suffix links
• Approximate parameterized matching
• Algorithms on Strings, Trees and Sequences
• Applications and Theory of Petri Nets 2005

This page was built for publication: Frequency-based similarity for parameterized sequences: formal framework, algorithms, and applications