Search
Skip to Search Results- 4Approximation algorithms
- 3Computational biology
- 2Algorithmics
- 1Artificial Intelligence
- 1Bayesian scoring
- 1Biclustering
-
2008
Malhotra, Baljeet, Lin, Guohui
Technical report TR08-07. In gene expression microarray data analysis, biclustering has been demonstrated to be one of the most effective methods for discovering gene expression patterns under various conditions. We present in this study a framework to take advantage of the homogeneously...
-
2005
Wu, Gang, Lin, Guohui, You, Jia-Huai
Technical report TR05-05. A lookahead branch-and-bound algorithm is proposed for solving the Maximum Quartet Consistency Problem where the input is a complete set of quartets on the taxa and the goal is to construct a phylogeny which satisfies the maximum number of given quartets. Such a...
-
2010
Lin, Guohui, Shi, Xiaoyu, Hu, Yu, Zeng, Dahua, Zaiane, Osmar
Technical report TR10-04. This paper describes a novel and fast placement algorithm for field programmable gate array (FPGA) design space exploration. The proposed algorithm generates the placement based on the topological similarity between two configurations (netlists) in the design space....
-
2008
Cai, Zhipeng, Lin, Guohui, Want, Lusheng, Chen, Zhi-Zhong
Technical report TR08-06. The Capacitated Multicast Tree Routing Problem is considered, in which only a limited number of destination nodes are allowed to receive data in one routing tree and multiple routing trees are needed to send data from the source node to all destination nodes. The goal...
-
2011
Goebel, Randy, Wang, Lusheng, Lin, Guohui, Li, Zhong
Technical report TR11-02. Given two genomic maps G1 and G2 each represented as a sequence of n gene markers, the maximal strip recovery (MSR) problem is to retain the maximum number of markers in both G1 and G2 such that the resultant subsequences, denoted as G1* and G2*, can be partitioned into...
-
2003
Jiang, Tao, Lin, Guohui, Chen, Zhi-Zhong
Technical report TR03-06. Given a set of species and their similarity data, an important problem in evolutionary biology is how to reconstruct a phylogeny (also called evolutionary tree) so that species are close in the phylogeny if and only if they have high similarity. Assume that the...
-
2004
Cai, Zhipeng, Lin, Guohui, Xue, Guoliang
Technical report TR04-12. For the Capacitated Multicast Routing Problem, we considered two models which are the Multicast k-Path Routing and the Multicast k-Tree Routing. We presented two improved approximation algorithms for them, which have worst case performance ratios of 3 and (2 + ρ) (ρ is...
-
2006
Wagner, James, Tegos, Theodore, Wan, Xiang, Lin, Guohui
Technical report TR06-10. Background: Accurately quantifying the signature information of chemical shifts provides a foundation for accurate and complete sequential resonance assignment in protein NMR spectroscopy. A nearly complete assignment is a prerequisite for three dimensional protein ...
-
2003
Chen, Zhi-Zhong, Xu, Ying, Wen, Jianjun, Lin, Guohui, Jiang, Tao, Xu, Dong, Rizzi, Romeo
Technical report TR03-07. Protein NMR peak assignment refers to the process of assigning a group of \"spin systems\" obtained experimentally to a protein sequence of amino acids. The automation of this process is still an unsolved and challenging problem in NMR protein structure determination....