Automata, Languages and Programming
From MaRDI portal
Publication:5716823
DOI10.1007/11523468zbMath1085.68566OpenAlexW2940595899WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716823
Publication date: 10 January 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11523468
Analysis of algorithms and problem complexity (68Q25) Database theory (68P15) Data structures (68P05)
Related Items (6)
Generalized LCS ⋮ A survey on tree matching and XML retrieval ⋮ Fast arc-annotated subsequence matching in linear space ⋮ Faster Bit-Parallel Algorithms for Unordered Pseudo-tree Matching and Tree Homeomorphism ⋮ Weak Inclusion for XML Types ⋮ Matching subsequences in trees
This page was built for publication: Automata, Languages and Programming
