Search
Skip to Search Results- 4Approximation algorithms
- 3Computational biology
- 2Algorithmics
- 2Autoepistemic logic
- 2Cattle
- 2Circumscription
- 17Computing Science, Department of
- 17Computing Science, Department of/Technical Reports (Computing Science)
- 3Agricultural, Food and Nutritional Science, Department of
- 3Agricultural, Food and Nutritional Science, Department of/Journal Articles (Agricultural, Food and Nutritional Science)
- 1Toolkit for Grant Success
- 1Toolkit for Grant Success/Educational Materials (Toolkit for Grant Success)
-
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...
-
A first generation whole genome RH map of the river buffalo with comparison to domestic cattle
Download2008
Santana, Andre M., Tonhati, Humberto, Greco, Anthony J., Mishra, Bina, Cai, Zhipeng, Kumar, S. T. Bharani, Tantia, Madhu S., Jones, Brittany C., Saradhi, G. Pardha, Miziara, Melissa N., Kumar, M. Aravind, Kochan, Kelli J., Goldammer, Tom, Brunner, Ronald M., Caetano, Alexandre R., Weikard, Rosemarie, Womack, James E., Mathew, Boby, Kumar, Satish, Pelai, Vanderlei A., Filho, Edson A. R., Jeong, Jooha, Prasad, Aparna, Vijh, Ramesh K., Lin, Guohui, Moore, Stephen, Galvao, Stephan R., Mariani, Paola, Grant, Jason R., Stafuzza, Nedenia B., Fornitano, Larissa C., Riggs, Penny K., Stothard, Paul, Amaral, M. Elisabete
Background The recently constructed river buffalo whole-genome radiation hybrid panel (BBURH5000) has already been used to generate preliminary radiation hybrid (RH) maps for several chromosomes, and buffalo-bovine comparative chromosome maps have been constructed. Here, we present the...
-
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...
-
Autoepistemic Circumscription and Logic Programming
1992
Technical report TR92-18. We propose a framework of autoepistemic reasoning in which the underlying semantics is determined by the choice of a nonmonotonic inference mechanism and by specifying a belief constraint. While the latter makes the approach flexible in meeting possibly different...
-
1992
Ghose, Aditya, Geobel, Randy, Yuan, Li-Yan
Technical report TR92-09. In many database applications, designers can easily provide at least some information about the relative importance of the information to be stored and manipulated. While of potentially high value, the ordering information is typically only partial. Here we address the...