Expectation of the Site Frequency Spectrum
The site frequency spectrum describes variation among a set of n DNA sequences. Its i'th entry (i=1,2,...,n-1) is the number of nucleotide sites at which the mutant allele is present in i copies. Under selective neutrality, random mating, and constant population size, the expected value of the spectrum is well known but somewhat puzzling. Each additional sequence added to a sample adds an entry to the end of the expected spectrum but does not affect existing entries. This note reviews the reasons for this behavior.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Exact site frequency spectra of neutrally evolving tumors: a transition between power laws reveals a signature of cell viability
The site frequency spectrum (SFS) is a popular summary statistic of genomic data. While the SFS of a constant-sized population undergoing neutral mutations has been extensively studied in population genetics, the rapidly…
Decomposing the site frequency spectrum: the impact of tree topology on neutrality tests
We investigate the dependence of the site frequency spectrum (SFS) on the topological structure of genealogical trees. We show that basic population genetic statistics - for instance estimators of $\theta$ or neutrality …
Fisher-Wright model with deterministic seed bank and selection
Seed banks are a common characteristics to many plant species, which allow storage of genetic diversity in the soil as dormant seeds for various periods of time. We investigate an above-ground population following a Fish…
DiversityFundamental limits on the accuracy of demographic inference based on the sample frequency spectrum
The sample frequency spectrum (SFS) of DNA sequences from a collection of individuals is a summary statistic which is commonly used for parametric inference in population genetics. Despite the popularity of SFS-based inf…
GrokFormer: Graph Fourier Kolmogorov-Arnold Transformers
Graph Transformers (GTs) have demonstrated remarkable performance in incorporating various graph structure information, e.g., long-range structural dependency, into graph representation learning. However, self-attention …
Graph ClassificationGraph Representation LearningNode ClassificationRepresentation Learning