Presentation | 1994/11/18 A Metric between Unrooted and Unordered Trees and Its Computing Method Eiichi Tanaka, |
---|---|
PDF Download Page | PDF download Page Link |
Abstract(in Japanese) | (See Japanese page) |
Abstract(in English) | This paper proposes a distance between unrooted and unordered trees based on the strongly structure preserving mapping(SSPM). SSPM can make correspondences between the vertices of similar substructures of given structures more strictly than the already proposed mappings.The time complexity of computing the distance between trees Ta and Tb is Ο_T(m^3_bNaNb),where Na(Nb)and m_a(m_b) are the number of vertices in tree Ta(Tb)and the maximum degree of a vertex in Ta(Tb),respectively,and m_a【less than or equal】m_b is assumed.The space compleidty of the method is Ο_s(NaNb). |
Keyword(in Japanese) | (See Japanese page) |
Keyword(in English) | Distance / Dynamic Programming / Pattern matching / Pattern recognition / Similar structure search / Tree |
Paper # | COMP94-56 |
Date of Issue |
Conference Information | |
Committee | COMP |
---|---|
Conference Date | 1994/11/18(1days) |
Place (in Japanese) | (See Japanese page) |
Place (in English) | |
Topics (in Japanese) | (See Japanese page) |
Topics (in English) | |
Chair | |
Vice Chair | |
Secretary | |
Assistant |
Paper Information | |
Registration To | Theoretical Foundations of Computing (COMP) |
---|---|
Language | ENG |
Title (in Japanese) | (See Japanese page) |
Sub Title (in Japanese) | (See Japanese page) |
Title (in English) | A Metric between Unrooted and Unordered Trees and Its Computing Method |
Sub Title (in English) | |
Keyword(1) | Distance |
Keyword(2) | Dynamic Programming |
Keyword(3) | Pattern matching |
Keyword(4) | Pattern recognition |
Keyword(5) | Similar structure search |
Keyword(6) | Tree |
1st Author's Name | Eiichi Tanaka |
1st Author's Affiliation | Faculty of Engineering,Kobe University() |
Date | 1994/11/18 |
Paper # | COMP94-56 |
Volume (vol) | vol.94 |
Number (no) | 354 |
Page | pp.pp.- |
#Pages | 10 |
Date of Issue |