default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaiji Fukagawa
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[j12]Tatsuya Akutsu
, Takeyuki Tamura, Daiji Fukagawa, Atsuhiro Takasu:
Efficient exponential-time algorithms for edit distance between unordered trees. J. Discrete Algorithms 25: 79-93 (2014)- 2013
- [j11]Tatsuya Akutsu, Daiji Fukagawa, Magnús M. Halldórsson, Atsuhiro Takasu, Keisuke Tanaka:
Approximation and parameterized algorithms for common subtrees and edit distance between unordered trees. Theor. Comput. Sci. 470: 10-22 (2013) - 2012
- [j10]Tatsuya Akutsu, Daiji Fukagawa, Jesper Jansson, Kunihiko Sadakane:
Inferring a graph from path frequency. Discret. Appl. Math. 160(10-11): 1416-1428 (2012) - [j9]Tomoya Mori, Takeyuki Tamura, Daiji Fukagawa, Atsuhiro Takasu, Etsuji Tomita, Tatsuya Akutsu:
A Clique-Based Method Using Dynamic Programming for Computing Edit Distance Between Unordered Trees. J. Comput. Biol. 19(10): 1089-1104 (2012) - [c15]Tatsuya Akutsu, Takeyuki Tamura, Daiji Fukagawa, Atsuhiro Takasu:
Efficient Exponential Time Algorithms for Edit Distance between Unordered Trees. CPM 2012: 360-372 - 2011
- [j8]Daiji Fukagawa, Takeyuki Tamura, Atsuhiro Takasu, Etsuji Tomita, Tatsuya Akutsu:
A clique-based method for the edit distance between unordered trees and its application to analysis of glycan structures. BMC Bioinform. 12(S-1): S13 (2011) - [j7]Hisashi Kurasawa, Daiji Fukagawa, Atsuhiro Takasu, Jun Adachi:
Optimal Pivot Selection Method Based on the Partition and the Pruning Effect for Metric Space Indexes. IEICE Trans. Inf. Syst. 94-D(3): 504-514 (2011) - [j6]Tatsuya Akutsu, Daiji Fukagawa, Atsuhiro Takasu, Takeyuki Tamura:
Exact algorithms for computing the tree edit distance between unordered trees. Theor. Comput. Sci. 412(4-5): 352-364 (2011) - [c14]Tatsuya Akutsu, Tomoya Mori, Takeyuki Tamura, Daiji Fukagawa, Atsuhiro Takasu, Etsuji Tomita:
An Improved Clique-Based Method for Computing Edit Distance between Unordered Trees and Its Application to Comparison of Glycan Structures. CISIS 2011: 536-540 - 2010
- [j5]Tatsuya Akutsu, Daiji Fukagawa, Atsuhiro Takasu:
Approximating Tree Edit Distance through String Edit Distance. Algorithmica 57(2): 325-348 (2010) - [j4]Hisashi Kurasawa, Daiji Fukagawa, Atsuhiro Takasu, Jun Adachi:
Margin-Based Pivot Selection for Similarity Search Indexes. IEICE Trans. Inf. Syst. 93-D(6): 1422-1432 (2010) - [c13]Hisashi Kurasawa, Daiji Fukagawa, Atsuhiro Takasu, Jun Adachi:
Pivot Selection Method for Optimizing both Pruning and Balancing in Metric Space Indexes. DEXA (2) 2010: 141-148 - [c12]Atsuhiro Takasu, Daiji Fukagawa, Tatsuya Akutsu:
A Variational Bayesian EM Algorithm for Tree Similarity. ICPR 2010: 1056-1059 - [c11]Tomonari Masada, Daiji Fukagawa, Atsuhiro Takasu, Yuichiro Shibata, Kiyoshi Oguri:
Modeling Topical Trends over Continuous Time with Priors. ISNN (2) 2010: 302-311
2000 – 2009
- 2009
- [c10]Tomonari Masada, Daiji Fukagawa, Atsuhiro Takasu, Tsuyoshi Hamada, Yuichiro Shibata, Kiyoshi Oguri:
Dynamic hyperparameter optimization for bayesian topical trend analysis. CIKM 2009: 1831-1834 - [c9]Hisashi Kurasawa, Daiji Fukagawa, Atsuhiro Takasu, Jun Adachi:
Maximal metric margin partitioning for similarity search indexes. CIKM 2009: 1887-1890 - [c8]Atsuhiro Takasu, Daiji Fukagawa, Tatsuya Akutsu:
Latent Topic Extraction from Relational Table for Record Matching. Discovery Science 2009: 449-456 - [c7]Daiji Fukagawa, Tatsuya Akutsu, Atsuhiro Takasu:
Constant Factor Approximation of Edit Distance of Bounded Height Unordered Trees. SPIRE 2009: 7-17 - 2008
- [j3]Tatsuya Akutsu, Daiji Fukagawa, Atsuhiro Takasu:
Improved approximation of the largest common subtree of two unordered trees of bounded height. Inf. Process. Lett. 109(2): 165-170 (2008) - 2007
- [c6]Tatsuya Akutsu, Daiji Fukagawa:
Inferring a Chemical Structure from a Feature Vector Based on Frequency of Labeled Paths and Small Fragments. APBC 2007: 165-174 - [c5]Atsuhiro Takasu, Daiji Fukagawa, Tatsuya Akutsu:
Statistical Learning Algorithm for Tree Similarity. ICDM 2007: 667-672 - 2006
- [j2]Daiji Fukagawa, Tatsuya Akutsu:
Fast Algorithms for Comparison of Similar Unordered Trees. Int. J. Found. Comput. Sci. 17(3): 703-729 (2006) - [c4]Tatsuya Akutsu, Daiji Fukagawa, Atsuhiro Takasu:
Approximating Tree Edit Distance Through String Edit Distance. ISAAC 2006: 90-99 - 2005
- [j1]Daiji Fukagawa, Tatsuya Akutsu:
Performance analysis of a greedy algorithm for inferring Boolean functions. Inf. Process. Lett. 93(1): 7-12 (2005) - [c3]Tatsuya Akutsu, Daiji Fukagawa:
Inferring a Graph from Path Frequency. CPM 2005: 371-382 - 2004
- [c2]Daiji Fukagawa, Tatsuya Akutsu:
Fast Algorithms for Comparison of Similar Unordered Trees. ISAAC 2004: 452-463 - 2003
- [c1]Daiji Fukagawa, Tatsuya Akutsu:
Performance Analysis of a Greedy Algorithm for Inferring Boolean Functions. Discovery Science 2003: 114-127
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
