Use my Search Websuite to scan PubMed, PMCentral, Journal Hosts and Journal Archives, FullText.
Kick-your-searchterm to multiple Engines kick-your-query now !>
A dictionary by aggregated review articles of nephrology, medicine and the life sciences
Your one-stop-run pathway from word to the immediate pdf of peer-reviewed on-topic knowledge.

suck abstract from ncbi


10.1534/genetics.115.184101

http://scihub22266oqcxt.onion/10.1534/genetics.115.184101
suck pdf from google scholar
C4827730!4827730!26883445
unlimited free pdf from europmc26883445    free
PDF from PMC    free
html from PMC    free

suck abstract from ncbi

pmid26883445      Genetics 2016 ; 202 (4): 1549-61
Nephropedia Template TP

gab.com Text

Twit Text FOAVip

Twit Text #

English Wikipedia


  • The Site Frequency Spectrum for General Coalescents #MMPMID26883445
  • Spence JP; Kamm JA; Song YS
  • Genetics 2016[Apr]; 202 (4): 1549-61 PMID26883445show ga
  • General genealogical processes such as ?- and ?-coalescents, which respectively model multiple and simultaneous mergers, have important applications in studying marine species, strong positive selection, recurrent selective sweeps, strong bottlenecks, large sample sizes, and so on. Recently, there has been significant progress in developing useful inference tools for such general models. In particular, inference methods based on the site frequency spectrum (SFS) have received noticeable attention. Here, we derive a new formula for the expected SFS for general ?- and ?-coalescents, which leads to an efficient algorithm. For time-homogeneous coalescents, the runtime of our algorithm for computing the expected SFS is O(n2), where n is the sample size. This is a factor of n2 faster than the state-of-the-art method. Furthermore, in contrast to existing methods, our method generalizes to time-inhomogeneous ?- and ?-coalescents with measures that factorize as ?(dx)/?(t) and ?(dx)/?(t), respectively, where ? denotes a strictly positive function of time. The runtime of our algorithm in this setting is O(n3). We also obtain general theoretical results for the identifiability of the ? measure when ? is a constant function, as well as for the identifiability of the function ? under a fixed ? measure.
  • ä


  • DeepDyve
  • Pubget Overpricing
  • suck abstract from ncbi

    Linkout box