The following pages link to (Q5472871):
Displaying 15 items.
- Using trees to mine multirelational databases (Q408677) (← links)
- Efficient mining for structurally diverse subgraph patterns in large molecular databases (Q413872) (← links)
- Tree inclusions in windows and slices (Q843598) (← links)
- Efficient frequent connected subgraph mining in graphs of bounded tree-width (Q982649) (← links)
- Probabilistic frequent subtrees for efficient graph classification and retrieval (Q1631835) (← links)
- Mining rooted ordered trees under subtree homeomorphism (Q1741278) (← links)
- Ordered subtree mining via transactional mapping using a structure-preserving tree database schema (Q1749612) (← links)
- Learning grammars for architecture-specific facade parsing (Q1800054) (← links)
- Mining frequent closed rooted trees (Q1959538) (← links)
- A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics (Q2248525) (← links)
- Genetic programming for anticancer therapeutic response prediction using the NCI-60 dataset (Q2379647) (← links)
- Probabilistic and exact frequent subtree mining in graphs beyond forests (Q2425250) (← links)
- Inclusion problems in trace monoids (Q2452752) (← links)
- Frequent Submap Discovery (Q3011873) (← links)
- Tree inclusion problems (Q3514631) (← links)
