Searching for "On the tree inclusion problem." – sorted by Relevance.
-
The tree inclusion problem: In optimal space and faster
- The Tree Inclusion Problem: In Optimal Space and Faster Philip Bille ⋆ and Inge Li Gørtz
- Cited by 2 (2 self) – Add To MetaCart
-
Tree Matching Problems with Applications to Structured Text Databases
- pattern tree in a given target tree. We introduce ten interrelated matching problems called tree inclusion
- Cited by 61 (0 self) – Add To MetaCart
-
Approximate Tree Embedding for Querying XML Data
- of answering queries against XML document collections to the well-known unordered tree inclusion problem. We
- Cited by 21 (2 self) – Add To MetaCart
-
Approximate Tree Embedding for Querying
- of answering queries against XML document collections to the well-known unordered tree inclusion problem. We
- Add To MetaCart
-
Approximate Tree Embedding for Querying XML Data
- of answering queries against XML document collections to the well-known unordered tree inclusion problem. We
- Add To MetaCart
-
Pattern Matching for Arc-Annotated Sequences
- fixedparameter algorithm for LAPCS(nested,nested) and generalizes results for ordered tree inclusion problems
- Cited by 10 (2 self) – Add To MetaCart
-
Tree Edit Distance, Alignment Distance and Inclusion
- lead to the tree edit distance, alignment distance and inclusion problem. For each problem we review
- Cited by 19 (0 self) – Add To MetaCart
-
A survey on tree edit distance and related problems
- . These operations lead to the tree edit distance, alignment distance, and inclusion problem. For each problem we
- Cited by 28 (2 self) – Add To MetaCart
-
Complexity of pebble tree-walking automata
- , we give the precise complexities of the problems of emptiness and inclusion of tree-walking automata
- Cited by 2 (0 self) – Add To MetaCart
-
Pattern Matching in Trees and Strings
- edit distance problem, the tree alignment distance problem, and the tree inclusion problem. The survey
- Cited by 1 (0 self) – Add To MetaCart

