Pages that link to "Item:Q1182118"

The following pages link to An efficient algorithm for some tree matching problems (Q1182118):

Displaying 25 items.

• A matching algorithm in PMWL based on CluTree (Q265007) (← links)
• Log-space algorithms for paths and matchings in \(k\)-trees (Q385514) (← links)
• Tree template matching in unranked ordered trees (Q396647) (← links)
• Matching subsequences in trees (Q1026243) (← links)
• On finding common subtrees (Q1208722) (← links)
• On improving matchings in trees, via bounded-length augmentations (Q1801054) (← links)
• Tree pattern matching with a more general notion of occurrence of the pattern. (Q1853013) (← links)
• Computing all subtree repeats in ordered trees (Q1941702) (← links)
• On modification of Boyer-Moore-Horspool's algorithm for tree pattern matching in linearised trees (Q2182712) (← links)
• Finding patterns and periods in Cartesian tree matching (Q2207506) (← links)
• Fast algorithms for single and multiple pattern Cartesian tree matching (Q2215968) (← links)
• Approximate matching for two families of trees (Q2508340) (← links)
• Inexact tree pattern matching with 1-degree edit distance using finite automata (Q2689648) (← links)
• Binary Jumbled Pattern Matching on Trees and Tree-Like Structures (Q2849342) (← links)
• TWO RELATED ALGORITHMS FOR ROOT-TO-FRONTIER TREE PATTERN MATCHING (Q3421842) (← links)
• (Q3789086) (← links)
• Perfect pairs of trees associated with a prescribed tree: An algorithmic approach (Q4036066) (← links)
• Approximate Tree Matching in the Presence of Variable Length Don′t Cares (Q4289840) (← links)
• Two Matching Based Algorithm for Tree Network Design (Q4297157) (← links)
• (Q4432975) (← links)
• (Q4500845) (← links)
• (Q4547753) (← links)
• A Sub-quadratic Time and Space Complexity Solution for the Dated Tree Reconciliation Problem for Select Tree Topologies (Q5283825) (← links)
• Combinatorial Pattern Matching (Q5713558) (← links)
• Finding approximate patterns in undirected acyclic graphs (Q5959618) (← links)