Search
Skip to Search Results- 4Approximation algorithms
- 3Computational biology
- 2Algorithmics
- 2Cattle
- 12N=50 Cytogenetic Map
- 1Alleles
- 11Computing Science, Department of
- 11Computing 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)
-
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...
-
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....
-
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...
-
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...
-
2005
Xu, Dong, Wu, Xiaomeng, Wan, Xiu-Feng, Lin, Guohui, Gang, Wu
Technical report TR05-06. The availability of complete genomic sequences allows us to infer the evolutionary footprints between species in a global strategy. However, the length of these genomic sequences poses a challenge on computational efficiency and optimality of information representation...
-
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 ...
-
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...
-
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...
-
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...