The following pages link to Combinatorial Pattern Matching (Q5315329):
Displaying 6 items.
- An \(O(n\log n)\)-time algorithm for the maximum constrained agreement subtree problem for binary trees (Q845850) (← links)
- On the agreement of many trees (Q1352115) (← links)
- From constrained to unconstrained maximum agreement subtree in linear time (Q2479535) (← links)
- Polynomial-time algorithms for the ordered maximum agreement subtree problem (Q2642315) (← links)
- An \(O(n\log n)\) algorithm for the maximum agreement subtree problem for binary trees (Q2706115) (← links)
- Enumeration of Maximum Common Subtree Isomorphisms with Polynomial-Delay (Q2942616) (← links)
