linkstream2 microblog

https://www.genomeweb.com/informatics/ibm-broad-institute-cancer-study-offer-new-source-biomedical-data-drug-resistance

http://familypastimes.com/

Spatiotemporal…Protein Network Implicates Cortical…Fetal Brain Development & KCTD13…RhoA Pathway in…Diseases
http://www.sciencedirect.com/science/article/pii/S0896627315000367

dyanamic PPI w brainspan data

Spatiotemporal 16p11.2 Protein Network Implicates Cortical Late Mid-Fetal Brain Development and KCTD13-Cul3-RhoA Pathway in
Psychiatric Diseases

Guan Ning Lin1, 5,
Roser Corominas1, 5,
Irma Lemmens2,
Xinping Yang3,
Jan Tavernier2,
David E. Hill3,
Marc Vidal3,
Jonathan Sebat1, 4,
Lilia M. Iakoucheva1,

http://dx.doi.org/10.1016/j.neuron.2015.01.010

https://bioconductor.org/packages/release/bioc/html/variancePartition.html

new tool in psychencode meeting

http://www.nytimes.com/2016/11/13/business/cellphone-number-social-security-number-10-digit-key-code-to-private-life.html?ref=todayspaper&_r=0

http://www.nature.com/news/the-quiet-rise-of-the-nih-s-hot-new-metric-1.20957

http://nymag.com/vindicated/2016/11/an-idea-that-stuck-how-george-de-mestral-invented-velcro.html?mid=twitter_nymag

Is There a Safe Way to Text While Driving? Probably not but the @NavdyInc w/ headsup display tries to enable this
http://www.wsj.com/articles/review-is-there-a-safe-way-to-text-while-driving-1478107545

https://www.washingtonpost.com/news/the-fix/wp/2016/11/11/prediction-professor-who-called-trumps-big-win-also-made-another-forecast-trump-will-be-impeached/?tid=pm_politics_pop

https://en.wikipedia.org/wiki/Needleman%E2%80%93Wunsch_algorithm

relates to

https://en.wikipedia.org/wiki/Wagner%E2%80%93Fischer_algorithm

https://en.wikipedia.org/wiki/Michael_J._Fischer

QT:{{"

Historical notes and algorithm development[edit]

The original purpose of the algorithm described by Needleman and Wunsch was to find similarities in the amino acid sequences of two proteins.[1]

Needleman and Wunsch describe their algorithm explicitly for the case when the alignment is penalized solely by the matches and mismatches, and gaps have no penalty (d=0). The original publication from 1970 suggests the recursion …

A better dynamic programming algorithm with quadratic running time for the same problem (no gap penalty) was first introduced[3] by David Sankoff in 1972. Similar quadratic-time algorithms were discovered independently by T. K. Vintsyuk[4] in 1968 for speech processing ("time warping"), and by Robert A. Wagner and Michael J. Fischer[5] in 1974 for string matching.

"}}