Search arXivSearch

arXiv · 1504.02751

Has wild poliovirus been eliminated from Nigeria?

Abstract

Wild poliovirus type 3 (WPV3) has not been seen anywhere since the last case of WPV3-associated paralysis in Nigeria in November 2012. At the time of writing, the most recent case of wild poliovirus type 1 (WPV1) in Nigeria occurred in July 2014, and WPV1 has not been seen in Africa since a case in Somalia in August 2014. No cases associated with circulating vaccine-derived type 2 poliovirus (cVDPV2) have been detected in Nigeria since November 2014. Has WPV1 been eliminated from Africa? Has WPV3 been eradicated globally? Has Nigeria interrupted cVDPV2 transmission? These questions are difficult because polio surveillance is based on paralysis and paralysis only occurs in a small fraction of infections. This report provides estimates for the probabilities of poliovirus elimination in Nigeria given available data as of March 31, 2015. It is based on a model of disease transmission that is built from historical polio incidence rates and is designed to represent the uncertainties in transmission dynamics and poliovirus detection that are fundamental to interpreting long time periods without cases. The model estimates that, as of March 31, 2015, the probability of WPV1 elimination in Nigeria is 84%, and that if WPV1 has not been eliminated, a new case will be detected with 99% probability by the end of 2015. The probability of WPV3 elimination (and thus global eradication) is >99%. However, it is unlikely that the ongoing transmission of cVDPV2 has been interrupted; the probability of cVDPV2 elimination rises to 83% if no new cases are detected by April 2016. Added July 10, 2015: On June 26, a cVDPV2 case was confirmed by the Global Polio Laboratory Network. The date of paralysis was May 16. The case provides new information about cVDPV2 prevalence that is useful for assessing the accuracy of previous predictions and informing an updated forecast for the time to cVDPV2 elimination.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Michael Famulare. 2015-07-10. Has wild poliovirus been eliminated from Nigeria?. https://doi.org/10.1371/journal.pone.0135765

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Evolution as fitness landscape navigation: concepts, measures, and emerging questions

Fitness landscapes are mappings between genotypes, phenotypes, and fitness that shape evolution. In recent years, empirical work and theoretical models have greatly advanced our understanding of how populations navigate rugged fitness landscapes. Here, we provide a timely review of the theoretical aspects of this field. Its rapidly growing literature employs a wide range of terms, which are sometimes used ambiguously or inconsistently. We therefore begin by defining the major concepts and the field's vocabulary, highlighting our own terminology choices wherever needed. We then review key results on the relationships between epistasis, ruggedness, accessibility, and navigability for genotype-fitness maps, highlighting several complex and sometimes counterintuitive connections that have emerged. Further, we review how the conserved structural properties of the underlying genotype-phenotype map, which can lead to the formation of large connected neutral networks of genotypes, influence dynamics on fitness landscapes. We then compare the two levels to study landscape navigation: the level of genotype-phenotype maps and the level of genotype-fitness maps. Our review leads us to propose a new measure of navigability, based on evolutionary outcomes, that is broadly applicable and overcomes limitations of existing measures. Finally, we highlight examples from the smaller body of work that relaxes the common assumption of fitness-monotonic paths on static landscapes, and discuss how this can fundamentally change the nature of fitness landscape navigation. Throughout the review, we identify directions for future work to fill existing gaps and to synthesize the disparate strands of research within the field.

q-bio.PE

Best Matches in Phylogenetic Networks

Best match graphs (BMGs) were introduced in mathematical phylogenetics to describe the concept of closest relatives for related genes (leaves of rooted tree) in different organisms (defining leaf colors). We generalize this concept here to leaf-colored rooted networks, where least common ancestors are in general neither unique nor comparable. We characterize BMGs of rooted networks as those vertex-colored digraphs that are properly colored and satisfy an easy-to-check condition that we call the sicor-in-hub property. BMGs can be recognized in linear time and an explaining network can be constructed in quadratic time. Analogous results are obtained for reciprocal best match graphs (RBMGs), where an edge $\{x,y\}$ corresponds to pairs of vertices with different color that are mutually closest relatives.

q-bio.PE

Exact Counts of Binary Phylogenetic Networks with Four Reticulations

Phylogenetic networks provide a flexible framework for representing reticulate evolutionary processes, such as hybridization, introgression, recombination, and horizontal gene transfer. However, their combinatorial complexity makes even basic enumeration problems difficult. Building on our previous work for networks with up to three reticulations, we derive an explicit closed-form formula for the number of unrestricted rooted binary phylogenetic networks with four reticulations on \(n\) labeled taxa. Our approach is based on tree-component graphs. We classify the 79 possible component graphs corresponding to networks with four reticulations into ten groups. We then enumerate the networks associated with each group by combining known counts of one-component networks, forests, and networks with fewer reticulations. Summing these contributions yields the desired formula. This result extends the exact enumeration of unrestricted binary phylogenetic networks to four reticulations and further demonstrates the effectiveness of component graphs for systematically organizing and counting increasingly complex network classes.

q-bio.PE