Zobrazeno 1 - 10
of 35
pro vyhledávání: '"Ardalan Naseri"'
Publikováno v:
eLife, Vol 13 (2024)
Runs-of-homozygosity (ROH) segments, contiguous homozygous regions in a genome were traditionally linked to families and inbred populations. However, a growing literature suggests that ROHs are ubiquitous in outbred populations. Still, most existing
Externí odkaz:
https://doaj.org/article/7795cb95fd9d42c696b2ffb0a9038c55
Publikováno v:
PLoS Genetics, Vol 19, Iss 12, p e1011057 (2023)
Although genome-wide association studies (GWAS) have identified tens of thousands of genetic loci, the genetic architecture is still not fully understood for many complex traits. Most GWAS and sequencing association studies have focused on single nuc
Externí odkaz:
https://doaj.org/article/fb2db8acbfff4186aae289cf3eddbff6
Autor:
Ardalan Naseri, Kecong Tang, Xin Geng, Junjie Shi, Jing Zhang, Pramesh Shakya, Xiaoming Liu, Shaojie Zhang, Degui Zhi
Publikováno v:
BMC Biology, Vol 19, Iss 1, Pp 1-12 (2021)
Abstract Background The genealogical histories of individuals within populations are of interest to studies aiming both to uncover detailed pedigree information and overall quantitative population demographic histories. However, the analysis of quant
Externí odkaz:
https://doaj.org/article/260784ab84e647909f12aa01b4a5e26f
Autor:
Ying Feng, Yao Wang, Xiangnan Wang, Xiaohui He, Chen Yang, Ardalan Naseri, Thoru Pederson, Jing Zheng, Shaojie Zhang, Xiao Xiao, Wei Xie, Hanhui Ma
Publikováno v:
Genome Biology, Vol 21, Iss 1, Pp 1-24 (2020)
Abstract Introduction Despite the long-observed correlation between H3K9me3, chromatin architecture, and transcriptional repression, how H3K9me3 regulates genome higher-order organization and transcriptional activity in living cells remains unclear.
Externí odkaz:
https://doaj.org/article/0f0e8451da42416fa2e9117869a58941
Publikováno v:
Genome Biology, Vol 20, Iss 1, Pp 1-15 (2019)
Abstract While genetic relatedness, usually manifested as segments identical by descent (IBD), is ubiquitous in modern large biobanks, current IBD detection methods are not efficient at such a scale. Here, we describe an efficient method, RaPID, for
Externí odkaz:
https://doaj.org/article/86c31baf427a4588ba2377864c3fd893
Publikováno v:
BMC Bioinformatics, Vol 20, Iss S11, Pp 1-8 (2019)
Abstract Background Recent advances in whole-genome sequencing and SNP array technology have led to the generation of a large amount of genotype data. Large volumes of genotype data will require faster and more efficient methods for storing and searc
Externí odkaz:
https://doaj.org/article/a33d80b43cdb4d1ea88e6ffa0309869e
RAFFI: Accurate and fast familial relationship inference in large scale biobank studies using RaPID.
Publikováno v:
PLoS Genetics, Vol 17, Iss 1, p e1009315 (2021)
Inference of relationships from whole-genome genetic data of a cohort is a crucial prerequisite for genome-wide association studies. Typically, relationships are inferred by computing the kinship coefficients (ϕ) and the genome-wide probability of z
Externí odkaz:
https://doaj.org/article/6f9029bfe84946b08c8180966d1612ba
Publikováno v:
bioRxiv
While rates of recombination events across the genome (genetic maps) are fundamental to genetic research, the majority of current studies only use one standard map. There is evidence suggesting population differences in genetic maps, and thus estimat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6cfe17dbafc7e91545450a67b840c92a
https://doi.org/10.1101/2023.01.09.523304
https://doi.org/10.1101/2023.01.09.523304
Publikováno v:
GigaScience. 11
In the recent biobank era of genetics, the problem of identical-by-descent (IBD) segment detection received renewed interest, as IBD segments in large cohorts offer unprecedented opportunities in the study of population and genealogical history, as w
Publikováno v:
Bioinformatics (Oxford, England). 39(1)
MotivationThe positional Burrows–Wheeler transform (PBWT) has led to tremendous strides in haplotype matching on biobank-scale data. For genetic genealogical search, PBWT-based methods have optimized the asymptotic runtime of finding long matches b