Search
Skip to Search Results- 4Computing Science, Department of
- 4Computing Science, Department of/Technical Reports (Computing Science)
- 2Agricultural, Food and Nutritional Science, Department of
- 2Agricultural, Food and Nutritional Science, Department of/Journal Articles (Agricultural, Food and Nutritional Science)
- 2Graduate and Postdoctoral Studies (GPS), Faculty of
- 2Graduate and Postdoctoral Studies (GPS), Faculty of/Theses and Dissertations
-
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
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...
-
2012
Wang, Lusheng, Moore, Steve S., Cai, Zhipeng, Goebel, Randy, Lin, Guohui, Wang, Yining, Stothard, Paul
Background Single nucleotide polymorphism (SNP) genotyping assays normally give rise to certain percents of no-calls; the problem becomes severe when the target organisms, such as cattle, do not have a high resolution genomic sequence. Missing SNP genotypes, when related to target traits, would...
-
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...
-
2009
Goebel, Randy, Chen, Jiyang, Yu, Philip S., Zaiane, Osmar R.
Technical report TR09-02. The significant increase in open access digital information has created incredible opportunities for modern database research, especially in exploiting significant computational resources to determine complex relationships within those data. In this paper, we consider...