Heng Li, ingénieur computationnel

-
Bonjour,


Heng Li (Chine & U.S.A.), un contributeur essentiel à (liste partielle)

- SAMtools (des outils pour gérer des alignements d'ADN);
- BWA (un aligneur d'ADN populaire);
- MAQ (un des premiers aligneurs pour courtes séquences);
- TreeSoft;
- TreeFam

a reçu le prestigieux prix Benjamin Franklin 2012 pour son ouverture de
codes sources et pour ses articles à accès libre sur les outils auxquels
il a contribué.



Ce scientifique prolifique est dans la même catégorie que Fabrice
Bellard, un ingénieur français qui a créé (entre autres)

- LinusJS (un machine virtuel x86 codé en javascript qui roule Linux);
- Qemu (un environnement de virtualisation utilisant une traduction
dynamique de groupes de codes d'opération);
- FFmpeg (un décodeur/encodeur).


Heng Li et Fabrice Bellard sont les deux des scientifiques
computationnels.



Heng Li travaille présentement sur l'assemblage de novo comme façon de
trouver des variations.

Un de ses travaux sur ce sujet est disponible dans Arxiv:


Heng Li
Exploring single-sample SNP and INDEL calling with whole-genome de novo
assembly
arXiv.org > q-bio > arXiv:1203.6364


D'autres travaux similaires récents:


Li et al. (groupe de Jun Wang au BGI en Chine)
Structural variation in two human genomes mapped at single-nucleotide
resolution by whole genome de novo assembly
Nature Biotechnology 29, 723–730 (2011) doi:10.1038/nbt.1904



Zamin Iqbal, Mario Caccamo, Isaac Turner, Paul Flicek & Gil McVean
De novo assembly and genotyping of variants using colored de Bruijn
graphs
Nature Genetics 44, 226–232 (2012) doi:10.1038/ng.1028





Bonne lecture à toutes et à tous !


Sébastien


Tiré de la communauté de bioinformatique de l'Université Laval

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