Date and time: 11.30am-12.30pm, Friday 30th January, 2004
Venue: 12.13.03
Chair: Hugh Williams
Abstract:
In 2003 several linear-time suffix array construction and suffix array search algorithms were published. In this talk I will explain two of the algorithms, and describe our computational experience with their implementations. We indicate possibly fruitful directions for further research. This is joint work with Antonitio from Curtin and P.J. Ryan, Bill Smyth and Xiaoyang Yu from McMaster University, Canada.
About the speaker:
Andrew completed his PhD at Melbourne University in 1998 on the topic of fast algorithms for prefix coding. He has since co-authoured the book "Compression and Coding Algorithms" with Prof Alistair Moffat. After graduation, Andrew spent two years in Portland, Oregon, working with vision scientists on algorithmic problems related to diagnosing the eye disease Glaucoma. Andrew has spent the last three years as a lecturer at Curtin University of Technology in Perth, where he continues to pursue his research interests in algorithms for information management and computational applications related to ophthalmology research.
Seminars are free and open to the general public. No booking is necessary.
If you are interested in giving a presentation in this seminar series, or to make suggestions for speakers, please contact James Harland, the seminar co-ordinator.
James Harland Last modified: Fri Nov 28 14:31:58 EST 2003