The following pages link to Daiji Fukagawa (Q427878):
Displaying 12 items.
- Inferring a graph from path frequency (Q427879) (← links)
- Exact algorithms for computing the tree edit distance between unordered trees (Q620949) (← links)
- Performance analysis of a greedy algorithm for inferring Boolean functions (Q834975) (← links)
- Improved approximation of the largest common subtree of two unordered trees of bounded height (Q975557) (← links)
- Approximation and parameterized algorithms for common subtrees and edit distance between unordered trees (Q1935809) (← links)
- Approximating tree edit distance through string edit distance (Q2379923) (← links)
- Efficient exponential-time algorithms for edit distance between unordered trees (Q2442818) (← links)
- Efficient Exponential Time Algorithms for Edit Distance between Unordered Trees (Q2904510) (← links)
- Approximating Tree Edit Distance Through String Edit Distance (Q5459105) (← links)
- FAST ALGORITHMS FOR COMPARISON OF SIMILAR UNORDERED TREES (Q5483380) (← links)
- Algorithms and Computation (Q5712135) (← links)
- Combinatorial Pattern Matching (Q5713561) (← links)
