scientific article; zbMATH DE number 1786462

MaRDI QIDQ4547753zbMATH OpenFDO

Authors Jesper Jansson, Andrzej Lingas

Publication date 21 August 2002

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2089/20890232

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 1998340
• A More Efficient Approximation Scheme for Tree Alignment
• Improved Approximation Algorithms for Tree Alignment
• FAST ALGORITHMS FOR COMPARISON OF SIMILAR UNORDERED TREES
• Algorithms and Computation
• Approximation algorithms for tree alignment with a given phylogeny
• scientific article; zbMATH DE number 1615276
• An efficient algorithm for some tree matching problems
• Exact and approximate algorithms for unordered tree matching

Cited in

(13)

• Forest Alignment with Affine Gaps and Anchors
• Fast Algorithms for Computing Tree LCS
• Ordered tree alignment with genetic programming
• Homeomorphic Alignment of Edge-Weighted Trees
• A survey on tree matching and XML retrieval
• scientific article; zbMATH DE number 1998340 (Why is no real title available?)
• FAST ALGORITHMS FOR COMPARISON OF SIMILAR UNORDERED TREES
• A survey on tree edit distance and related problems
• Algorithms and Computation
• Alignment of trees -- an alternative to tree edit
• Fast algorithms for computing tree LCS
• Comparing similar ordered trees in linear-time
• Homeomorphic alignment of weighted trees

This page was built for publication:

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