On the Complexity of Extracting Subtree with Keeping Distinguishability

DOI10.1007/978-3-319-48749-6_17zbMath1407.68113OpenAlexW2545329740MaRDI QIDQ2958316

Zhipeng Cai, Xianmin Liu, Dongjing Miao, Jian-Zhong Li

Publication date: 1 February 2017

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-48749-6_17

zbMATH Keywords

computational complexitydistinguishabilitysubtree extraction

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• Ordered term tree languages which are polynomial time inductively inferable from positive data
• Learning \((k,l)\)-contextual tree languages for information extraction from web pages
• Tree pattern query minimization
• Efficient extraction of schemas for XML documents.
• Information Extraction
• Containment and equivalence for a fragment of XPath

This page was built for publication: On the Complexity of Extracting Subtree with Keeping Distinguishability