An optimal algorithm for computing all subtree repeats in trees

DOI10.1007/978-3-642-45278-9_23MaRDI QIDQ2870033zbMATH OpenOpenAlexFDO

Authors Tomáš Flouri, Kassian Kobert, Solon P. Pissis, Alexandros Stamatakis

Publication date 17 January 2014

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

Full work available at URL http://europepmc.org/articles/pmc3996578

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• An optimal algorithm for computing all subtree repeats in trees
• Computing all subtree repeats in ordered trees
• Approximate labelled subtree homeomorphism
• Bottom-up subtree isomorphism for unordered labeled trees
• Combinatorial Pattern Matching

Cited in

(10)

• Trees with the mos subtrees - an algorithmic approach
• Revisiting dynamic programming for finding optimal subtrees in trees
• An Analysis of a Good Algorithm for the Subtree Problem, Corrected
• Efficient counting of square substrings in a tree
• An optimal algorithm for computing all subtree repeats in trees
• Find subtrees of specified weight and cycles of specified length in linear time
• A Sub-quadratic Time and Space Complexity Solution for the Dated Tree Reconciliation Problem for Select Tree Topologies
• Subsumption algorithms based on search trees
• Computing all subtree repeats in ordered trees
• A linear time and space algorithm for finding isomorphic subtrees of a binary tree

This page was built for publication: An optimal algorithm for computing all subtree repeats in trees

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