Cargando…

Convex hulls in hamming space enable efficient search for similarity and clustering of genomic sequences

BACKGROUND: In molecular epidemiology, comparison of intra-host viral variants among infected persons is frequently used for tracing transmissions in human population and detecting viral infection outbreaks. Application of Ultra-Deep Sequencing (UDS) immensely increases the sensitivity of transmissi...

Descripción completa

Detalles Bibliográficos
Autores principales: Campo, David S., Khudyakov, Yury
Formato: Online Artículo Texto
Lenguaje:English
Publicado: BioMed Central 2020
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7772912/
https://www.ncbi.nlm.nih.gov/pubmed/33375937
http://dx.doi.org/10.1186/s12859-020-03811-z
_version_ 1783629963200561152
author Campo, David S.
Khudyakov, Yury
author_facet Campo, David S.
Khudyakov, Yury
author_sort Campo, David S.
collection PubMed
description BACKGROUND: In molecular epidemiology, comparison of intra-host viral variants among infected persons is frequently used for tracing transmissions in human population and detecting viral infection outbreaks. Application of Ultra-Deep Sequencing (UDS) immensely increases the sensitivity of transmission detection but brings considerable computational challenges when comparing all pairs of sequences. We developed a new population comparison method based on convex hulls in hamming space. We applied this method to a large set of UDS samples obtained from unrelated cases infected with hepatitis C virus (HCV) and compared its performance with three previously published methods. RESULTS: The convex hull in hamming space is a data structure that provides information on: (1) average hamming distance within the set, (2) average hamming distance between two sets; (3) closeness centrality of each sequence; and (4) lower and upper bound of all the pairwise distances among the members of two sets. This filtering strategy rapidly and correctly removes 96.2% of all pairwise HCV sample comparisons, outperforming all previous methods. The convex hull distance (CHD) algorithm showed variable performance depending on sequence heterogeneity of the studied populations in real and simulated datasets, suggesting the possibility of using clustering methods to improve the performance. To address this issue, we developed a new clustering algorithm, k-hulls, that reduces heterogeneity of the convex hull. This efficient algorithm is an extension of the k-means algorithm and can be used with any type of categorical data. It is 6.8-times more accurate than k-mode, a previously developed clustering algorithm for categorical data. CONCLUSIONS: CHD is a fast and efficient filtering strategy for massively reducing the computational burden of pairwise comparison among large samples of sequences, and thus, aiding the calculation of transmission links among infected individuals using threshold-based methods. In addition, the convex hull efficiently obtains important summary metrics for intra-host viral populations.
format Online
Article
Text
id pubmed-7772912
institution National Center for Biotechnology Information
language English
publishDate 2020
publisher BioMed Central
record_format MEDLINE/PubMed
spelling pubmed-77729122020-12-30 Convex hulls in hamming space enable efficient search for similarity and clustering of genomic sequences Campo, David S. Khudyakov, Yury BMC Bioinformatics Research BACKGROUND: In molecular epidemiology, comparison of intra-host viral variants among infected persons is frequently used for tracing transmissions in human population and detecting viral infection outbreaks. Application of Ultra-Deep Sequencing (UDS) immensely increases the sensitivity of transmission detection but brings considerable computational challenges when comparing all pairs of sequences. We developed a new population comparison method based on convex hulls in hamming space. We applied this method to a large set of UDS samples obtained from unrelated cases infected with hepatitis C virus (HCV) and compared its performance with three previously published methods. RESULTS: The convex hull in hamming space is a data structure that provides information on: (1) average hamming distance within the set, (2) average hamming distance between two sets; (3) closeness centrality of each sequence; and (4) lower and upper bound of all the pairwise distances among the members of two sets. This filtering strategy rapidly and correctly removes 96.2% of all pairwise HCV sample comparisons, outperforming all previous methods. The convex hull distance (CHD) algorithm showed variable performance depending on sequence heterogeneity of the studied populations in real and simulated datasets, suggesting the possibility of using clustering methods to improve the performance. To address this issue, we developed a new clustering algorithm, k-hulls, that reduces heterogeneity of the convex hull. This efficient algorithm is an extension of the k-means algorithm and can be used with any type of categorical data. It is 6.8-times more accurate than k-mode, a previously developed clustering algorithm for categorical data. CONCLUSIONS: CHD is a fast and efficient filtering strategy for massively reducing the computational burden of pairwise comparison among large samples of sequences, and thus, aiding the calculation of transmission links among infected individuals using threshold-based methods. In addition, the convex hull efficiently obtains important summary metrics for intra-host viral populations. BioMed Central 2020-12-30 /pmc/articles/PMC7772912/ /pubmed/33375937 http://dx.doi.org/10.1186/s12859-020-03811-z Text en © The Author(s) 2020 Open AccessThis article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/. The Creative Commons Public Domain Dedication waiver (http://creativecommons.org/publicdomain/zero/1.0/) applies to the data made available in this article, unless otherwise stated in a credit line to the data.
spellingShingle Research
Campo, David S.
Khudyakov, Yury
Convex hulls in hamming space enable efficient search for similarity and clustering of genomic sequences
title Convex hulls in hamming space enable efficient search for similarity and clustering of genomic sequences
title_full Convex hulls in hamming space enable efficient search for similarity and clustering of genomic sequences
title_fullStr Convex hulls in hamming space enable efficient search for similarity and clustering of genomic sequences
title_full_unstemmed Convex hulls in hamming space enable efficient search for similarity and clustering of genomic sequences
title_short Convex hulls in hamming space enable efficient search for similarity and clustering of genomic sequences
title_sort convex hulls in hamming space enable efficient search for similarity and clustering of genomic sequences
topic Research
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7772912/
https://www.ncbi.nlm.nih.gov/pubmed/33375937
http://dx.doi.org/10.1186/s12859-020-03811-z
work_keys_str_mv AT campodavids convexhullsinhammingspaceenableefficientsearchforsimilarityandclusteringofgenomicsequences
AT khudyakovyury convexhullsinhammingspaceenableefficientsearchforsimilarityandclusteringofgenomicsequences