Shaoming LIU

Distance between Rooted and Unordered Trees Based on Vertex and Edge Mappings
Shaoming LIU 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2004/05/01
Vol. E87-A  No. 5  pp. 1034-1041
Type of Manuscript:  Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
tree, graph, structure, pattern, distance, similarity, mapping, algorithm, pattern matching, 
 Summary | Full Text:PDF(275.5KB)
The Largest Common Similar Substructure Problem
Shaoming LIU Eiichi TANAKA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1997/04/25
Vol. E80-A  No. 4  pp. 643-650
Type of Manuscript:  Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
algorithm, complexity, common similar substructure, distance, similarity, tree, 
 Summary | Full Text:PDF(694KB)
Efficient Algorithms for Finding Largest Similar Substructures in Unordered Trees
Shaoming LIU Eiichi TANAKA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1996/04/25
Vol. E79-A  No. 4  pp. 428-440
Type of Manuscript:  Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
algorithm, complexity, distance, similar structure, tree, 
 Summary | Full Text:PDF(893.8KB)
The Distances between Unrooted and Cyclically Ordered Trees and Their Computing Methods
Shaoming LIU Eiichi TANAKA Sumio MASUDA 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 1994/10/25
Vol. E77-D  No. 10  pp. 1094-1105
Type of Manuscript:  PAPER
Category: Algorithm and Computational Complexity
Keyword: 
tree, graph, distance, similarity, algorithm, pattern matching, 
 Summary | Full Text:PDF(871.4KB)