This HTML5 document contains 4 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Subject Item

isa:347731424

rdf:type

prov:Entity

prov:value

Let H and T be two trees over the same leaf set, such that H is a non-binary tree and T is a binary tree that refines H. Given an internal node h in H, a cut on T via H and h, denoted CutH,h(T), is the minimal connected subtree of T that contains {MH???T(c):c???ChH(h)}, and we rename each leaf x by Le(Tx).We further extend this to a tuple of trees I = (T1,...,Tn) by CutH,h(I)???(CutH,h(T1),???,Cut

prov:wasQuotedFrom

n5:gov

Subject Item

isap:516219598

prov:wasDerivedFrom

isa:347731424