Search arXivSearch

arXiv · 2108.12938

Replacing quarantine of COVID-19 contacts with periodic testing is also effective in mitigating the risk of transmission

Abstract

The quarantine of identified close contacts has been vital to reducing transmission rates and averting secondary infection risk before symptom onset and by asymptomatic cases. The effectiveness of this contact tracing strategy to mitigate transmission is sensitive to the adherence to quarantines, which may be lower for longer quarantine periods or in vaccinated populations (where perceptions of risk are reduced). This study develops a simulation model to evaluate contact tracing strategies based on the sequential testing of identified contacts after exposure as an alternative to quarantines, in which contacts are isolated only after confirmation by a positive test. The analysis considers different number and types of tests (PCR and lateral flow antigen tests (LFA)) to identify the cost-effective testing policies that minimize the expected infecting days post-exposure considering different levels of testing capacity. This analysis suggests that even a limited number of tests can be effective at reducing secondary infection risk: two LFA tests (with optimal timing) avert infectiousness at a level that is comparable to 14-day quarantine with 80-90% adherence, or equivalently, 7-9 day quarantine with full adherence (depending on the sensitivity of the LFA test). Adding a third test (PCR or LFA) reaches the efficiency of a 14-day quarantine with 90-100% adherence. These results are robust to the exposure dates of the contact, test sensitivity of LFA and alternative models of viral load evolution, which suggests that simple testing rules can be effective for improving contact tracing in settings where strict quarantine adherence is difficult to implement.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Patricio Foncea, Susana Mondschein, Marcelo Olivares. 2022-02-13. Replacing quarantine of COVID-19 contacts with periodic testing is also effective in mitigating the risk of transmission. https://doi.org/10.1038/s41598-022-07447-2

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