-
-
node-collection
... compare function
function compareFunc(k1, k2) {
return k1 - k2;
}
var treemap = new TreeMap(compareFunc);
treemap.put(1101, {value: "This is a test blob."});
console.log(treemap.get(1101));
var submap = treemap.tailMap(1000 ...
-
qt_clust
... Exploring expression data:
Identification and analysis of coexpressed genes. Genome Research, 9:1106-1115,
1999. http://dx.doi.org/10.1101/gr.9.11.1106
The R implementation of the original algorithm is part of the CRAN package
flexclust: http://cran.r ...
-
illumina2bam
... /Data/Intensities LANE=1 OUTPUT=testdata/6000_1.bam VALIDATION_STRINGENCY=STRICT CREATE_INDEX=false CREATE_MD5_FILE=true FIRST_TILE=1101 TILE_LIMIT=1 COMPRESSION_LEVEL=1
HELP:
java -jar "Illumina2bam.jar" -h
USAGE: Illumina2bam [options]
Convert ...
-
99problems
... symbol S. In our example, the result could be Hs = [hc(a,'0'), hc(b,'101'), hc(c,'100'), hc(d,'111'), hc(e,'1101'), hc(f,'1100')] [hc(a,'01'),...etc.]. The task shall be performed by the predicate huffman/2 defined as follows:
% huffman(Fs,Hs) :- ...
-
reconstruct-1101
Source code for Reconstruct version 1.1.0.1 from: http://tech.groups.yahoo.com/group/reconstruct_developers/files/
// Reconstruct: version 1.1.0.0 //
--------------------------------------------------------------------------------
Files of the ...
-
illumina-utils
... r1=2;r2=0|Q30:p,77;p,72|mismatches:2
[...]ggtagatggaatataacatgtagcggtgaaatGctTagatatgttatggaacaccgattgcgaaggcagtctactaagtcgatattgacgctgaggcacgaaagcgtgggtagcgaacag[...]
>M01028:4:000000000-A1Y0P:1:1101:18231:1947 1:N:0:1|o:86|m/o:0.058140|MR:n=0;r1 ...
-
polycube-solver
... but only the four flat ones fit in the box, each in four positions. The orientations are expressed as different bit patterns: 1101, 11001, 1011, and 10011.
The V-shaped pentacube is denoted by the last column. It is locked to one orientation, and only ...
-
shrimp
... Li H., Ruan J., Durbin R.,
"Mapping short DNA sequencing reads and calling variants using mapping quality
scores" doi: 10.1101/gr.078212.108.
For paired reads, a more elaborate computation is performed. Mappings are placed
into three classes: paired, ...
-
seqbdd
...
01
0
1001
100
101001
10100
1010
101
10
1101001
110100
11010
1101
110
11
1
ok
11> seqbdd:multi_build(["0","01","010","01001"," ...
1010101
101010
10101
1010
1011010
101101
10110
1011
101
10
11010
1101
110
11
1
ok
48> seqbdd:delete(). %Delete ETS for SeqBDD
...
-
qxalign3
... with asw_* prefix implement asymmetric Smith- Waterman-like algorithm
with inverse scores (URL: http://dx.doi.org/10.1101/gr.6468307)
.. code-block:: python
>>> from qxalign import Qxalign
...
>>> q = Qxalign()
>>> q.prepare("AAAACGT", ...
-