|
|||||
|
|
Genome size variation in three Saccharum species |
|
| Authors: | Jisen Zhang Chifumi Nagai Qingyi Yu Yong-Bao Pan Tomas Ayala-Silva Raymond J Schnell Jack C Comstock Aru K Arumuganathan Ray Ming |
| Institution: | 1. College of Life Sciences, Fujian Normal University, Fuzhou, 350108, China 2. Department of Plant Biology, University of Illinois at Urbana-Champaign, Urbana, IL, 61801, USA 3. Hawaii Agriculture Research Center, Waipahu, HI, 96797, USA 4. Department of Plant Pathology and Microbiology, AgriLife Research Center, Texas A&M University, Weslaco, TX, 78596, USA 5. Sugarcane Research Laboratory, USDA-ARS, MSA, Houma, LA, 70360, USA 6. National Germplasm Repository, USDA-ARS, Miami, FL, 33158, USA 7. Sugarcane Field Station, USDA-ARS, Canal Point, FL, 33438, USA 8. Benaroya Research Institute at Virginia Mason, Seattle, WA, 98101, USA |
| Abstract: | Saccharum species are autopolyploids with ploidy level ranging from 5× to 16x, and are considered the most complex genomes among crop plants. In present study, the genome sizes of 28 Saccharum spontaneum accessions, 15 Saccharum officinarum accessions, 28 Saccharum robustum accessions, and 12 Saccharum hybrids spp. were analyzed using flow cytometry. The estimated genome sizes of S. officinarum accessions ranged from 7.50 to 8.55?Gb with an average size of 7.88?Gb. In S. robustum, the estimated genome sizes ranged from 7.65 to 11.78, reflecting the variation of ploidy level. In S. spontaneum, the estimated genome sizes varied widely, with a range from 3.36 to 12.64?Gb, also due to variation of ploidy level. The average monoploid genome size of S. officinarum was 985?Mb, and that of S. spontaneum was 843?Mb. The results also showed that genome sizes were correlated with chromosome numbers, and based which, that the unknown chromosome numbers of some accessions could be predicted. The estimated genome sizes of Saccharum germplasm also helped identify some mislabeled accessions and yielded information critical for sugarcane breeding and genome sequencing programs. |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |