Retrieval from hierarchical texts by partial patterns
SIGIR '93 Proceedings of the 16th annual international ACM SIGIR conference on Research and development in information retrieval
Integrating contents and structure in text retrieval
ACM SIGMOD Record
Algorithmics and applications of tree and graph searching
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Containment and equivalence for an XPath fragment
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Structural Properties of XPath Fragments
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Pattern Matching for Arc-Annotated Sequences
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
On Maximum Symmetric Subgraphs
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
Knowledge Discovery from Semistructured Texts
Progress in Discovery Science, Final Report of the Japanese Discovery Science Project
Finding Smallest Supertrees Under Minor Containment
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Efficiently mining frequent trees in a forest
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Stream processing of XPath queries with predicates
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Containment and equivalence for a fragment of XPath
Journal of the ACM (JACM)
Unordered Tree Mining with Applications to Phylogeny
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
On the computational complexity of 2-interval pattern matching problems
Theoretical Computer Science
Pure Multiple RNA Secondary Structure Alignments: A Progressive Profile Approach
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Semantic retrieval of multimedia data
Proceedings of the 2nd ACM international workshop on Multimedia databases
Efficiently Mining Frequent Trees in a Forest: Algorithms and Applications
IEEE Transactions on Knowledge and Data Engineering
A survey on tree edit distance and related problems
Theoretical Computer Science
Structural properties of XPath fragments
Theoretical Computer Science - Database theory
Pattern matching for arc-annotated sequences
ACM Transactions on Algorithms (TALG)
Tree inclusion algorithm, signatures and evaluation of path-oriented queries
Proceedings of the 2006 ACM symposium on Applied computing
Data mining in an engineering design environment: OR applications from graph matching
Computers and Operations Research
A new tree inclusion algorithm
Information Processing Letters
On the top-down tree inclusion
ACST'06 Proceedings of the 2nd IASTED international conference on Advances in computer science and technology
An algebraic view of the relation between largest common subtrees and smallest common supertrees
Theoretical Computer Science
Computational aspects of mining maximal frequent patterns
Theoretical Computer Science
Efficiently Mining Frequent Embedded Unordered Trees
Fundamenta Informaticae - Advances in Mining Graphs, Trees and Sequences
A General Framework for Mining Frequent Subgraphs from Labeled Graphs
Fundamenta Informaticae - Advances in Mining Graphs, Trees and Sequences
On Chen and Chen's new tree inclusion algorithm
Information Processing Letters
Approximate labelled subtree homeomorphism
Journal of Discrete Algorithms
Comprehensive isomorphic subtree enumeration
CASES '08 Proceedings of the 2008 international conference on Compilers, architectures and synthesis for embedded systems
Theoretical Computer Science
Matching subsequences in trees
Journal of Discrete Algorithms
Efficient rule based structural algorithms for classification of tree structured data
Intelligent Data Analysis
Bit-Parallel Tree Pattern Matching Algorithms for Unordered Labeled Trees
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Fast Arc-Annotated Subsequence Matching in Linear Space
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
A new tree inclusion algorithm
Information Processing Letters
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
On the complexity of higher-order matching in the linear λ-calculus
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
SPIRE'07 Proceedings of the 14th international conference on String processing and information retrieval
Finding common structured patterns in linear graphs
Theoretical Computer Science
Comparing trees via crossing minimization
Journal of Computer and System Sciences
Efficient algorithms for finding frequent substructures from semi-structured data streams
JSAI'03/JSAI04 Proceedings of the 2003 and 2004 international conference on New frontiers in artificial intelligence
Quantifying the Degree of Self-Nestedness of Trees: Application to the Structural Analysis of Plants
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Exact algorithms for computing the tree edit distance between unordered trees
Theoretical Computer Science
A metric normalization of tree edit distance
Frontiers of Computer Science in China
The tree inclusion problem: In linear space and faster
ACM Transactions on Algorithms (TALG)
Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Algorithms for finding a most similar subforest
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
The tree inclusion problem: in optimal space and faster
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Comparing trees via crossing minimization
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Matching subsequences in trees
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
An output-polynomial time algorithm for mining frequent closed attribute trees
ILP'05 Proceedings of the 15th international conference on Inductive Logic Programming
Higher-order matching in the linear lambda calculus in the absence of constants is NP-complete
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Detecting information leakage in updating XML documents of fine-grained access control
DEXA'06 Proceedings of the 17th international conference on Database and Expert Systems Applications
On the query evaluation in document DBs
DEXA'06 Proceedings of the 17th international conference on Database and Expert Systems Applications
A bit-parallel tree matching algorithm for patterns with horizontal VLDC's
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
Datalog relaunched: simulation unification and value invention
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism
Journal of Discrete Algorithms
Efficient exponential time algorithms for edit distance between unordered trees
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Efficiently Mining Frequent Embedded Unordered Trees
Fundamenta Informaticae - Advances in Mining Graphs, Trees and Sequences
A General Framework for Mining Frequent Subgraphs from Labeled Graphs
Fundamenta Informaticae - Advances in Mining Graphs, Trees and Sequences
Guided forest edit distance: better structure comparisons by using domain-knowledge
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Common structured patterns in linear graphs: approximation and combinatorics
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Weak inclusion for recursive XML types
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
Theoretical Computer Science
On the complexity of finding a largest common subtree of bounded degree
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
Efficient exponential-time algorithms for edit distance between unordered trees
Journal of Discrete Algorithms
| Hi-index | 0.01 |
The following tree-matching problem is considered: Given labeled trees $P$ and $T$, can $P$ be obtained from $T$ by deleting nodes? Deleting a node $u$ entails removing all edges incident to $u$ and, if $u$ has a parent $v$, replacing the edge from $v$ to $u$ by edges from $v$ to the children of $u$. The problem is motivated by the study of query languages for structured text databases. Simple solutions to this problem require exponential time. For ordered trees an algorithm is presented that requires $O(|P| |T|)$ time and space. The corresponding problem for unordered trees is also considered and a proof of its NP-completeness is given. An algorithm is presented for the unordered problem. This algorithm works in $O(|P| |T|)$ time if the out-degrees of the nodes in $P$ are bounded by a constant, and in polynomial time if they are $O(\log |T|)$.