Grant: Discovery Grants Program - Individual
University of Toronto
$29,000.00
Data compression for biomedical data analysis
FY 2022-23
Summary
Increasingly massive biological data sets are being generated. These data range from high-throughput (meta)genomic sequencing to population-level studies of communities made possible only by the advent of coordinated electronic health records. Much of the focus of researchers has been on the analysis and interpretation of these data sets for generating biological insights or medical interventions. However, this focus on biological impact obscures the underlying fundamental infrastructural challenges of handling and transmitting those data, for which the design of appropriate and targeted data compression techniques is essential. As computational resources and transmission bandwidth become incapable of handling the influx, faster algorithms and appropriate data compression become essential for large scale analytics. Fortunately, unlike simply applying general-purpose data compression, the design of targeted compression methods often leads to the discovery of other desirable biologically-relevant features. The aims of this project are (1) to design new lossy compressive feature sets suitable for fast transmission and analysis of genomic sequencing data, (2) to develop succinct compressed summary sketches of medical data for privacy-preserving distributed analyses, and (3) to utilize insights from the previous two aims to build faster bioanalysis software. GOALS and APPROACH (1) Compression algorithms typically rely on the identification of repetitive patterns in the source data to structure the compressed representation. In the context of sequencing data, biologists have often relied on random k-mer selection to find redundancies. We believe that rigorously analyzing k-mer selection methods and related alternatives for can be used to exploit redundancy in both population mapping and metagenomic data sets. (2) An alternative to identifying repetitive patterns is to extract only patterns that downstream agents perceive. In this mode, for many analyses, we do not need access to the raw data, but can instead work with probabilistic summaries. This not only assists in reducing transmission requirements between collaborating institutions, but can also improve and provide privacy guarantees, useful when dealing with patient health records. These probabilistic summaries can further be augmented with multi-party computation techniques from the cryptographic literature to give privacy and security guarantees to all of the parties involved in the analysis. (3) From prior work, we know that it often turns out that in the building of smaller representations of data, we can often improve the runtime and sometimes accuracy of downstream analysis algorithms. This is not so much a separate goal. One aim of this proposal is to demonstrate the practical relevant of the compressed representations from Goals (1) and (2) to practitioners through the design and prototyping of usable software packages and libraries.
Program
Discovery Grants Program - Individual
Recipient
Location
Ontario, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
RGPIN-2022-03074
Name nom
Yu, Yun William
Department département
Computer and Mathematical Sciences (Scarborough) - Computer and Mathematical Sciences (Scarborough)
Organization id
31
Institution établissement
University of Toronto
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2022
Competition year année de concours
2022
Award amount
29000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
DISCOVERY RESEARCH
Group fr
RECHERCHE AXÉE SUR LA DÉCOUVERTE
Committee code
1507
Committee name en
Computer Science
Committee name fr
Sciences informatiques
Area of application code
1207
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Information, computer and communication technologies
Area of application fr
Technologie de l'information, des ordinateurs et des réseaux de communications
Research subject code
2700
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Information technology
Research subject fr
Technologie de l'information
Installment
inst:1
Partie
1
Nb partie
5
Application title
Data compression for biomedical data analysis
Application summary
Increasingly massive biological data sets are being generated. These data range from high-throughput (meta)genomic sequencing to population-level studies of communities made possible only by the advent of coordinated electronic health records. Much of the focus of researchers has been on the analysis and interpretation of these data sets for generating biological insights or medical interventions. However, this focus on biological impact obscures the underlying fundamental infrastructural challenges of handling and transmitting those data, for which the design of appropriate and targeted data compression techniques is essential. As computational resources and transmission bandwidth become incapable of handling the influx, faster algorithms and appropriate data compression become essential for large scale analytics. Fortunately, unlike simply applying general-purpose data compression, the design of targeted compression methods often leads to the discovery of other desirable biologically-relevant features. The aims of this project are (1) to design new lossy compressive feature sets suitable for fast transmission and analysis of genomic sequencing data, (2) to develop succinct compressed summary sketches of medical data for privacy-preserving distributed analyses, and (3) to utilize insights from the previous two aims to build faster bioanalysis software. GOALS and APPROACH (1) Compression algorithms typically rely on the identification of repetitive patterns in the source data to structure the compressed representation. In the context of sequencing data, biologists have often relied on random k-mer selection to find redundancies. We believe that rigorously analyzing k-mer selection methods and related alternatives for can be used to exploit redundancy in both population mapping and metagenomic data sets. (2) An alternative to identifying repetitive patterns is to extract only patterns that downstream agents perceive. In this mode, for many analyses, we do not need access to the raw data, but can instead work with probabilistic summaries. This not only assists in reducing transmission requirements between collaborating institutions, but can also improve and provide privacy guarantees, useful when dealing with patient health records. These probabilistic summaries can further be augmented with multi-party computation techniques from the cryptographic literature to give privacy and security guarantees to all of the parties involved in the analysis. (3) From prior work, we know that it often turns out that in the building of smaller representations of data, we can often improve the runtime and sometimes accuracy of downstream analysis algorithms. This is not so much a separate goal. One aim of this proposal is to demonstrate the practical relevant of the compressed representations from Goals (1) and (2) to practitioners through the design and prototyping of usable software packages and libraries.