检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Zhan Liu Hui Zeng Huimin Xiang Shanjun Deng Xionglei He
出 处:《Journal of Genetics and Genomics》2024年第9期947-956,共10页遗传学报(英文版)
基 金:supported by the National Key R&D Program of China(2021YFA1302500 and 2021YFA1302501);the National Natural Science Foundation of China(32293190,32293191,31970570,and 32200492).
摘 要:Unraveling the lineage relationships of all descendants from a zygote is fundamental to advancing our understanding of developmental and stem cell biology.However,existing cell barcoding technologies in zebrafish lack the resolution to capture the majority of cell divisions during embryogenesis.A recently developed method,a substitution mutation-aided lineage-tracing system(SMALT),successfully reconstructed high-resolution cell phylogenetic trees for Drosophila melanogaster.Here,we implement the SMALT system in zebrafish,recording a median of 14 substitution mutations on a one-kilobase-pair barcoding sequence for one-day post-fertilization embryos.Leveraging this system,we reconstruct four cell lineage trees for zebrafish fin cells,encompassing both original and regenerated fin.Each tree consists of hundreds of internal nodes with a median bootstrap support of 99%.Analysis of the obtained cell lineage trees reveals that regenerated fin cells mainly originate from cells in the same part of the fins.Through multiple times sampling germ cells from the same individual,we show the stability of the germ cell pool and the early separation of germ cell and somatic cell progenitors.Our system offers the potential for reconstructing high-quality cell phylogenies across diverse tissues,providing valuable insights into development and disease in zebrafish.
关 键 词:Lineage tracing Cellular barcoding Zebrafishcell phylogeny Fin regeneration Germcell lineage
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.138.37.16