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

An efficient algorithm for some tree matching problems

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

DOI10.1016/0020-0190(91)90062-MzbMath0735.68041MaRDI QIDQ1182118

Fabrizio Luccio, Linda Pagli

Publication date: 27 June 1992

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


zbMATH Keywords

subtreeranked treestree isomorphism and matching


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05)


Related Items (1)

Tree pattern matching with a more general notion of occurrence of the pattern.



Cites Work

  • Unnamed Item
  • Data structures and algorithms for approximate string matching
  • On the subtree isomorphism problem for ordered trees
  • Lexicographic generation of ordered trees
  • Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
  • Fast Algorithms for Finding Nearest Common Ancestors
  • Pattern Matching in Trees




This page was built for publication: An efficient algorithm for some tree matching problems

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