Name
Abstract | ||
|---|---|---|
A rooted labeled caterpillar is a rooted labeled tree transformed to a path after removing all the leaves in it. In this paper, we design the algorithm to compute the edit distance between rooted labeled caterpillars in O(lambda(2)h(2)) time, where lambda and h are the maximum number of leaves and the maximum height in two caterpillars, respectively. |
Year | Venue | Field |
|---|---|---|
2018 | Federated Conference on Computer Science and Information Systems | Edit distance,Data mining,Histogram,Combinatorics,Computer science,Lambda |
DocType | ISSN | Citations |
Conference | 2325-0348 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kohei Muraka | 1 | 0 | 0.34 |
| Takuya Yoshino | 2 | 4 | 4.54 |
| Kouichi Hirata | 3 | 130 | 32.04 |