- ...Information
-
Research supported by the Air Force Wright Laboratory Aeronautical
Systems Center under ARPA Contract F33615-93-1-1339, by the Air Force
Rome Laboratories under ARPA Contract F30602-95-C-0119, and by
equipment grants from Digital and IBM Corporations.
- ...LCS
- We define the Longest Common Subsequence (LCS) in
Section 4.
- ...trees).
- Efficient parallel algorithms
for unit-cost editing are presented in [SZ90], which also
presents a uniprocessor variant that runs in time 7#7, where 8#8 and 9#9 are the tree sizes.
- ...value.
- We
have found this label-value model to be useful for semi-structured
data in general [PGMW95]. We have defaults for the label and
value of a node that does not specify them explicitly.
- ...M.
- If the roots
of 132#132 and 133#133 are not matched in M, then we add new dummy roots
that are matched.
Sudarshan S. Chawathe
Wed Jun 19 08:22:34 PDT 1996