ScienceOpen:
research and publishing network
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
My ScienceOpen
Sign in
Register
Dashboard
Blog
About
Search
Advanced search
My ScienceOpen
Sign in
Register
Dashboard
Search
Search
Advanced search
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
Blog
About
14
views
0
references
Top references
cited by
1
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
816
similar
All similar
Record
: found
Abstract
: not found
Article
: not found
An algorithm for finding a representation of a subtree distance
Author(s):
Kazutoshi Ando
,
Koki Sato
Publication date:
2018
Journal:
J Comb Optim
Read this article at
ScienceOpen
Publisher
Bookmark
There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
Annual Reviews AI, Machine Learning, and Society
Author and article information
Journal
DOI::
10.1007/s10878-017-0145-x
ScienceOpen disciplines:
Data structures & Algorithms
,
Computer science
Data availability:
ScienceOpen disciplines:
Data structures & Algorithms
,
Computer science
Comments
Comment on this article
Sign in to comment
scite_
Similar content
816
Building uniformly random subtrees
Authors:
Peter Winkler
,
Malwina Luczak
EvoMiner: frequent subtree mining in phylogenetic databases
Authors:
David Fernández-Baca
,
Michelle M McMahon
,
Michael J Sanderson
…
XML Document Classification Using Closed Frequent Subtree
Authors:
Songlin Wang
,
Yihong Hong
,
Jianwu Yang
See all similar
Cited by
1
Optimal Algorithm to Reconstruct a Tree from a Subtree Distance
Authors:
Takanori Maehara
,
Kazutoshi Ando
See all cited by