Cargando…
Practical selection of representative sets of RNA-seq samples using a hierarchical approach
MOTIVATION: Despite numerous RNA-seq samples available at large databases, most RNA-seq analysis tools are evaluated on a limited number of RNA-seq samples. This drives a need for methods to select a representative subset from all available RNA-seq samples to facilitate comprehensive, unbiased evalu...
Autores principales: | , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Oxford University Press
2021
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8275344/ https://www.ncbi.nlm.nih.gov/pubmed/34252927 http://dx.doi.org/10.1093/bioinformatics/btab315 |
_version_ | 1783721694510186496 |
---|---|
author | Tung, Laura H Kingsford, Carl |
author_facet | Tung, Laura H Kingsford, Carl |
author_sort | Tung, Laura H |
collection | PubMed |
description | MOTIVATION: Despite numerous RNA-seq samples available at large databases, most RNA-seq analysis tools are evaluated on a limited number of RNA-seq samples. This drives a need for methods to select a representative subset from all available RNA-seq samples to facilitate comprehensive, unbiased evaluation of bioinformatics tools. In sequence-based approaches for representative set selection (e.g. a k-mer counting approach that selects a subset based on k-mer similarities between RNA-seq samples), because of the large numbers of available RNA-seq samples and of k-mers/sequences in each sample, computing the full similarity matrix using k-mers/sequences for the entire set of RNA-seq samples in a large database (e.g. the SRA) has memory and runtime challenges; this makes direct representative set selection infeasible with limited computing resources. RESULTS: We developed a novel computational method called ‘hierarchical representative set selection’ to handle this challenge. Hierarchical representative set selection is a divide-and-conquer-like algorithm that breaks representative set selection into sub-selections and hierarchically selects representative samples through multiple levels. We demonstrate that hierarchical representative set selection can achieve summarization quality close to that of direct representative set selection, while largely reducing runtime and memory requirements of computing the full similarity matrix (up to 8.4× runtime reduction and 5.35× memory reduction for 10 000 and 12 000 samples respectively that could be practically run with direct subset selection). We show that hierarchical representative set selection substantially outperforms random sampling on the entire SRA set of RNA-seq samples, making it a practical solution to representative set selection on large databases like the SRA. AVAILABILITY AND IMPLEMENTATION: The code is available at https://github.com/Kingsford-Group/hierrepsetselection and https://github.com/Kingsford-Group/jellyfishsim. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online. |
format | Online Article Text |
id | pubmed-8275344 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2021 |
publisher | Oxford University Press |
record_format | MEDLINE/PubMed |
spelling | pubmed-82753442021-07-13 Practical selection of representative sets of RNA-seq samples using a hierarchical approach Tung, Laura H Kingsford, Carl Bioinformatics Regulatory and Functional Genomics MOTIVATION: Despite numerous RNA-seq samples available at large databases, most RNA-seq analysis tools are evaluated on a limited number of RNA-seq samples. This drives a need for methods to select a representative subset from all available RNA-seq samples to facilitate comprehensive, unbiased evaluation of bioinformatics tools. In sequence-based approaches for representative set selection (e.g. a k-mer counting approach that selects a subset based on k-mer similarities between RNA-seq samples), because of the large numbers of available RNA-seq samples and of k-mers/sequences in each sample, computing the full similarity matrix using k-mers/sequences for the entire set of RNA-seq samples in a large database (e.g. the SRA) has memory and runtime challenges; this makes direct representative set selection infeasible with limited computing resources. RESULTS: We developed a novel computational method called ‘hierarchical representative set selection’ to handle this challenge. Hierarchical representative set selection is a divide-and-conquer-like algorithm that breaks representative set selection into sub-selections and hierarchically selects representative samples through multiple levels. We demonstrate that hierarchical representative set selection can achieve summarization quality close to that of direct representative set selection, while largely reducing runtime and memory requirements of computing the full similarity matrix (up to 8.4× runtime reduction and 5.35× memory reduction for 10 000 and 12 000 samples respectively that could be practically run with direct subset selection). We show that hierarchical representative set selection substantially outperforms random sampling on the entire SRA set of RNA-seq samples, making it a practical solution to representative set selection on large databases like the SRA. AVAILABILITY AND IMPLEMENTATION: The code is available at https://github.com/Kingsford-Group/hierrepsetselection and https://github.com/Kingsford-Group/jellyfishsim. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online. Oxford University Press 2021-07-12 /pmc/articles/PMC8275344/ /pubmed/34252927 http://dx.doi.org/10.1093/bioinformatics/btab315 Text en © The Author(s) 2021. Published by Oxford University Press. https://creativecommons.org/licenses/by/4.0/This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0/ (https://creativecommons.org/licenses/by/4.0/) ), which permits unrestricted reuse, distribution, and reproduction in any medium, provided the original work is properly cited. |
spellingShingle | Regulatory and Functional Genomics Tung, Laura H Kingsford, Carl Practical selection of representative sets of RNA-seq samples using a hierarchical approach |
title | Practical selection of representative sets of RNA-seq samples using a hierarchical approach |
title_full | Practical selection of representative sets of RNA-seq samples using a hierarchical approach |
title_fullStr | Practical selection of representative sets of RNA-seq samples using a hierarchical approach |
title_full_unstemmed | Practical selection of representative sets of RNA-seq samples using a hierarchical approach |
title_short | Practical selection of representative sets of RNA-seq samples using a hierarchical approach |
title_sort | practical selection of representative sets of rna-seq samples using a hierarchical approach |
topic | Regulatory and Functional Genomics |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8275344/ https://www.ncbi.nlm.nih.gov/pubmed/34252927 http://dx.doi.org/10.1093/bioinformatics/btab315 |
work_keys_str_mv | AT tunglaurah practicalselectionofrepresentativesetsofrnaseqsamplesusingahierarchicalapproach AT kingsfordcarl practicalselectionofrepresentativesetsofrnaseqsamplesusingahierarchicalapproach |