Needleman-Wunsch and Smith-Waterman Algorithm
Bioinformatica 10-11-2011-t5-database searching
MaizeGDB: Four Usage Cases Trent Seigfried 1, Carolyn Lawrence 1, Darwin Campbell 1, Mary Polacco 2, and Volker Brendel 1 1 Iowa State University, Ames,
Approximate Spatial Query Processing Using Raster Signatures Leonardo Guerreiro Azevedo, Rodrigo Salvador Monteiro, Geraldo Zimbrão & Jano Moreira de Souza.
Replication transcription processingtranslation Molecular Analysis possible to detect and analyze DNA, RNA, and protein DNA sequence represents 'genotype'
Microarrays & Gene Expression Analysis. Contents DNA microarray technique Why measure gene expression Clustering algorithms Relation to Cancer SAGE.
MPI-INTEROPERABLE GENERALIZED ACTIVE MESSAGES Xin Zhao, Pavan Balaji, William Gropp, Rajeev Thakur University of Illinois at Urbana-Champaign Argonne National.
Scoring Matrices. Limitations to Needleman-Wunsch The problem with Needleman-Wunsch is the amount of processor memory resources it requires. Because.
Protein data bank (PDB) : 46818 structures (oct 2007) SCOP (Structural Classification Of Proteins): 971 folds (major structural similarity) 1586 super-families.
Phylogeny Driven Approaches to Genomic and Metagenomic Studies
Intro to ngs torsten seemann - peter mac - 27 jul 2012
"Phylogenomic approaches to microbial diversity" Talk by Jonathan Eisen at #IlluminaBayArea meeting