منابع مشابه
When Double is not Twice as Much
Gene and genome duplications provide a playground for various selective pressures and contribute significantly to genome complexity. It is assumed that the genomes of all major eukaryotic lineages possess duplicated regions that result from gene and genome duplication. There is evidence that the model plant Arabidopsis has been subjected to at least three whole-genome duplication events over th...
متن کاملThe ITS2 Database
The internal transcribed spacer 2 (ITS2) has been used as a phylogenetic marker for more than two decades. As ITS2 research mainly focused on the very variable ITS2 sequence, it confined this marker to low-level phylogenetics only. However, the combination of the ITS2 sequence and its highly conserved secondary structure improves the phylogenetic resolution(1) and allows phylogenetic inferenc...
متن کامل“’Twice as Hard for Half as Much’: Wealth Privilege and the Racial Wealth Gap”
Those who study the racial wealth gap are in a bind. Although the Life Cycle Hypothesis (LCH) serves as an effective framework to understand the wealth gap, it is itself incapable of explaining a key question: why the racial wealth gap is so much larger than the racial income gap. This paper introduces the Wealth Privilege (WP) model as an alternative vehicle to ground future analysis. Unlike t...
متن کاملMulti-spectral Xrf Counting: Squeeze Twice as Much Information from Your Detector
Counting small peaks on large backgrounds in XRF applications is a process limited by the statistics of estimating both the counts and the background in the peak region. Improving energy resolution ΔE helps by increasing peak/background ratio and providing a more accurate estimate of the background but also reduces counting statistics due to increased pileup losses. Time variant filtering techn...
متن کاملNeither Reading Few Bits Twice Nor Reading Illegally Helps Much
We first consider so-called (1,+s)-branching programs in which along every consistent path at most s variables are tested more than once. We prove that any such program computing a characteristic function of a linear code C has size at least 2Ω(min{d1, d2/s}), where d1 and d2 are the minimal distances of C and its dual C ⊥. We apply this criterion to explicit linear codes and obtain a super-pol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Molecular Biology and Evolution
سال: 2015
ISSN: 0737-4038,1537-1719
DOI: 10.1093/molbev/msv174