Fast Algorithms for Computing Tree LCS

DOI10.1007/978-3-540-69068-9_22MaRDI QIDQ3506956zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Shay Mozes, Dekel Tsur, Oren Weimann, Michal Ziv-Ukelson

Publication date 17 June 2008

Published in Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-69068-9_22

Mathematics Subject Classification ID

Data structures (68P05) Nonnumerical algorithms (68W05)

Recommendations

• Fast algorithms for computing tree LCS
• FAST ALGORITHMS FOR COMPARISON OF SIMILAR UNORDERED TREES
• Algorithms and Computation
• scientific article; zbMATH DE number 1998340
• scientific article; zbMATH DE number 1786462

Cites work

• scientific article; zbMATH DE number 30301 (Why is no real title available?)
• scientific article; zbMATH DE number 1305084 (Why is no real title available?)
• scientific article; zbMATH DE number 910858 (Why is no real title available?)
• scientific article; zbMATH DE number 1445367 (Why is no real title available?)
• A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices
• A fast algorithm for computing longest common subsequences
• A faster algorithm computing string edit distances
• A linear space algorithm for computing maximal common subsequences
• A survey on tree edit distance and related problems
• Algorithms for the Longest Common Subsequence Problem
• An Optimal Decomposition Algorithm for Tree Edit Distance
• Chaining algorithms for multiple genome comparison
• Combinatorial Pattern Matching
• Fast Algorithms for Finding Nearest Common Ancestors
• Local Alignment of RNA Sequences with Arbitrary Scoring Schemes
• New algorithm for ordered tree-to-tree correction problem
• New algorithms for the LCS problem
• Preserving order in a forest in less than logarithmic time and linear space
• Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
• Simple and fast linear space computation of longest common subsequences
• Sparse dynamic programming I
• The String-to-String Correction Problem
• The Tree-to-Tree Correction Problem
• The longest common subsequence problem revisited

Cited in

(3)

• Fast algorithms for computing tree LCS
• A Faster CREW PRAM Algorithm for Computing Cartesian Trees
• LSH Forest: Practical Algorithms Made Theoretical

This page was built for publication: Fast Algorithms for Computing Tree LCS

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