We prove partition theorems on trees and generalize to a setting of trees the theorems of Erdiis and Rado on A-systems and the theorems of Fodor and Hajnal on free sets. Let p be an infinite cardinal and TP be the tree of finite sequences of ordinals <p, with the partial ordering of being an initial segment. a Cb denotes that a is an initial segment of fi. A subtree of TP is a nonempty subset o...

This paper presents a new method for computing the tree edit distance problem with uniform edit cost. We commence by showing that any tree obtained with a sequence of cut operations is a subtree of the transitive closure of the original tree, we show that the necessary condition for any subtree to be a solution can be reduced to a clique problem in a derived structure. Using this idea we transf...

XQuery is generic, widely adopted language for querying and manipulating XML data. Many of currently available native XML databases are using XQuery as its primary query language. The XQuery specification requires each XML node to belong to exactly one XML tree. In case of the XML subtree is appended into a new XML structure, the whole subtree has to be copied. This may lead into excessive and ...

This paper presents a newmethod to balance binary search trees, which has the following properties. (i) The only information stored for the balance is the size of every subtree. (ii) Inserting or deleting an element can be done in themost traditional way: first, the element is recursively inserted (deleted) in (from) the appropriate subtree; afterwards, a single or double rotation takes place i...

We use Dirichlet form methods to construct and analyze a reversible Markov process, the stationary distribution of which is the Brownian continuum random tree. This process is inspired by the subtree prune and re-graft (SPR)Markov chains that appear in phylogenetic analysis. A key technical ingredient in this work is the use of a novel Gromov– Hausdorff type distance to metrize the space whose ...

Status of this Memo This document specifies an Internet standards track protocol for the Internet community, and requests discussion and suggestions for improvements. Please refer to the current edition of the "Internet Official Protocol Standards" (STD 1) for the standardization state and status of this protocol. Distribution of this memo is unlimited. Abstract In X.500 directories, subentries...

We describe a program for the display and exploration of complex, domain-specific information: ytracc, an interactive grammar debugging tool for compiler writers. The ytracc system provides the designer of a yacc grammar a method of tracing a parser as it uses the grammar. ytracc captures the states of the parse as it is carried out. The captured parse can then be replayed forwards or backwards...

Let % be the collection of nonempty subtrees of a given tree T. Each subtree is viewed as a potential facility. Let f be a real objective function defined on 9. The facility location model we consider is to select a subtree minimizing 1: This model unifies and generalizes several facility location problems discussed in the literature. We prove that the most common objective functions used in fa...