As configured in my dotfiles.
start new:
tmux
start new with session name:
| function [maxtab, mintab]=peakdet(v, delta, x) | |
| %PEAKDET Detect peaks in a vector | |
| % [MAXTAB, MINTAB] = PEAKDET(V, DELTA) finds the local | |
| % maxima and minima ("peaks") in the vector V. | |
| % MAXTAB and MINTAB consists of two columns. Column 1 | |
| % contains indices in V, and column 2 the found values. | |
| % | |
| % With [MAXTAB, MINTAB] = PEAKDET(V, DELTA, X) the indices | |
| % in MAXTAB and MINTAB are replaced with the corresponding | |
| % X-values. | 
| #!/usr/bin/python2 | |
| # Copyright (C) 2016 Sixten Bergman | |
| # License WTFPL | |
| # | |
| # This program is free software. It comes without any warranty, to the extent | |
| # permitted by applicable law. | |
| # You can redistribute it and/or modify it under the terms of the Do What The | |
| # Fuck You Want To Public License, Version 2, as published by Sam Hocevar. See | 
| javascript: void(function(){document.addEventListener("mousedown", tcoToLinkTitleURL, true); function tcoToLinkTitleURL(ev) { var target = ev.target; if(/^http(?:s?):\/\/t.co\//.test(target.href)) target.href=target.title; } }()); | 
As configured in my dotfiles.
start new:
tmux
start new with session name:
| git fetch upstream | |
| git reset --hard upstream/master | 
Using Python's built-in defaultdict we can easily define a tree data structure:
def tree(): return defaultdict(tree)That's it!
| #!/usr/bin/env sh | |
| ## | |
| # This is script with usefull tips taken from: | |
| # https://github.com/mathiasbynens/dotfiles/blob/master/.osx | |
| # | |
| # install it: | |
| # curl -sL https://raw.github.com/gist/2108403/hack.sh | sh | |
| # | 
| #!/bin/bash | |
| # Usage: deinterleave_fastq.sh < interleaved.fastq f.fastq r.fastq [compress] | |
| # | |
| # Deinterleaves a FASTQ file of paired reads into two FASTQ | |
| # files specified on the command line. Optionally GZip compresses the output | |
| # FASTQ files using pigz if the 3rd command line argument is the word "compress" | |
| # | |
| # Can deinterleave 100 million paired reads (200 million total | |
| # reads; a 43Gbyte file), in memory (/dev/shm), in 4m15s (255s) | |
| # | 
| loadings = pca.components_ | |
| # I've omitted the code to create ind; a list of the indexes of the | |
| # loadings ordered by distance from origin. | |
| plt.scatter(*loadings, alpha=0.3, label="Loadings"); | |
| plt.scatter(*loadings[:, ind[:3]], c='r', marker='o', | |
| s=80, linewidths=1, facecolors="none", | |
| edgecolors='r', | |
| label="Contributes most\nto variance"); |