( en | de | ru )

 

Disambiguation of "Fukagawa, Daiji"

Author of the publication

copydeleteadd this publication to your clipboard
Fast Algorithms for Comparison of Similar Unordered Trees.

, and . Int. J. Found. Comput. Sci., 17 (3): 703-729 (2006)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Fukagawa, Daiji
add a person with the name Fukagawa, Daiji
 

Other publications of authors with the same name

Optimal Pivot Selection Method Based on the Partition and the Pruning Effect for Metric Space Indexes., , , and . IEICE Trans. Inf. Syst., 94-D (3): 504-514 (2011)An Improved Clique-Based Method for Computing Edit Distance between Unordered Trees and Its Application to Comparison of Glycan Structures., , , , , and . CISIS, page 536-540. IEEE Computer Society, (2011)Inferring a Graph from Path Frequency., and . CPM, volume 3537 of Lecture Notes in Computer Science, page 371-382. Springer, (2005)Latent Topic Extraction from Relational Table for Record Matching., , and . Discovery Science, volume 5808 of Lecture Notes in Computer Science, page 449-456. Springer, (2009)Modeling Topical Trends over Continuous Time with Priors., , , , and . ISNN (2), volume 6064 of Lecture Notes in Computer Science, page 302-311. Springer, (2010)Performance analysis of a greedy algorithm for inferring Boolean functions., and . Inf. Process. Lett., 93 (1): 7-12 (2005)Performance Analysis of a Greedy Algorithm for Inferring Boolean Functions., and . Discovery Science, volume 2843 of Lecture Notes in Computer Science, page 114-127. Springer, (2003)Constant Factor Approximation of Edit Distance of Bounded Height Unordered Trees., , and . SPIRE, volume 5721 of Lecture Notes in Computer Science, page 7-17. Springer, (2009)Improved approximation of the largest common subtree of two unordered trees of bounded height., , and . Inf. Process. Lett., 109 (2): 165-170 (2008)Approximating Tree Edit Distance through String Edit Distance., , and . Algorithmica, 57 (2): 325-348 (2010)