New dissimilarity measure for recognizing noisy subsequence trees
From MaRDI portal
Publication:2997938
DOI10.1002/int.20478zbMath1211.68289OpenAlexW2065491606MaRDI QIDQ2997938
Hisashi Koga, Takanori Yokoyama, Hiroaki Saito, Toshinori Watanabe
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
Graph theory (including graph drawing) in computer science (68R10) Pattern recognition, speech recognition (68T10) Protein sequences, DNA sequences (92D20) Information storage and retrieval of data (68P20)
Cites Work
- Unnamed Item
- Unnamed Item
- A survey on tree edit distance and related problems
- On the editing distance between unordered labeled trees
- Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
- A graph distance metric based on the maximal common subgraph
- Ordered and Unordered Tree Inclusion
- Combinatorial Pattern Matching
- Fast algorithms for the unit cost editing distance between trees