PhD Qualifying Examination


"The suffix tree and its applications"

By Mr. Yiu-Cho Leung


Abstract:

The suffix tree is a data structure which is primarily used
to solve the exact string matching problem. The exact string
matching problem is very important and arises in many areas
including text editor, data mining, web searching and DNA
sequence or protein analysis. Apart from the exact string
matching problem, the suffix tree is well known for being
able to efficiently solve many different string problem. In
this survey, the suffix tree is studied thoroughly including
its construction and applications.


Date:     		Monday, 26 January 2004

Time:                   2:00p.m.-4:00p.m.

Venue:                  Room 2503
			lifts 25-26

Committee Members:      Prof. Mordecai Golin (Supervisor)
                        Prof. Derick Wood (Chairperson)
			Prof. Siu-Wing Cheng
			Prof. Qiong Luo


**** ALL are Welcome ****