Canada Spends Logo

Explore our Budget 2026 analysis

Grant: Discovery Grants Program - Individual

Simon Fraser University

$62,000.00

Algorithmic challenges in population scale genomics

FY 2013-14

Summary
This proposal aims to address some of the algorithmic challenges offered by data explosion through high throughput sequencing technologies. We aim to bridge the gap between the capacity to generate data, which is growing faster than the Moore's Law, and the ability to manage, store, communicate and analyze it, through novel algorithmic approaches. Typically our algorithmic approaches rely on combinatorial optimization, data structures, approximation algorithms and techniques from combinatorial pattern matching. We will aim to develop novel methods aiming to simultaneously compress and index genome sequence data through re-ordering reads coming from high throughput sequencing platforms on which existing compression and mapping technologies will be applied. This boosting technique for is motivated by the Locally Consistent Parsing technique, which is applied the first time to genomics in this proposal. At the heart of the algorithmic challenges to be addressed in this proposal is the simultaneous discovery of structural variation among multiple related genomes problem. We will develop novel combinatorial formulations and heuristic techniques motivated by approximation algorithms literature for its solution. We will also focus on identifying biologically important structural variants through correlating them with other forms of high throughput biological data such as gene expression and interaction information represented as a network.
Program
Discovery Grants Program - Individual
Location
British Columbia, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data

As published

Application id
298339-2012
Name nom
Sahinalp, Cenk
Department département
Computing Science, School of
Organization id
5
Institution établissement
Simon Fraser University
Province en
British Columbia
Province fr
Colombie-Britannique
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2013
Competition year année de concours
2012
Award amount
62000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
1507
Committee name en
Computer Science
Committee name fr
Sciences informatiques
Area of application code
801
Area of application group en
Information and communication services
Area of application group fr
Services d'information et de télécommunications
Area of application en
Computer software
Area of application fr
Logiciel
Research subject code
2713
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Algorithms
Research subject fr
Algorithmes
Partie
2
Nb partie
5
Application title
Algorithmic challenges in population scale genomics
Keyword
NSERC
Application summary
This proposal aims to address some of the algorithmic challenges offered by data explosion through high throughput sequencing technologies. We aim to bridge the gap between the capacity to generate data, which is growing faster than the Moore's Law, and the ability to manage, store, communicate and analyze it, through novel algorithmic approaches. Typically our algorithmic approaches rely on combinatorial optimization, data structures, approximation algorithms and techniques from combinatorial pattern matching. We will aim to develop novel methods aiming to simultaneously compress and index genome sequence data through re-ordering reads coming from high throughput sequencing platforms on which existing compression and mapping technologies will be applied. This boosting technique for is motivated by the Locally Consistent Parsing technique, which is applied the first time to genomics in this proposal. At the heart of the algorithmic challenges to be addressed in this proposal is the simultaneous discovery of structural variation among multiple related genomes problem. We will develop novel combinatorial formulations and heuristic techniques motivated by approximation algorithms literature for its solution. We will also focus on identifying biologically important structural variants through correlating them with other forms of high throughput biological data such as gene expression and interaction information represented as a network.
Simon Fraser University - $62,000 Grant (2013-14) | Canada Spends