New dissimilarity measure for recognizing noisy subsequence trees

DOI10.1002/INT.20478MaRDI QIDQ2997938zbMATH OpenOpenAlexFDO

Authors Hisashi Koga, Hiroaki Saito, Toshinori Watanabe, Takanori Yokoyama

Publication date 10 May 2011

Published in International Journal of Intelligent Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/int.20478

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Pattern recognition, speech recognition (68T10) Protein sequences, DNA sequences (92D20) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Numerical similarity and dissimilarity measures between two trees
• A constrained edit distance algorithm between semi-ordered trees
• A constrained edit distance between unordered labeled trees
• Theoretical Computer Science
• Matching subsequences in trees

Cites work

• scientific article; zbMATH DE number 1305084 (Why is no real title available?)
• scientific article; zbMATH DE number 3303655 (Why is no real title available?)
• A graph distance metric based on the maximal common subgraph
• A survey on tree edit distance and related problems
• Combinatorial Pattern Matching
• Fast algorithms for the unit cost editing distance between trees
• On the editing distance between unordered labeled trees
• Ordered and Unordered Tree Inclusion
• Simple Fast Algorithms for the Editing Distance between Trees and Related Problems

This page was built for publication: New dissimilarity measure for recognizing noisy subsequence trees

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