of the Course Material.
As specified in the table below, since 1988 30 students have received the
M.Sc. degree at McMaster under my supervision.
Of these, 24 have graduated from the research M.Sc. programme in
Computer Science established in 1997, including five cosupervised by
Professor Franya Franek,
four others by
Professor Pat Ryan,
and one by
G. Brian Golding
and Lucian Ilie.
All 24 worked in the area of string algorithms,
and the thesis work of all but four has led to research papers
published in refereed international journals or refereed conference proceedings.
In December 2007 my first Ph.D. student,
graduated from Curtin University of Technology
a month later, in January 2008, my second Ph.D student,
Mohammad Sohel Rahman
graduated from King's College London.
In 2009 two more Ph.D. students,
and Munina Yusufu, graduated from the Computer Science programme at McMaster.
They were followed in 2017 by A.S.M. Sohidull (Sohan) Islam.
Currently at McMaster I supervise Post-Doctoral Fellow
For the year July 2002 - July 2003 Professor Franek and I also
supervised post-doctoral fellow
from the Czech Technical University in Prague.
Dr. Holub's tenure was funded by a NATO fellowship.
All current students at McMaster are members of the
Algorithms Research Group.
Here is the complete list of graduate students who so far have graduated under my supervision, including current employment for some of them (* indicates Ph.D.):
2015 Sohan Islam* Repeats in Strings & Application in Bioinformatics
2015 Sarah Banyassady Approximate Repetitions with Spaced Seeds
2015 Raazia Shafqat Comparing Clustering Packages USEARCH & DNACLUST
2014 Widmer Bland Completing the New Periodicity Lemma Software Developer
2012 Hamid Mohamadi BOND: Basic OligoNucleotide Design Ph.D. student (UBC)
2012 Robert Fuller Performance Comparison of Runs Algorithms Ph.D. student (McMaster)
2010 Evguenia Kopylova Repetitions in Strings: Current Algorithms Clarity Genomics, JLINX, Belgium
& the Combinatorics of Future Ones
2009 Shu Wang* Indeterminate Strings Decentral, Chief Security Officer
2009 Munina Yusufu* Efficient Computation of String Regularities Associate Professor (China)
2009 Anisa Al-Hafeedh Using Suffix Arrays for LZ Compression Ph.D. student (Illinois State)
2008 Sohel Rahman* Fast & Efficient Algorithms on Strings Professor & Head of School (BUET, Bangladesh)
2007 Simon Puglisi* Strings, Suffix Arrays & Periodicity Academy of Finland Fellow (University of Helsinki)
2007 Gang Chen Lempel-Ziv Factorization employed in industry
2006 Shu Wang Pattern-Matching on Indeterminate Strings Ph.D. student (McMaster)
2004 Kangmin Fan Investigating Run-Maximal Strings employed in industry
2004 Xiaoyang Yu New Suffix Array Algorithms employed in industry
2002 Xiangdong Xiao Computing Quasi Suffix Arrays IBM
2002 Chris Jennings Linear-Time Fast Exact Pattern Matching self-employed (Ottawa)
2001 Xin Chen 2D Matching for Image Similarity Retrieval employed in California
2001 Jiandong Jiang Frequency of Occurrence, Two-Pattern Strings Microsoft (Seattle)
2001 Chi-Wei Wu Algorithms for Polygon Similarity
2001 Yudong Tang Repeating Substrings in O(n) Space employed in China
2001 Shudi Gao New Properties of Borders & Covers of Strings IBM Toronto
2000 Weilin Lu Repetitions in Two-Pattern Strings IBM
2000 Lu Yang Computing a k-Cover of a String IBM Toronto
2000 Yu Sun Consensus Strings under Hamming Distance
1998 Yin Li String Covering Algorithms IBM Toronto
1998 Bandula Dahanayake Repetitions in Strings
1998 Ayse Karaman Sturmian Strings Asst. Prof. (Isik University)
1994 Irene Zhong Object-Oriented Course Administration System DuPont Corporation
1993 Chris Cupido A System for Teaching Boolean Algebra
1993 Nick Werczak 3D Engineering Graphics Waterfront International
1992 Hong Zhou Engineering Graphics IBM Toronto
1992 Yan Xia Graph Theory Toolkit System
1988 Shu-Shan Li Graph Perfect -- A Graph Editor
Sunday, 07-Jan-2018 11:11:42 EST