A large HCV transmission network enabled a fast-growing HIV outbreak in rural Indiana, 2015

Sumathi Ramachandran1, Hong Thai1, Joseph C Forbi1

  • 1Centers for Disease Control and Prevention, Molecular Epidemiology and Bioinformatics Laboratory, Division of Viral hepatitis, USA.

Ebiomedicine
|November 19, 2018
PubMed
Abstract

Related Concept Videos

Protein Networks02:26

Protein Networks

An organism can have thousands of different proteins, and these proteins must cooperate to ensure the health of an organism. Proteins bind to other proteins and form complexes to carry out their functions. Many proteins interact with multiple other proteins creating a complex network of protein interactions.
These interactions can be represented through maps depicting protein-protein interaction networks, represented as nodes and edges. Nodes are circles that are representative of a protein,...
4.5K
Protein Networks02:26

Protein Networks

2.9K
Steps in Outbreak Investigation01:18

Steps in Outbreak Investigation

In the ever-evolving field of public health, statistical analysis serves as a cornerstone for understanding and managing disease outbreaks. By leveraging various statistical tools, health professionals can predict potential outbreaks, analyze ongoing situations, and devise effective responses to mitigate impact. For that to happen, there are a few possible stages of the analysis:
586
Network Covalent Solids02:18

Network Covalent Solids

Network covalent solids contain a three-dimensional network of covalently bonded atoms as found in the crystal structures of nonmetals like diamond, graphite, silicon, and some covalent compounds, such as silicon dioxide (sand) and silicon carbide (carborundum, the abrasive on sandpaper). Many minerals have networks of covalent bonds.
To break or to melt a covalent network solid, covalent bonds must be broken. Because covalent bonds are relatively strong, covalent network solids are typically...
16.2K
Fast Fourier Transform01:10

Fast Fourier Transform

The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
944
Design of Transmission Shafts01:16

Design of Transmission Shafts

The design of a transmission shaft is governed by two primary specifications: the power it transmits and its rotational speed. These parameters guide the selection of the shaft's material and cross-sectional dimensions, ensuring that the material's maximum shearing stress remains within the elastic limit while transmitting the desired power at the given speed. The system's power is intrinsically linked to the applied torque. The torque applied to the shaft can be calculated by reconfiguring the...
785