On the Complexity of Extracting Subtree with Keeping Distinguishability (Q2958316): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-319-48749-6_17
+Normal rank
@@ Property / OpenAlex ID @@
+W2545329740
@@ Property / OpenAlex ID: W2545329740 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4413449
@@ Property / cites work: Q4413449 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient extraction of schemas for XML documents.
+Normal rank
@@ Property / cites work @@
+Information Extraction
@@ Property / cites work: Information Extraction / rank @@
+Normal rank
@@ Property / cites work @@
+Learning \((k,l)\)-contextual tree languages for information extraction from web pages
+Normal rank
@@ Property / cites work @@
+Ordered term tree languages which are polynomial time inductively inferable from positive data
+Normal rank
@@ Property / cites work @@
+Tree pattern query minimization
@@ Property / cites work: Tree pattern query minimization / rank @@
+Normal rank
@@ Property / cites work @@
+Containment and equivalence for a fragment of XPath
+Normal rank
@@ Property / cites work @@
+Q4298260
@@ Property / cites work: Q4298260 / rank @@
+Normal rank