From components to communities: bringing network science to clustering for genomic epidemiology

Abstract

AbstractDefining clusters of epidemiologically-related infections is a common problem in the surveillance of infectious disease. A popular method for generating clusters is pairwise distance clustering, which assigns pairs of sequences to the same cluster if their genetic distance falls below some threshold. The result is often represented as a network or graph of infections. A connected component is a set of interconnected nodes in a graph that are not connected to any other node. The current approach to pairwise clustering is to map clusters to the connected components of the graph. However, the distance thresholds typically used for viruses like HIV-1 tend to yield components that exclude large numbers of infections as unconnected nodes. This is problematic for public health applications of clustering, such as tracking the growth of clusters over time. We propose that this problem can be addressed with community detection, a class of clustering methods being developed in the field of network science. A community is a set of nodes that are more densely inter-connected relative to the number of connections to external nodes. Thus, a connected component may be partitioned into two or more communities. Here we describe community detection methods in the context of genetic clustering for epidemiology, demonstrate how a popular method (Markov clustering) enables us to resolve variation in transmission rates within a giant connected component of HIV-1 sequences, and identify current challenges and directions for further work.