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 pattern matching with a more general notion of occurrence of the pattern.

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

DOI10.1016/S0020-0190(01)00270-8zbMath1051.68138MaRDI QIDQ1853013

Cedric Chauve

Publication date: 21 January 2003

Published in: Information Processing Letters (Search for Journal in Brave)


zbMATH Keywords

Design of algorithmsTree pattern matching


Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Pattern recognition, speech recognition (68T10)


Related Items (1)

Bit-Parallel Tree Pattern Matching Algorithms for Unordered Labeled Trees



Cites Work

  • An efficient algorithm for some tree matching problems
  • Approximate matching for two families of trees
  • Pattern Matching in Trees
  • Efficient string matching
  • Faster tree pattern matching
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item


This page was built for publication: Tree pattern matching with a more general notion of occurrence of the pattern.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1853013&oldid=14236802"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 11:09.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki