Download - Quest for the optimal algorithm
![Page 2: Quest for the optimal algorithm](https://reader034.vdocuments.us/reader034/viewer/2022042701/55a8dc3b1a28abae3e8b48b4/html5/thumbnails/2.jpg)
![Page 3: Quest for the optimal algorithm](https://reader034.vdocuments.us/reader034/viewer/2022042701/55a8dc3b1a28abae3e8b48b4/html5/thumbnails/3.jpg)
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
=========================================================
![Page 4: Quest for the optimal algorithm](https://reader034.vdocuments.us/reader034/viewer/2022042701/55a8dc3b1a28abae3e8b48b4/html5/thumbnails/4.jpg)
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
=========================================================
![Page 5: Quest for the optimal algorithm](https://reader034.vdocuments.us/reader034/viewer/2022042701/55a8dc3b1a28abae3e8b48b4/html5/thumbnails/5.jpg)
![Page 6: Quest for the optimal algorithm](https://reader034.vdocuments.us/reader034/viewer/2022042701/55a8dc3b1a28abae3e8b48b4/html5/thumbnails/6.jpg)
![Page 7: Quest for the optimal algorithm](https://reader034.vdocuments.us/reader034/viewer/2022042701/55a8dc3b1a28abae3e8b48b4/html5/thumbnails/7.jpg)
![Page 8: Quest for the optimal algorithm](https://reader034.vdocuments.us/reader034/viewer/2022042701/55a8dc3b1a28abae3e8b48b4/html5/thumbnails/8.jpg)
A conserved gene cluster is a set of genes which are locatedclose to one another in multiple genomes.
![Page 9: Quest for the optimal algorithm](https://reader034.vdocuments.us/reader034/viewer/2022042701/55a8dc3b1a28abae3e8b48b4/html5/thumbnails/9.jpg)
A conserved gene cluster is a set of genes which are locatedclose to one another in multiple genomes.
![Page 10: Quest for the optimal algorithm](https://reader034.vdocuments.us/reader034/viewer/2022042701/55a8dc3b1a28abae3e8b48b4/html5/thumbnails/10.jpg)
A conserved gene cluster is a set of genes which are locatedclose to one another in multiple genomes.
![Page 11: Quest for the optimal algorithm](https://reader034.vdocuments.us/reader034/viewer/2022042701/55a8dc3b1a28abae3e8b48b4/html5/thumbnails/11.jpg)
A δ gene team is a maximal set of genes where the distancebetween adjacent genes is at most δ
![Page 12: Quest for the optimal algorithm](https://reader034.vdocuments.us/reader034/viewer/2022042701/55a8dc3b1a28abae3e8b48b4/html5/thumbnails/12.jpg)
A δ gene team is a maximal set of genes where the distancebetween adjacent genes is at most δ
![Page 13: Quest for the optimal algorithm](https://reader034.vdocuments.us/reader034/viewer/2022042701/55a8dc3b1a28abae3e8b48b4/html5/thumbnails/13.jpg)
A δ gene team is a maximal set of genes where the distancebetween adjacent genes is at most δ
![Page 14: Quest for the optimal algorithm](https://reader034.vdocuments.us/reader034/viewer/2022042701/55a8dc3b1a28abae3e8b48b4/html5/thumbnails/14.jpg)
A δ gene team is a maximal set of genes where the distancebetween adjacent genes is at most δ
![Page 15: Quest for the optimal algorithm](https://reader034.vdocuments.us/reader034/viewer/2022042701/55a8dc3b1a28abae3e8b48b4/html5/thumbnails/15.jpg)
FindTeams algorithm for computing δ gene team of twopermutations in O(n lg2 n)
![Page 16: Quest for the optimal algorithm](https://reader034.vdocuments.us/reader034/viewer/2022042701/55a8dc3b1a28abae3e8b48b4/html5/thumbnails/16.jpg)
![Page 17: Quest for the optimal algorithm](https://reader034.vdocuments.us/reader034/viewer/2022042701/55a8dc3b1a28abae3e8b48b4/html5/thumbnails/17.jpg)
2007
![Page 18: Quest for the optimal algorithm](https://reader034.vdocuments.us/reader034/viewer/2022042701/55a8dc3b1a28abae3e8b48b4/html5/thumbnails/18.jpg)
2007
![Page 19: Quest for the optimal algorithm](https://reader034.vdocuments.us/reader034/viewer/2022042701/55a8dc3b1a28abae3e8b48b4/html5/thumbnails/19.jpg)
![Page 20: Quest for the optimal algorithm](https://reader034.vdocuments.us/reader034/viewer/2022042701/55a8dc3b1a28abae3e8b48b4/html5/thumbnails/20.jpg)
2007
![Page 21: Quest for the optimal algorithm](https://reader034.vdocuments.us/reader034/viewer/2022042701/55a8dc3b1a28abae3e8b48b4/html5/thumbnails/21.jpg)
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
![Page 22: Quest for the optimal algorithm](https://reader034.vdocuments.us/reader034/viewer/2022042701/55a8dc3b1a28abae3e8b48b4/html5/thumbnails/22.jpg)
2008
![Page 23: Quest for the optimal algorithm](https://reader034.vdocuments.us/reader034/viewer/2022042701/55a8dc3b1a28abae3e8b48b4/html5/thumbnails/23.jpg)
![Page 24: Quest for the optimal algorithm](https://reader034.vdocuments.us/reader034/viewer/2022042701/55a8dc3b1a28abae3e8b48b4/html5/thumbnails/24.jpg)
2009
![Page 25: Quest for the optimal algorithm](https://reader034.vdocuments.us/reader034/viewer/2022042701/55a8dc3b1a28abae3e8b48b4/html5/thumbnails/25.jpg)
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
![Page 26: Quest for the optimal algorithm](https://reader034.vdocuments.us/reader034/viewer/2022042701/55a8dc3b1a28abae3e8b48b4/html5/thumbnails/26.jpg)
2011
![Page 27: Quest for the optimal algorithm](https://reader034.vdocuments.us/reader034/viewer/2022042701/55a8dc3b1a28abae3e8b48b4/html5/thumbnails/27.jpg)
An O(n lg n) algorithm for finding gene teams
![Page 28: Quest for the optimal algorithm](https://reader034.vdocuments.us/reader034/viewer/2022042701/55a8dc3b1a28abae3e8b48b4/html5/thumbnails/28.jpg)
Formulate the Maximum Gap problem
delete(p)
p
![Page 29: Quest for the optimal algorithm](https://reader034.vdocuments.us/reader034/viewer/2022042701/55a8dc3b1a28abae3e8b48b4/html5/thumbnails/29.jpg)
Formulate the Maximum Gap problem
delete(p)
p
Proposed a data structure that supports n delete operations inO(n lg lg n) time
![Page 30: Quest for the optimal algorithm](https://reader034.vdocuments.us/reader034/viewer/2022042701/55a8dc3b1a28abae3e8b48b4/html5/thumbnails/30.jpg)
2013
![Page 31: Quest for the optimal algorithm](https://reader034.vdocuments.us/reader034/viewer/2022042701/55a8dc3b1a28abae3e8b48b4/html5/thumbnails/31.jpg)
2013
Proposed a data structure that supports n delete operations inO(n α(n)) time
![Page 32: Quest for the optimal algorithm](https://reader034.vdocuments.us/reader034/viewer/2022042701/55a8dc3b1a28abae3e8b48b4/html5/thumbnails/32.jpg)
2014
Constructing a Gene Team Tree in O(n lg n) time?