Pages that link to "Item:Q2955638"
From MaRDI portal
The following pages link to An optimal algorithm for computing all subtree repeats in trees (Q2955638):
Displaying 9 items.
- A linear time and space algorithm for finding isomorphic subtrees of a binary tree (Q802874) (← links)
- Revisiting dynamic programming for finding optimal subtrees in trees (Q856203) (← links)
- Trees with the mos subtrees - an algorithmic approach (Q1937356) (← links)
- Computing all subtree repeats in ordered trees (Q1941702) (← links)
- Efficient counting of square substrings in a tree (Q2250458) (← links)
- An Analysis of a Good Algorithm for the Subtree Problem, Corrected (Q3833624) (← links)
- A Sub-quadratic Time and Space Complexity Solution for the Dated Tree Reconciliation Problem for Select Tree Topologies (Q5283825) (← links)
- Subsumption algorithms based on search trees (Q5878906) (← links)
- Find subtrees of specified weight and cycles of specified length in linear time (Q6056757) (← links)