@Article{zhang96constrained,
  author      = {Zhang, Kaizhong},
  title       = {A constrained edit distance between unordered labeled trees},
  journal     = {Algorithmica},
  year        = {1996},
  volume      = {15},
  pages       = {205--222},
  issn        = {0178-4617},
  abstract    = {This paper considers the problem of computing a constrained edit distance between unordered labeled trees. The problem of approximate unordered tree matching is also considered. We present dynamic programming algorithms solving these problems in sequential timeO(|T1| |T2| (deg(T1)+deg(T2)) log2(deg(T1)+deg(T2))). Our previous result shows that computing the edit distance between unordered labeled trees is NP-complete.},
  affiliation = {Department of Computer Science University of Western Ontario N6A 5B7 London Ontario Canada},
  doi         = {10.1007/BF01975866},
  number      = {3},
  keyword     = {Computer Science},
  keywords    = {tree edit distance; tree alignments},
  owner       = {Sebastian},
  publisher   = {Springer New York},
  timestamp   = {2011.01.29},
}

{"_id":"2umpjNQcFKsCRXDi9","bibbaseid":"zhang-aconstrainededitdistancebetweenunorderedlabeledtrees-1996","author_short":["Zhang, K."],"bibdata":{"bibtype":"article","type":"article","author":[{"propositions":[],"lastnames":["Zhang"],"firstnames":["Kaizhong"],"suffixes":[]}],"title":"A constrained edit distance between unordered labeled trees","journal":"Algorithmica","year":"1996","volume":"15","pages":"205–222","issn":"0178-4617","abstract":"This paper considers the problem of computing a constrained edit distance between unordered labeled trees. The problem of approximate unordered tree matching is also considered. We present dynamic programming algorithms solving these problems in sequential timeO(|T1| |T2| (deg(T1)+deg(T2)) log2(deg(T1)+deg(T2))). Our previous result shows that computing the edit distance between unordered labeled trees is NP-complete.","affiliation":"Department of Computer Science University of Western Ontario N6A 5B7 London Ontario Canada","doi":"10.1007/BF01975866","number":"3","keyword":["tree edit distance; tree alignments"],"keywords":"tree edit distance; tree alignments","owner":"Sebastian","publisher":"Springer New York","timestamp":"2011.01.29","bibtex":"@Article{zhang96constrained,\n author = {Zhang, Kaizhong},\n title = {A constrained edit distance between unordered labeled trees},\n journal = {Algorithmica},\n year = {1996},\n volume = {15},\n pages = {205--222},\n issn = {0178-4617},\n abstract = {This paper considers the problem of computing a constrained edit distance between unordered labeled trees. The problem of approximate unordered tree matching is also considered. We present dynamic programming algorithms solving these problems in sequential timeO(|T1| |T2| (deg(T1)+deg(T2)) log2(deg(T1)+deg(T2))). Our previous result shows that computing the edit distance between unordered labeled trees is NP-complete.},\n affiliation = {Department of Computer Science University of Western Ontario N6A 5B7 London Ontario Canada},\n doi = {10.1007/BF01975866},\n number = {3},\n keyword = {Computer Science},\n keywords = {tree edit distance; tree alignments},\n owner = {Sebastian},\n publisher = {Springer New York},\n timestamp = {2011.01.29},\n}\n\n","author_short":["Zhang, K."],"key":"zhang96constrained","id":"zhang96constrained","bibbaseid":"zhang-aconstrainededitdistancebetweenunorderedlabeledtrees-1996","role":"author","urls":{},"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"https://git.bio.informatik.uni-jena.de/fleisch/literature/raw/master/group-literature.bib","dataSources":["C5FtkvWWggFfMJTFX"],"keywords":["tree edit distance; tree alignments"],"search_terms":["constrained","edit","distance","between","unordered","labeled","trees","zhang"],"title":"A constrained edit distance between unordered labeled trees","year":1996}