Matching subsequences in trees

DOI10.1016/j.jda.2008.11.005zbMath1187.68337DBLPjournals/jda/BilleG09OpenAlexW2088147314WikidataQ60554459 ScholiaQ60554459MaRDI QIDQ1026243

Philip Bille, Inge Li Gørtz

Publication date: 24 June 2009

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2008.11.005

zbMATH Keywords

subsequencestree matchingXML queries

Mathematics Subject Classification ID

Database theory (68P15) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05)

Uses Software

• XPath

Cites Work

• Unnamed Item
• A linear-time algorithm for a special case of disjoint set union
• Multi-subsequence searching
• Searching subsequences
• Deterministic Dictionaries
• Fast Algorithms for Finding Nearest Common Ancestors
• Ordered and Unordered Tree Inclusion
• Automata, Languages and Programming

This page was built for publication: Matching subsequences in trees