Abstract
Efficient pattern matching algorithms for traces and their dependence graphs are proposed. Pattern matching problems related to problems of recognizing frequent patterns in structured data and counting the number of trace object windows that include a pattern are considered.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
