Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

University of Waterloo

$74,000.00

Bioinformatics software tools and Kolmogorov complexity

EF 2008-09

Résumé
This proposal is in two areas: bioinformatics and Kolmogorov complexity. Part I: Building a comprehensive biological sequence annotation system. This system consists of homology search tools (PatternHunter), motif finding and protein family classification tool (COPIA), protein threading tool (RAPTOR), coding region detection tool (ExonHunter), and protein-protein interaction literature mining tool (PathwayFinder). In developing these tools, we have invented the optimal spaced seeds for homology search and linear programming formulation for protein threading. We plan to investigate new ways of studying the following problems: (a) Linear programming formulation for loop modeling, side-chain modeling, refinement, and folding transmembrane proteins. (b) New indexing structure for large scale DNA databases. (c) Theory of optimal spaced seeds. Our invention of optimal spaced seeds has started a new trend of research. We will study the theory of spaced seeds in depth. (d) Further development of the widely used PatternHunter software in order to better serve the bioinformatics research community and industry. Part II. Kolmogorov complexity. We will do research in two directions: (a) Incompressibility method and average case analysis of algorithms. Over the past 15 years, we have been developing the incompressibility method and used it to solve a number of open problems. For example, recently we have successfully applied the method to analyze the average case complexity of Shellsort, an open problem for 40 years. We plan to further develop this methodology and use this method to analyze more algorithms. (b) Information distance, introduced by us in 1991, is now an accepted concept for measuring information distance between two objects. Our normalized information distance (2001) has found applications in whole genome phylogeny, English document classification, plagiarism detection, google distance, and various time series classification. This research will further generalize such concepts and develop more applications. Our research has directly created a part of Canadian bioinformatics industry (BSI); our research results are, and will continue to be, used in proteomics reseaerch and pharmaceuticals to help speed up drug discovery.
Programme
Discovery Grants Program - Individual
Emplacement
Ontario, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data

Tel que publié

Application id
46506-2006
Name nom
Li, Ming
Department département
Computer Science, School of
Organization id
33
Institution établissement
University of Waterloo
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2008
Competition year année de concours
2006
Award amount
74000
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
1201
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Life sciences (including biotechnology)
Area of application fr
Sciences de la vie (y compris biotechnologie)
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
Bioinformatics software tools and Kolmogorov complexity
Keyword
NA
Application summary
This proposal is in two areas: bioinformatics and Kolmogorov complexity. Part I: Building a comprehensive biological sequence annotation system. This system consists of homology search tools (PatternHunter), motif finding and protein family classification tool (COPIA), protein threading tool (RAPTOR), coding region detection tool (ExonHunter), and protein-protein interaction literature mining tool (PathwayFinder). In developing these tools, we have invented the optimal spaced seeds for homology search and linear programming formulation for protein threading. We plan to investigate new ways of studying the following problems: (a) Linear programming formulation for loop modeling, side-chain modeling, refinement, and folding transmembrane proteins. (b) New indexing structure for large scale DNA databases. (c) Theory of optimal spaced seeds. Our invention of optimal spaced seeds has started a new trend of research. We will study the theory of spaced seeds in depth. (d) Further development of the widely used PatternHunter software in order to better serve the bioinformatics research community and industry. Part II. Kolmogorov complexity. We will do research in two directions: (a) Incompressibility method and average case analysis of algorithms. Over the past 15 years, we have been developing the incompressibility method and used it to solve a number of open problems. For example, recently we have successfully applied the method to analyze the average case complexity of Shellsort, an open problem for 40 years. We plan to further develop this methodology and use this method to analyze more algorithms. (b) Information distance, introduced by us in 1991, is now an accepted concept for measuring information distance between two objects. Our normalized information distance (2001) has found applications in whole genome phylogeny, English document classification, plagiarism detection, google distance, and various time series classification. This research will further generalize such concepts and develop more applications. Our research has directly created a part of Canadian bioinformatics industry (BSI); our research results are, and will continue to be, used in proteomics reseaerch and pharmaceuticals to help speed up drug discovery.