nvictus

#!/usr/bin/env python
import hashlib
import os.path as op
import os
import re
import warnings
from contextlib import closing
from urllib.parse import urlsplit
from urllib.request import urlopen

nvictus

// Client-side parser for .npy files
// See the specification: http://docs.scipy.org/doc/numpy-dev/neps/npy-format.html
var NumpyLoader = (function () {
    function asciiDecode(buf) {
        return String.fromCharCode.apply(null, new Uint8Array(buf));
    }

    function readUint16LE(buffer) {
        var view = new DataView(buffer);
        var val = view.getUint8(0);

nvictus

"""Run Length Encoding utilities for NumPy arrays.

Authors
-------
- Nezar Abdennur
- Anton Goloborodko

"""
from __future__ import division, print_function
import numpy as np

nvictus

nvictus

nvictus

from pqdict import pqdict


def dijkstra(graph, source, target=None):
    dist = {}  # lengths of the shortest paths to each node
    pred = {}  # predecessor node in each shortest path

    # Store distance scores in a priority queue dictionary
    pq = pqdict.minpq()
    for node in graph:

nvictus

#!/usr/bin/env python
# -*- coding: utf-8 -*-
import subprocess
import tempfile
import requests
import argparse
import textwrap
import sys

nvictus

import numpy as np


def ou_approx(t, theta=0.15, sigma=0.2, x0=0, xm=0):
    """
    Ornstein-Uhlenbeck process sampled using an approximate updating formula, first-order in the time step.
    
    The approximation gets worse as the time steps get larger.
    
    Parameters

nvictus

# Notes
# -----
# * Cooler's stored bin IDs are 0-based. However, for consistency with R, this API should take 
#   1-based indexing as input for table row and matrix range queries.
# * See Ilya's implementation: https://github.com/dozmorovlab/HiCcompare/issues/9
library(hdf5r)
library(dplyr)
library(tibble)
library(purrr)
library(data.table)

nvictus

Keybase proof

I hereby claim:

• I am nvictus on github.
• I am nvictus (https://keybase.io/nvictus) on keybase.
• I have a public key ASD5ZCiGIU56jaoWB80la1wXlnkF_bnTkhPPU21ajb-5eQo

To claim this, I am signing this object: