[club] Méthode "masked seeds" et motifs de protéines

- 

Bonjour,

Cette semaine au club de lecture, Sébastien Boisvert présentera deux 
articles
(15 minutes de présentation par article).

Le premier, publié en 2002 dans Bioinformatics et cité 546 fois, 
présente les "masked seeds"
pour améliorer l'indexage pour les alignements. Ce principe est utilisé 
dans le logiciel Eland d'Illumina,
le logiciel Maq de Heng Li et beaucoup d'autres outils importants actuels.

Bin Ma, John Tromp and Ming Li PatternHunter: faster and more sensitive 
homology search Bioinformatics (2002) 18 (3): 440-445.
http://bioinformatics.oxfordjournals.org/content/18/3/440


Le deuxième est paru en 2003 dans Nature Genetics et écrit par le groupe 
de Albert-László Barabási.
Cet article, qui est cité 290 fois, montre empiriquement que le graphe 
d'interactions protéine-protéine chez une levure
contient beaucoup de motifs topologiques. Albert-László Barabási est un 
des fondateurs de la science des réseaux.

S. Wuchty, Z. N. Oltvai, A.-L. Barabási Evolutionary conservation of 
motif constituents in the yeast protein interaction network Nature 
Genetics 35, 176-179 (2003).
http://www.nature.com/ng/journal/v35/n2/full/ng1242.html


Lieu: Local R-5701, Bloc R, Centre de recherche du CHUQ 2705, boulevard 
Laurier Québec, Québec Canada, G1V 4G2

Horaire: Tous les mercredis à partir du 18 janvier 2012, de 12h à 13h00 
et ce jusqu'au 27 juin 2012 excluant le mercredi 21 mars 2012.



Voir http://genome.ulaval.ca/corbeillab/club.html#2012calendrier

Comments

Post a Comment

Popular posts from this blog

A survey of the burgeoning industry of cloud genomics

-
Image
I like lists. Here is a list of companies in the cloud genomics industry. Table 1: Companies acting in the industry of cloud genomics. The list is in no particular order. Company Products People Founded Link GenoSpace, LLC - GenoSpace platform - John Quackenbush (CEO) 2011 https://www.genospace.com/ DNAnexus, Inc. - DNAnexus Platform - DNAnexus Platform SDK (a.k.a. dx-toolkit) - Serafim Batzoglou (co-founder) - Andreas Sundquist (co-founder and CTO) - a bunch of other famous people in the field 2009 https://dnanexus.com/ Seven Bridges Genomics, Inc. - IGOR - IGOR Python SDK - Igor Bogicevic (CTO) 2009 https://www.sbgenomics.com/ BGI - EasyGenomics - Xing Xu (Senior Product Manager) Introduced in 2012 https://www.easygenomics.com/ Illumina, Inc. - BaseSpace™ - BaseSpace API - Alex Dickinson (SVP of Cloud Genomics) Introduced in 2011 https://basespace.illumina.com/ Era7 Information Technologies SLU - BG7...
Read more

Generating neural machine instructions for multi-head attention

-
  An animal can do training and inference every day of its existence until the day of its death. A forward pass is all you need.   Here is the current model configuration that I use for multi-head attention:         let sequence_length = 6;         let vocab_size = 20;         let n_embd = 64;         let num_heads = 8; You can see the full model here: https://github.com/sebhtml/novigrad/blob/8df6192829edd9cda3a221e12affa770fbda2a1b/src/models/mega_man_attention.rs The struct uses Embedding, MultiHeadAttention, Linear, Softmax: struct MegaManAttentionModel {     input_shape: Vec<usize>,     output_shape: Vec<usize>,     vocab_size: usize,     sequence_length: usize,     embedding: Embedding,     multi_head_attention: MultiHeadAttention, ...
Read more

Learning to solve the example 1 of puzzle 3aa6fb7a in the ARC prize

-
Image
Hi dear reader, Puzzle rules The example 1 of the puzzle 3aa6fb7a of the ARC prize looks like this: A playout starts with an blank board of width 7 and of height 7. There are therefore 49 cells. Each cell can be blank or can contain one of the 10 possible colors. The colors are identified from 0 to 9.  I added a rule. This rule is that each cell has to be changed exactly once.  The game ends when all cells have been changed. The player wins if all the cell colors match the cell colors in the expected output. Some numbers: Each cell has 11 possible values: 10 colors + blank state There are 49! ( 6.0828186e+62) distinct possible orders of cell changes in a playout.  There are 49!*10 ( 6.0828186e+63) 49 * 10 = 490 possible actions for the first action.  There are 11^49 ( 1.0671896e+51) possible board states The number of possible pairs (s, a) is even larger and upper-bounded by 11^49 * 49 * 10 = 5.2292289e+53 . Given a board state s and a proposed action a, an actio...
Read more