1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
|
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2 Final//EN">
<!-- Manual page created with latex2man on Wed Feb 29 10:58:49 EST 2012 --
-- Author of latex2man: Juergen.Vollmer@informatik-vollmer.de --
-- NOTE: This file is generated, DO NOT EDIT. -->
<html>
<head><title>JELLYFISH</title></head>
<body bgcolor="white">
<h1 align=center>
Jellyfish: A fast k-mer counter
</h1>
<h4 align=center>G. Marcais and C. Kingsford </h4>
<h4 align=center>2010/10/1</h4>
<h4 align=center>Version 1.1.4</h4>
<p>
<tt>Jellyfish</tt>
is a software to count k-mers in DNA sequences.
<p>
<h3>Table of Contents</h3>
<ul>
<li><a href="#section_1">Synopsis </a></li>
<li><a href="#section_2">Description </a>
<ul>
<li><a href="#section_3">Counting and merging </a></li>
<li><a href="#section_4">Orientation </a></li>
<li><a href="#section_5">Choosing the hash size </a></li>
<li><a href="#section_6">Choosing the counting field size </a></li>
</ul>
<li><a href="#section_7">Subcommands and options </a>
<ul>
<li><a href="#section_8">count </a></li>
<li><a href="#section_9">stats </a></li>
<li><a href="#section_10">histo </a></li>
<li><a href="#section_11">dump </a></li>
<li><a href="#section_12">merge </a></li>
<li><a href="#section_13">query </a></li>
<li><a href="#section_14">qhisto </a></li>
<li><a href="#section_15">qdump </a></li>
<li><a href="#section_16">qmerge </a></li>
<li><a href="#section_17">cite </a></li>
</ul>
<li><a href="#section_18">Version </a></li>
<li><a href="#section_19">Bugs </a></li>
<li><a href="#section_20">Copyright & License </a></li>
<li><a href="#section_21">Authors </a></li>
</ul>
<p>
<h2><a name="section_1">Synopsis</a></h2>
<tt>jellyfish count</tt>
[<b>-o</b><i>prefix</i>]
[<b>-m</b><i>merlength</i>]
[<b>-t</b><i>threads</i>]
[<b>-s</b><i>hashsize</i>]
[<b>--both-strands</b>]
<i>fasta</i>
[<i>fasta ...</i>]
<br>
<tt>jellyfish merge</tt>
<i>hash1</i>
<i>hash2</i>
...<br>
<tt>jellyfish dump</tt>
<i>hash</i>
<br>
<tt>jellyfish stats</tt>
<i>hash</i>
<br>
<tt>jellyfish histo</tt>
[<b>-h</b><i>high</i>]
[<b>-l</b><i>low</i>]
[<b>-i</b><i>increment</i>]
<i>hash</i>
<br>
<tt>jellyfish query</tt>
<i>hash</i>
<br>
<tt>jellyfish cite</tt>
<br>
<p>
Plus equivalent version for <tt>Quake</tt>
mode: <tt>qhisto</tt>,
<tt>qdump</tt>
and <tt>qmerge</tt>.
<p>
<h2><a name="section_2">Description</a></h2>
<p>
<tt>Jellyfish</tt>
is a k-mer counter based on a multi-threaded hash
table implementation.
<p>
<h4><a name="section_3">Counting and merging</a></h4>
<p>
To count k-mers, use a command like:
<p>
<pre>
jellyfish count -m 22 -o output -c 3 -s 10000000 -t 32 input.fasta
</pre>
<p>
This will count the the 22-mers in input.fasta with 32 threads. The
counter field in the hash uses only 3 bits and the hash has at least
10 million entries.
<p>
The output files will be named output_0, output_1, etc. (the prefix
is specified with the <b>-o</b>
switch). If the hash is large enough
(has specified by the <b>-s</b>
switch) to fit all the k-mers, there
will be only one output file named output_0. If the hash filled up
before all the mers were read, the hash is dumped to disk, zeroed out
and reading in mers resumes. Multiple intermediary files will be
present on the disks, named output_0, output_1, etc.
<p>
To obtain correct results from the other sub-commands (such as histo,
stats, etc.), the multiple output files, if any, need to be merged into one
with the merge command. For example with the following command:
<p>
<pre>
jellyfish merge -o output.jf output\_*
</pre>
<p>
Should you get many intermediary output files (say hundreds), the size
of the hash table is too small. Rerunning <tt>Jellyfish</tt>
with a
larger size (option <b>-s</b>)
is probably faster than merging all the
intermediary files.
<p>
<h4><a name="section_4">Orientation</a></h4>
When the orientation of the sequences in the input fasta file is not
known, e.g. in sequencing reads, using <b>--both-strands</b>
(<b>-C</b>)
makes the most sense.
<p>
For any k-mer m, its canonical representation is m itself or its
reverse-complement, whichever comes first lexicographically. With the
option <b>-C</b>,
only the canonical representation of the mers are
stored in the hash and the count value is the number of occurrences of
both the mer and its reverse-complement.
<p>
<h4><a name="section_5">Choosing the hash size</a></h4>
<p>
To achieve the best performance, a minimum number of intermediary
files should be written to disk. So the parameter <b>-s</b>
should be
chosen to fit as many k-mers as possible (ideally all of them) while
still fitting in memory.
<p>
We consider to examples: counting mers in sequencing reads and in a
finished genome.
<p>
First, suppose we count k-mers in short sequencing reads:
there are n reads and there is an average of 1 error per reads where
each error generates k unique mers. If the genome size is G, the
size of the hash (option <b>-s</b>)
to fit all k-mers at once is estimated to: $(G +
k*n)/0.8$. The division by 0.8 compensates for the maximum usage of
approximately $80%$ of the hash table.
<p>
On the other hand, when counting k-mers in an assembled sequence of
length G, setting <b>-s</b>
to G is appropriate.
<p>
As a matter of convenience, Jellyfish understands ISO suffixes for the
size of the hash. Hence '-s 10M' stands 10 million entries while '-s
50G' stands for 50 billion entries.
<p>
The actual memory usage of the hash table can be computed as
follow. The actual size of the hash will be rounded up to the next
power of 2: s=2^l. The parameter r is such that the maximum
reprobe value (<b>-p</b>)
plus one is less than 2^r. Then the memory usage per
entry in the hash is (in bits, not bytes) 2k-l+r+1. The total memory
usage of the hash table in bytes is: 2^l*(2k-l+r+1)/8.
<p>
<h4><a name="section_6">Choosing the counting field size</a></h4>
To save space, the hash table supports variable length counter, i.e. a
k-mer occurring only a few times will use a small counter, a k-mer
occurring many times will used multiple entries in the hash.
<p>
Important: the size of the couting field does NOT change the result,
it only impacts the amount of memory used. In particular, there is no
maximum value in the hash. Even if the counting field uses 5 bits, a
k-mer occuring 2 million times will have a value reported of 2
million (i.e., it is not capped at 2^5).
<p>
The <b>-c</b>
specify the length (in bits) of the counting field. The
trade off is as follows: a low value will save space per entry in the
hash but can potentially increase the number of entries used, hence
maybe requiring a larger hash.
<p>
In practice, use a value for <b>-c</b>
so that most of you k-mers
require only 1 entry. For example, to count k-mers in a genome,
where most of the sequence is unique, use <b>-c</b><i>1</i>
or
<b>-c</b><i>2</i>.
For sequencing reads, use a value for <b>-c</b>
large
enough to counts up to twice the coverage. For example, if the
coverage is 10X, choose a counter length of 5 (<b>-c</b><i>5</i>)
as $2^5 > 20$.
<p>
<h2><a name="section_7">Subcommands and options</a></h2>
<h4><a name="section_8">count</a></h4>
Usage: jellyfish count [options] file:path+
<p>
Count k-mers or qmers in fasta or fastq files
<p>
Options (default value in (), *required):
<dl compact>
<dt><b>-m</b>,
<b>--mer-len</b><i>=uint32</i>
</dt>
<dd> *Length of mer
</dd>
<dt><b>-s</b>,
<b>--size</b><i>=uint64</i>
</dt>
<dd> *Hash size
</dd>
<dt><b>-t</b>,
<b>--threads</b><i>=uint32</i>
</dt>
<dd> Number of threads (1)
</dd>
<dt><b>-o</b>,
<b>--output</b><i>=string</i>
</dt>
<dd> Output prefix (mer_counts)
</dd>
<dt><b>-c</b>,
<b>--counter-len</b><i>=Length</i>
</dt>
<dd> in bits Length of counting field (7)
</dd>
<dt><b>--out-counter-len</b><i>=Length</i>
</dt>
<dd> in bytes Length of counter field in output (4)
</dd>
<dt><b>-C</b>,<b>--both-strands</b>
</dt>
<dd> Count both strand, canonical representation (false)
</dd>
<dt><b>-p</b>,
<b>--reprobes</b><i>=uint32</i>
</dt>
<dd> Maximum number of reprobes (62)
</dd>
<dt><b>-r</b>,<b>--raw</b>
</dt>
<dd> Write raw database (false)
</dd>
<dt><b>-q</b>,<b>--quake</b>
</dt>
<dd> Quake compatibility mode (false)
</dd>
<dt><b>--quality-start</b><i>=uint32</i>
</dt>
<dd> Starting ASCII for quality values (64)
</dd>
<dt><b>--min-quality</b><i>=uint32</i>
</dt>
<dd> Minimum quality. A base with lesser quality becomes an N (0)
</dd>
<dt><b>-L</b>,
<b>--lower-count</b><i>=uint64</i>
</dt>
<dd> Don't output k-mer with count < lower-count
</dd>
<dt><b>-U</b>,
<b>--upper-count</b><i>=uint64</i>
</dt>
<dd> Don't output k-mer with count > upper-count
</dd>
<dt><b>--matrix</b><i>=Matrix</i>
</dt>
<dd> file Hash function binary matrix
</dd>
<dt><b>--timing</b><i>=Timing</i>
</dt>
<dd> file Print timing information
</dd>
<dt><b>--stats</b><i>=Stats</i>
</dt>
<dd> file Print stats
</dd>
<dt><b>--usage</b>
</dt>
<dd> Usage
</dd>
<dt><b>-h</b>,<b>--help</b>
</dt>
<dd> This message
</dd>
<dt><b>--full-help</b>
</dt>
<dd> Detailed help
</dd>
<dt><b>-V</b>,<b>--version</b>
</dt>
<dd> Version
</dd>
</dl>
<p>
<h4><a name="section_9">stats</a></h4>
Usage: jellyfish stats [options] db:path
<p>
Statistics
<p>
Display some statistics about the k-mers in the hash:
<p>
Unique: Number of k-mers which occur only once.
Distinct: Number of k-mers, not counting multiplicity.
Total: Number of k-mers, including multiplicity.
Max_count: Maximum number of occurrence of a k-mer.
<p>
Options (default value in (), *required):
<dl compact>
<dt><b>-L</b>,
<b>--lower-count</b><i>=uint64</i>
</dt>
<dd> Don't consider k-mer with count < lower-count
</dd>
<dt><b>-U</b>,
<b>--upper-count</b><i>=uint64</i>
</dt>
<dd> Don't consider k-mer with count > upper-count
</dd>
<dt><b>-v</b>,<b>--verbose</b>
</dt>
<dd> Verbose (false)
</dd>
<dt><b>-o</b>,
<b>--output</b><i>=string</i>
</dt>
<dd> Output file
</dd>
<dt><b>--usage</b>
</dt>
<dd> Usage
</dd>
<dt><b>-h</b>,<b>--help</b>
</dt>
<dd> This message
</dd>
<dt><b>--full-help</b>
</dt>
<dd> Detailed help
</dd>
<dt><b>-V</b>,<b>--version</b>
</dt>
<dd> Version
</dd>
</dl>
<p>
<h4><a name="section_10">histo</a></h4>
Usage: jellyfish histo [options] db:path
<p>
Create an histogram of k-mer occurrences
<p>
Create an histogram with the number of k-mers having a given
count. In bucket 'i' are tallied the k-mers which have a count 'c'
satisfying 'low+i*inc <= c < low+(i+1)*inc'. Buckets in the output are
labeled by the low end point (low+i*inc).
<p>
The last bucket in the output behaves as a catchall: it tallies all
k-mers with a count greater or equal to the low end point of this
bucket.
<p>
Options (default value in (), *required):
<dl compact>
<dt><b>-l</b>,
<b>--low</b><i>=uint64</i>
</dt>
<dd> Low count value of histogram (1)
</dd>
<dt><b>-h</b>,
<b>--high</b><i>=uint64</i>
</dt>
<dd> High count value of histogram (10000)
</dd>
<dt><b>-i</b>,
<b>--increment</b><i>=uint64</i>
</dt>
<dd> Increment value for buckets (1)
</dd>
<dt><b>-t</b>,
<b>--threads</b><i>=uint32</i>
</dt>
<dd> Number of threads (1)
</dd>
<dt><b>-f</b>,<b>--full</b>
</dt>
<dd> Full histo. Don't skip count 0. (false)
</dd>
<dt><b>-o</b>,
<b>--output</b><i>=string</i>
</dt>
<dd> Output file
</dd>
<dt><b>-v</b>,<b>--verbose</b>
</dt>
<dd> Output information (false)
</dd>
<dt><b>--usage</b>
</dt>
<dd> Usage
</dd>
<dt><b>--help</b>
</dt>
<dd> This message
</dd>
<dt><b>--full-help</b>
</dt>
<dd> Detailed help
</dd>
<dt><b>-V</b>,<b>--version</b>
</dt>
<dd> Version
</dd>
</dl>
<p>
<h4><a name="section_11">dump</a></h4>
Usage: jellyfish dump [options] db:path
<p>
Dump k-mer counts
<p>
By default, dump in a fasta format where the header is the count and
the sequence is the sequence of the k-mer. The column format is a 2
column output: k-mer count.
<p>
Options (default value in (), *required):
<dl compact>
<dt><b>-c</b>,<b>--column</b>
</dt>
<dd> Column format (false)
</dd>
<dt><b>-t</b>,<b>--tab</b>
</dt>
<dd> Tab separator (false)
</dd>
<dt><b>-L</b>,
<b>--lower-count</b><i>=uint64</i>
</dt>
<dd> Don't output k-mer with count < lower-count
</dd>
<dt><b>-U</b>,
<b>--upper-count</b><i>=uint64</i>
</dt>
<dd> Don't output k-mer with count > upper-count
</dd>
<dt><b>-o</b>,
<b>--output</b><i>=string</i>
</dt>
<dd> Output file
</dd>
<dt><b>--usage</b>
</dt>
<dd> Usage
</dd>
<dt><b>-h</b>,<b>--help</b>
</dt>
<dd> This message
</dd>
<dt><b>-V</b>,<b>--version</b>
</dt>
<dd> Version
</dd>
</dl>
<p>
<h4><a name="section_12">merge</a></h4>
Usage: jellyfish merge [options] input:string+
<p>
Merge jellyfish databases
<p>
Options (default value in (), *required):
<dl compact>
<dt><b>-s</b>,
<b>--buffer-size</b><i>=Buffer</i>
</dt>
<dd> length Length in bytes of input buffer (10000000)
</dd>
<dt><b>-o</b>,
<b>--output</b><i>=string</i>
</dt>
<dd> Output file (mer_counts_merged.jf)
</dd>
<dt><b>--out-counter-len</b><i>=uint32</i>
</dt>
<dd> Length (in bytes) of counting field in output (4)
</dd>
<dt><b>--out-buffer-size</b><i>=uint64</i>
</dt>
<dd> Size of output buffer per thread (10000000)
</dd>
<dt><b>-v</b>,<b>--verbose</b>
</dt>
<dd> Be verbose (false)
</dd>
<dt><b>--usage</b>
</dt>
<dd> Usage
</dd>
<dt><b>-h</b>,<b>--help</b>
</dt>
<dd> This message
</dd>
<dt><b>-V</b>,<b>--version</b>
</dt>
<dd> Version
</dd>
</dl>
<p>
<h4><a name="section_13">query</a></h4>
Usage: jellyfish query [options] db:path
<p>
Query from a compacted database
<p>
Query a hash. It reads k-mers from the standard input and write the counts on the standard output.
<p>
Options (default value in (), *required):
<dl compact>
<dt><b>-C</b>,<b>--both-strands</b>
</dt>
<dd> Both strands (false)
</dd>
<dt><b>-c</b>,<b>--cary-bit</b>
</dt>
<dd> Value field as the cary bit information (false)
</dd>
<dt><b>-i</b>,
<b>--input</b><i>=file</i>
</dt>
<dd> Input file
</dd>
<dt><b>-o</b>,
<b>--output</b><i>=file</i>
</dt>
<dd> Output file
</dd>
<dt><b>--usage</b>
</dt>
<dd> Usage
</dd>
<dt><b>-h</b>,<b>--help</b>
</dt>
<dd> This message
</dd>
<dt><b>-V</b>,<b>--version</b>
</dt>
<dd> Version
</dd>
</dl>
<p>
<h4><a name="section_14">qhisto</a></h4>
Usage: jellyfish qhisto [options] db:string
<p>
Create an histogram of k-mer occurences
<p>
Options (default value in (), *required):
<dl compact>
<dt><b>-l</b>,
<b>--low</b><i>=double</i>
</dt>
<dd> Low count value of histogram (0.0)
</dd>
<dt><b>-h</b>,
<b>--high</b><i>=double</i>
</dt>
<dd> High count value of histogram (10000.0)
</dd>
<dt><b>-i</b>,
<b>--increment</b><i>=double</i>
</dt>
<dd> Increment value for buckets (1.0)
</dd>
<dt><b>-f</b>,<b>--full</b>
</dt>
<dd> Full histo. Don't skip count 0. (false)
</dd>
<dt><b>--usage</b>
</dt>
<dd> Usage
</dd>
<dt><b>--help</b>
</dt>
<dd> This message
</dd>
<dt><b>-V</b>,<b>--version</b>
</dt>
<dd> Version
</dd>
</dl>
<p>
<h4><a name="section_15">qdump</a></h4>
Usage: jellyfish qdump [options] db:path
<p>
Dump k-mer from a qmer database
<p>
By default, dump in a fasta format where the header is the count and
the sequence is the sequence of the k-mer. The column format is a 2
column output: k-mer count.
<p>
Options (default value in (), *required):
<dl compact>
<dt><b>-c</b>,<b>--column</b>
</dt>
<dd> Column format (false)
</dd>
<dt><b>-t</b>,<b>--tab</b>
</dt>
<dd> Tab separator (false)
</dd>
<dt><b>-L</b>,
<b>--lower-count</b><i>=double</i>
</dt>
<dd> Don't output k-mer with count < lower-count
</dd>
<dt><b>-U</b>,
<b>--upper-count</b><i>=double</i>
</dt>
<dd> Don't output k-mer with count > upper-count
</dd>
<dt><b>-v</b>,<b>--verbose</b>
</dt>
<dd> Be verbose (false)
</dd>
<dt><b>-o</b>,
<b>--output</b><i>=string</i>
</dt>
<dd> Output file
</dd>
<dt><b>--usage</b>
</dt>
<dd> Usage
</dd>
<dt><b>-h</b>,<b>--help</b>
</dt>
<dd> This message
</dd>
<dt><b>-V</b>,<b>--version</b>
</dt>
<dd> Version
</dd>
</dl>
<p>
<h4><a name="section_16">qmerge</a></h4>
Usage: jellyfish merge [options] db:string+
<p>
Merge quake databases
<p>
Options (default value in (), *required):
<dl compact>
<dt><b>-s</b>,
<b>--size</b><i>=uint64</i>
</dt>
<dd> *Merged hash table size
</dd>
<dt><b>-m</b>,
<b>--mer-len</b><i>=uint32</i>
</dt>
<dd> *Mer length
</dd>
<dt><b>-o</b>,
<b>--output</b><i>=string</i>
</dt>
<dd> Output file (merged.jf)
</dd>
<dt><b>-p</b>,
<b>--reprobes</b><i>=uint32</i>
</dt>
<dd> Maximum number of reprobes (62)
</dd>
<dt><b>--usage</b>
</dt>
<dd> Usage
</dd>
<dt><b>-h</b>,<b>--help</b>
</dt>
<dd> This message
</dd>
<dt><b>--full-help</b>
</dt>
<dd> Detailed help
</dd>
<dt><b>-V</b>,<b>--version</b>
</dt>
<dd> Version
</dd>
</dl>
<p>
<h4><a name="section_17">cite</a></h4>
Usage: jellyfish cite [options]
<p>
How to cite Jellyfish's paper
<p>
Citation of paper
<p>
Options (default value in (), *required):
<dl compact>
<dt><b>-b</b>,<b>--bibtex</b>
</dt>
<dd> Bibtex format (false)
</dd>
<dt><b>-o</b>,
<b>--output</b><i>=string</i>
</dt>
<dd> Output file
</dd>
<dt><b>--usage</b>
</dt>
<dd> Usage
</dd>
<dt><b>-h</b>,<b>--help</b>
</dt>
<dd> This message
</dd>
<dt><b>-V</b>,<b>--version</b>
</dt>
<dd> Version
</dd>
</dl>
<p>
<h2><a name="section_18">Version</a></h2>
<p>
Version: 1.1.4 of 2010/10/1
<p>
<h2><a name="section_19">Bugs</a></h2>
<p>
<ul compact>
<li><tt>jellyfish merge</tt> has not been parallelized and is
relatively slow.
</li>
<li>The hash table does not grow in memory automatically and
<tt>jellyfish merge</tt>
is not called automatically on the
intermediary files (if any).
</li>
</ul>
<p>
<h2><a name="section_20">Copyright & License</a></h2>
<dl compact>
<dt>Copyright</dt>
<dd> © 2010, Guillaume Marcais <a href ="mailto:guillaume@marcais.net"><tt>guillaume@marcais.net</tt></a>
and Carl Kingsford <a href ="mailto:carlk@umiacs.umd.edu"><tt>carlk@umiacs.umd.edu</tt></a>.
<p>
</dd>
<dt>License</dt>
<dd> This program is free software: you can redistribute it
and/or modify it under the terms of the GNU General Public License
as published by the Free Software Foundation, either version 3 of
the License, or (at your option) any later version. <br>
This program is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
General Public License for more details. <br>
You should have received a copy of the GNU General Public License
along with this program. If not, see
<a href ="http://www.gnu.org/licenses/"><tt>http://www.gnu.org/licenses/</tt></a>.
</dd>
</dl>
<p>
<h2><a name="section_21">Authors</a></h2>
Guillaume Marcais <br>
University of Maryland <br>
<a href ="mailto:gmarcais@umd.edu"><tt>gmarcais@umd.edu</tt></a>
<p>
Carl Kingsford <br>
University of Maryland <br>
<a href ="mailto:carlk@umiacs.umd.edu"><tt>carlk@umiacs.umd.edu</tt></a>
<p>
</body>
</html>
<!-- NOTE: This file is generated, DO NOT EDIT. -->
|
