1. Quest for the Optimal Algorithm
Melvin Zhang
melvin@melvinzhang.net

3. CS5234 Projects by Students (Spring 2007)
(as of 27-March-2007)
=========================================================
Student | Type | Project
=========================================================
CAO YU | B/C | Set bipartite matching
CHENG WEI | B | Hierarchical Knapsack Problem
DAI BINGDIAN | B/C | Set bipartitle matching
DO HUY HOANG | C | Dynamic Graph Problems
NGO THANH SON | B | Least Common Ancestor
PATEL DHAVAL... | B | Mining on Graphs
REN YUAN | B | XML Filtering
TAN YEE FAN | C | Complexity of Sudoku
ZHANG ... MELVIN | B | Finding Gene Teams
ZHENG XUN | C | Airport Gate Allocation
9 students | A | BAP Partitioning
=========================================================

4. CS5234 Projects by Students (Spring 2007)
(as of 27-March-2007)
=========================================================
Student | Type | Project
=========================================================
CAO YU | B/C | Set bipartite matching
CHENG WEI | B | Hierarchical Knapsack Problem
DAI BINGDIAN | B/C | Set bipartitle matching
DO HUY HOANG | C | Dynamic Graph Problems
NGO THANH SON | B | Least Common Ancestor
PATEL DHAVAL... | B | Mining on Graphs
REN YUAN | B | XML Filtering
TAN YEE FAN | C | Complexity of Sudoku
ZHANG ... MELVIN | B | Finding Gene Teams
ZHENG XUN | C | Airport Gate Allocation
9 students | A | BAP Partitioning
=========================================================

8. A conserved gene cluster is a set of genes which are located
close to one another in multiple genomes.

9. A conserved gene cluster is a set of genes which are located
close to one another in multiple genomes.

10. A conserved gene cluster is a set of genes which are located
close to one another in multiple genomes.

11. A δ gene team is a maximal set of genes where the distance
between adjacent genes is at most δ

12. A δ gene team is a maximal set of genes where the distance
between adjacent genes is at most δ

13. A δ gene team is a maximal set of genes where the distance
between adjacent genes is at most δ

14. A δ gene team is a maximal set of genes where the distance
between adjacent genes is at most δ

15. FindTeams algorithm for computing δ gene team of two
permutations in O(n lg2
n)

17. 2007

18. 2007

20. 2007

21. Date: Mon, 9 Jun 2008 09:33:51 +0800
From: "Melvin Zhang"
To: "Leong Hon Wai"
Subject: Re: ISMB 2008 Late-breaking Posters
...
we can squeeze all the additional bookkeeping to compute the GTT for
permutations into work done by the parameterized algorithm, which
means it would have O(n lg^2 n) complexity in the worst case.
Regards,
Melvin

22. 2008

24. 2009

25. Date: Monday, September 14, 2009 5:52 PM
From: "Biing-Feng Wang"
To: "Melvin Zhang", "Leong Hon Wai"
Subject: Re: a request
Dear Prof. Leong and Melvin,
Many thanks for sending me the JCB paper.
(I had read its conference version and I enjoyed the reading very much.)
Now, we are working on a paper which gives improved algorithms for
the problems of finding gene teams and constructing gene team trees.
I will send you a copy once it is ready.
Best Regards,
Biing-Feng

26. 2011

27. An O(n lg n) algorithm for finding gene teams

28. Formulate the Maximum Gap problem
delete(p)
p

29. Formulate the Maximum Gap problem
delete(p)
p
Proposed a data structure that supports n delete operations in
O(n lg lg n) time

30. 2013

31. 2013
Proposed a data structure that supports n delete operations in
O(n α(n)) time

32. 2014
Constructing a Gene Team Tree in O(n lg n) time?