Theoretical Computer Science

DOI10.1007/11560586zbMath1171.68437OpenAlexW2603408665MaRDI QIDQ5395082

Tetsuhiro Miyahara, Hiroshi Yasuda, Tetsuji Kuboyama, Kil-Ho Shin

Publication date: 1 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11560586

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05)

Related Items (5)

A survey on tree matching and XML retrieval ⋮ A theory of subtree matching and tree kernels based on the edit distance concept ⋮ Algorithms for finding a most similar subforest ⋮ Alignment distance of regular tree languages ⋮ Alignment distance of regular tree languages

This page was built for publication: Theoretical Computer Science