检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]兰州大学生命科学学院植物学及植物生理研究所,兰州730000
出 处:《兰州大学学报(自然科学版)》2009年第3期50-54,共5页Journal of Lanzhou University(Natural Sciences)
基 金:国家自然科学基金项目(30470163)
摘 要:以甘肃省临泽县境内的4种生态型芦苇(Phragmites communis Trin。)的18个样品为材料,采用PCR扩增技术,以通用引物"matK-FF74",和"matK-trnK-2R"扩增matK/trnK序列,对纯化后的产物进行序列测定和分析。序列比对软件为Clustal W,系统发育软件分析为PAUP4b10并用以构建MP和ML发育树和计算遗传距离,外群为芦竹(Arundo donax)。结果表明:matK/trnK序列长为1745~1753 bp,含有91个简约信息位点和120个可变位点,获得3个严格一致树。MP树和ML树共同说明水生芦苇是最古老的类群,它与沙丘芦苇之间的遗传距离最远,重度盐渍过渡型芦苇和轻度盐渍过渡型芦苇属于中间过渡类群。18 reed samples of four ecotypes (Phragmites communis Trin.) from Linze County, Gansu Province were used as materials and their DNA were isolated with CTAB methods, matK/trnK sequences of chloroplast genome were amplified with primer pairs named raatK-FF74 and raatK-trnK-2R, then PCR products were sequenced and analysed by Clustal W software and PAUP4b10 software. Analysis methods were maximum parsimony method and maximum likelihood method. The data were used for reconstructing the phylogenetic trees and calculating the genetic distance among these four ecotypes. Arundo donax was regarded as an outgroup. The results indicate that the lengths of amplified matK/trnK segments are approximately 1 745-1753 bp in the samples, containing 91 parsimony information sites and 120 variable sites. The majority parsimony tree is condensed from 3 maximum parsimony trees and it is indicated that swamp reed is the oldest ecotype, the genetic distance between it and dune reed is the farthest of all while light salt meadow reed is the nearest from it; it was aslo suggested that light salt meadow reed and heavy salt meadow reed are intermediate forms. So was the results from analysis by maximum likelihood method.
关 键 词:生态型芦苇 系统发育 遗传距离 最大简约法 最大似然法 甘肃省临泽县
分 类 号:Q945.78[生物学—植物学] TP301.6[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.13