Folgen
Daiji Fukagawa
Daiji Fukagawa
Assistant Professor, Doshisha University
Bestätigte E-Mail-Adresse bei mail.doshisha.ac.jp
Titel
Zitiert von
Zitiert von
Jahr
Inferring a graph from path frequency
T Akutsu, D Fukagawa
Combinatorial Pattern Matching: 16th Annual Symposium, CPM 2005, Jeju Island …, 2005
65*2005
Approximation and parameterized algorithms for common subtrees and edit distance between unordered trees
T Akutsu, D Fukagawa, MM Halldórsson, A Takasu, K Tanaka
Theoretical Computer Science 470, 10-22, 2013
392013
Approximating tree edit distance through string edit distance
T Akutsu, D Fukagawa, A Takasu
Algorithmica 57, 325-348, 2010
372010
A clique-based method for the edit distance between unordered trees and its application to analysis of glycan structures
D Fukagawa, T Tamura, A Takasu, E Tomita, T Akutsu
BMC bioinformatics 12, 1-9, 2011
352011
Exact algorithms for computing the tree edit distance between unordered trees
T Akutsu, D Fukagawa, A Takasu, T Tamura
Theoretical Computer Science 412 (4-5), 352-364, 2011
302011
A clique-based method using dynamic programming for computing edit distance between unordered trees
T Mori, T Tamura, D Fukagawa, A Takasu, E Tomita, T Akutsu
Journal of computational biology 19 (10), 1089-1104, 2012
282012
Inferring a chemical structure from a feature vector based on frequency of labeled paths and small fragments
T Akutsu, D Fukagawa
Proceedings Of The 5th Asia-Pacific Bioinformatics Conference, 165-174, 2007
182007
Dynamic hyperparameter optimization for bayesian topical trend analysis
T Masada, D Fukagawa, A Takasu, T Hamada, Y Shibata, K Oguri
Proceedings of the 18th ACM Conference on Information and knowledge …, 2009
162009
Approximating tree edit distance through string edit distance
T Akutsu, D Fukagawa, A Takasu
Algorithms and Computation: 17th International Symposium, ISAAC 2006 …, 2006
152006
Performance analysis of a greedy algorithm for inferring Boolean functions
D Fukagawa, T Akutsu
Information Processing Letters 93 (1), 7-12, 2005
152005
Improved approximation of the largest common subtree of two unordered trees of bounded height
T Akutsu, D Fukagawa, A Takasu
Information Processing Letters 109 (2), 165-170, 2008
132008
Statistical learning algorithm for tree similarity
A Takasu, D Fukagawa, T Akutsu
Seventh IEEE International Conference on Data Mining (ICDM 2007), 667-672, 2007
122007
Efficient exponential-time algorithms for edit distance between unordered trees
T Akutsu, T Tamura, D Fukagawa, A Takasu
Journal of Discrete Algorithms 25, 79-93, 2014
92014
Efficient exponential time algorithms for edit distance between unordered trees
T Akutsu, T Tamura, D Fukagawa, A Takasu
Annual Symposium on Combinatorial Pattern Matching, 360-372, 2012
92012
Modeling topical trends over continuous time with priors
T Masada, D Fukagawa, A Takasu, Y Shibata, K Oguri
Advances in Neural Networks-ISNN 2010: 7th International Symposium on Neural …, 2010
82010
Constant factor approximation of edit distance of bounded height unordered trees
D Fukagawa, T Akutsu, A Takasu
String Processing and Information Retrieval: 16th International Symposium …, 2009
82009
Fast algorithms for comparison of similar unordered trees
D Fukagawa, T Akutsu
Algorithms and Computation: 15th International Symposium, ISAAC 2004, Hong …, 2005
82005
An improved clique-based method for computing edit distance between unordered trees and its application to comparison of glycan structures
T Akutsu, T Mori, T Tamura, D Fukagawa, A Takasu, E Tomita
2011 International Conference on Complex, Intelligent, and Software …, 2011
72011
Optimal pivot selection method based on the partition and the pruning effect for metric space indexes
H Kurasawa, D Fukagawa, A Takasu, J Adachi
IEICE transactions on information and systems 94 (3), 504-514, 2011
42011
Pivot selection method for optimizing both pruning and balancing in metric space indexes
H Kurasawa, D Fukagawa, A Takasu, J Adachi
Database and Expert Systems Applications: 21th International Conference …, 2010
42010
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20