AdvOL Student Seminars and Defences
Michael Liut, March 28, 2019, 15:30-16:30, ITB 201
Speaker:   Michael Liut
Department of Computing and Software
McMaster University

Title:  Computing Lyndon Array
AdvOL Optimization Seminars
Manaf Zargoush, October 7, 2019, 16:30-17:30, ITB 201
Speaker:   Manaf Zargoush
DeGroote School of Business
McMaster University

Title:   Hypertension management: a value of information perspective
Fields Institute Industrial Optimization Seminar, November 15th, 2019
Speakers:   Marco Cuturi (Google Brain)
Robert McCann (University of Toronto)

The Industrial Optimization Seminar is held at the Fields Institute. See the seminar series website for further information.
Thursday, 09 July 2020
Main Menu
Internal pages
Latest Theses
File Icon Stochastic Programming Formulations and Structural Properties for Assemble-to-Order Systems
File Icon Computing Lyndon Arrays
File Icon Novel Stochastic Programming Formulations for Assemble-to-Order Systems
Latest Reports
Visitors by region
Totals Top 20
 59 % Unknown
 15 % Commercial
 9 % networks
 5 % Canada
 3 % Germany
 2 % Russia
 2 % China
 < 1.0 % Brazil
 < 1.0 % 
 < 1.0 % Educational
 < 1.0 % Poland
 < 1.0 % Ukraine
 < 1.0 % United Kingdom
 < 1.0 % Italy
 < 1.0 % France
 < 1.0 % India
 < 1.0 % Netherlands
 < 1.0 % Japan
 < 1.0 % Organization
 < 1.0 % Australia

Visitors: 7038167
Jan Janousek, September 13, 2019, 16:30-17:30, ITB 201
Speaker:   Jan Janousek
Department of Theoretical Computer Science
Czech Technical University in Prague

Title:   Pattern matching in trees inspired by pattern matching in strings

Abstract: Trees are one of the most ubiquitous data structures in Computer Science. In particular, pattern matching in trees is an important tool in compiler optimization. Since many standard linear notations of subtrees are substrings of the linear notations for trees, many principles for pattern matching algorithms on strings can be used to design effective algorithms for pattern matching in trees. Though the principles may be the same, the information on the structure of the tree must be processed differently. We present an overview of using some basic principles known from pattern matching in strings, which is a well-researched algorithmic discipline, in pattern matching algorithms for trees, a much younger and smaller discipline. Many pattern matching problems for strings were successfully solved by the use of finite automata as a useful model of computation. For pattern matching in trees, it is possible to construct analogously pushdown automata reading the linear notations of the tree, or, as we call it, finite tree automata. Using the principles from pattern matching in strings to pattern matching in trees is not limited to the use of automata: as an example, we present a new algorithm of backward tree pattern matching inspired by the standard Boyer-Moore-Horspool's backward pattern-matching algorithm for strings.
< Prev   Next >
McMaster University
McMaster University
Faculty of Engineering
Faculty of Engineering
Faculty of Science
Faculty of Science
Computing & Software
Computing & Software
Comput. Eng. & Sci.

School Website >>>

Latest Publications
Publication Downloads
Error cannot find GD extension