Search


Current filters:

Start a new search
Add filters:

Use filters to refine the search results.


Results 1-5 of 5 (Search time: 0.006 seconds).
  • previous
  • 1
  • next
Item hits:
BibliographyContents
On the complexity of finding a largest common subtree of bounded degree
  Akutsu, Tatsuya, Tamura, Takeyuki, Melkman, Avraham A., Takasu, Atsuhiro (2015-07-26)
  Theoretical Computer Science, 590: 2-16
file type icon 
Exact algorithms for computing the tree edit distance between unordered trees
  Akutsu, Tatsuya, Fukagawa, Daiji, Takasu, Atsuhiro, Tamura, Takeyuki (2011-02-04)
  Theoretical Computer Science, 412(4-5): 352-364
file type icon 
Approximating Tree Edit Distance through String Edit Distance
  Akutsu, Tatsuya, Fukagawa, Daiji, Takasu, Atsuhiro (2010-06)
  Algorithmica, 57(2): 325-348
file type icon 
Approximation and parameterized algorithms for common subtrees and edit distance between unordered trees
  Akutsu, Tatsuya, Fukagawa, Daiji, Halldórsson, Magnús M., Takasu, Atsuhiro, Tanaka, Keisuke (2013-01)
  Theoretical Computer Science, 470: 10-22
file type icon 
On the parameterized complexity of associative and commutative unification
  Akutsu, Tatsuya, Jansson, Jesper, Takasu, Atsuhiro, Tamura, Takeyuki (2017-01-17)
  Theoretical Computer Science, 660: 57-74
file type icon