Improved Methods for Computing Distances Between Unordered Trees Using Integer Programming

Abstract

Kondo et al. (DS 2014) proposed methods for computing distances between unordered rooted trees by transforming an instance of the distance computing problem into an instance of the integer programming problem. They showed that the tree edit distance, segmental distance, and bottom-up segmental distance problem can be respectively transformed into an integer… (More)
DOI: 10.1007/978-3-319-71147-8_4

Topics

8 Figures and Tables

Cite this paper

@inproceedings{Hong2017ImprovedMF, title={Improved Methods for Computing Distances Between Unordered Trees Using Integer Programming}, author={Eunpyeong Hong and Yasuaki Kobayashi and Akihiro Yamamoto}, booktitle={COCOA}, year={2017} }