My name is Wei-Bung (Bob) Wang ( in Chinese). I am a graduate student in the Department of Computer Science and Engineering, at the University of California, Riverside. I'm currently in the Algorithms and Computational Biology Lab, advised by Tao Jiang.

My interests include Design and Analysis of Algorithms, Computational Geometry, and Graph theory. I became interested in Computational Biology and Bioinformatics lately.

My Email address is , please feel free to contact me.

Progress Repost:

December 7
I wrote a quite simple subroutine last night and my program now can find the longest common substring. However my program can find only one solution while there may be more. My next step is to find all solutions.

December 6
I just wrote a generator to generate sequences with motif. My program answered the number of occurence right, so my program seemed to contruct a correct generalized suffix tree. My next step is to find the longest common substring with this tree.

December 4
I just implemented generalized suffix tree and it works well with "ABBAB" + "ABAAB." I hope it's bug-free because I've already cleared a lot of bugs.

November 22
Now my program works well with abaababaabaababaababa which is the string in the slides in class. Maybe there are still some bugs that I don't know. However, if I don't keep testing, it'll be bug-free on Thanksgiving. Bugs only come after Thanksgiving.

November 21 night
I'm still debugging. I found that my program didn't work with "ABBAB" and I just solved this problem. However, I find it doesn't work with "ABAAB." I hope I can find all bugs with strings of length at most 6.

November 21
My program now works well with the most frequently used string in suffix tree topic - "BANANA." It sometimes works and sometimes fails with other strings. I'm still debugging but I wonder how can I know if my program works with all strings.

November 18
I've written a program with Ukkonen's linear-time suffix tree algorithm. Now I'm debugging and it may takes forever to finish. It looks normal that the error is segmentation fault. I don't know when I will go forward to next step: logic errors.

Novmeber 12
I've read 6.1 and 6.5. I think I understand Ukkonen's ideas, but it's not easy to implement.

November 10
I've written a naive suffix tree which runs O(n^2) time.

November 8
I've got Gusfield's book, Algorithms on Strings, Trees, and Sequences. It looks challenging to implement the generalized suffix tree.

Last update: December 7, 2006