Grant: Discovery Grants Program - Individual
Simon Fraser University
$24,000.00
Combinatorial algorithms in bioinformatics and communications networks
EF 2009-10
Résumé
In my research, I study problems that arise in graph theory and related areas, often motivated by applications in
current network technologies such as high-speed networks, and bioinformatics.
With my students I develop new algorithms for various practical problems. Recently, these algorithms were for faster and better long sequence alignment, for haplotyping via galled tree networks--a problem related to genetic desease susceptibility, and inverse protein forlding--an area playing a major role in modern drug designs.
In the area of communications networks I am interested in two fundamental problems, the virtual path finding and topology control. The mathematical structure inherent in these problems has made them central to the theoretical computer science community. My interest in theoretical cost models for mobile (ad-hoc) networks is motivated by the fact that most previous work is experimental with little qualitative analyses.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
British Columbia, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data
Tel que publié
Application id
261542-2007
Name nom
Stacho, Ladislav
Department département
Mathematics
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
2009
Competition year année de concours
2007
Award amount
24000
Program id
RGPIN
Program nane 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
331
Committee name en
Computing and Information Sciences - B
Committee name fr
Informatique - B
Area of application code
1205
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Mathematical sciences
Area of application fr
Sciences mathématiques
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
3
Nb partie
5
Application title
Combinatorial algorithms in bioinformatics and communications networks
Keyword
NA
Application summary
In my research, I study problems that arise in graph theory and related areas, often motivated by applications in
current network technologies such as high-speed networks, and bioinformatics.
With my students I develop new algorithms for various practical problems. Recently, these algorithms were for faster and better long sequence alignment, for haplotyping via galled tree networks--a problem related to genetic desease susceptibility, and inverse protein forlding--an area playing a major role in modern drug designs.
In the area of communications networks I am interested in two fundamental problems, the virtual path finding and topology control. The mathematical structure inherent in these problems has made them central to the theoretical computer science community. My interest in theoretical cost models for mobile (ad-hoc) networks is motivated by the fact that most previous work is experimental with little qualitative analyses.