Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Tree inclusions in windows and slices

From MaRDI portal
Publication:843598
Jump to:navigation, search

DOI10.1007/s10958-009-9401-7zbMath1178.68175OpenAlexW1966409909MaRDI QIDQ843598

Irène Guessarian, Patrick Cégielski

Publication date: 15 January 2010

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-009-9401-7



Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Data structures (68P05)




Cites Work

  • Unnamed Item
  • A survey on tree edit distance and related problems
  • Window Subsequence Problems for Compressed Texts
  • Tree inclusion problems
  • Pattern Matching in Trees
  • Ordered and Unordered Tree Inclusion
  • First-order queries on structures of bounded degree are computable with constant delay
  • Window-accumulated subsequence matching problem is linear
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:843598&oldid=12781770"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 15:14.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki