Galaxy | Tool Preview

Pear (version 0.9.6.2)
-f
-r
If the computed p-value of a possible assembly exceeds the specified p-value then the paired-end read will not be assembled. Setting 1.0 disables the test. (--p-value)
The minimum overlap may be set to 1 when the statistical test is used. However, further restricting the minimum overlap size to a proper value may reduce false-positive assembles. (--min-overlap)
Setting this value to 0 disables the restriction and assembled sequences may be arbitrary long. (--max-assembly-length)
Setting this value to 0 disables the restriction and assembled sequences may be arbitrary short. (--min-assembly-length)
See option -q. (--min-trim-length)
If the quality scores of two consecutive bases are strictly less than the specified threshold, the rest of the read will be trimmed. (--quality-threshold)
Setting this value to 0 will cause PEAR to discard all reads containing uncalled bases. The other extreme setting is 1 which causes PEAR to process all reads independent on the number of uncalled bases. (--max-uncalled-base)
If set to zero, capping is disabled. (--cap)
(--test-method)
(--empirical-freqs)
When merging a base-pair that consists of two non-equal bases out of which none is degenerate, set the merged base to N and use the highest quality score of the two bases. (--nbase)
(--score-method)

What it does

PEAR is an ultrafast, memory-efficient and highly accurate pair-end read merger. PEAR evaluates all possible paired-end read overlaps and without requiring the target fragment size as input. In addition, it implements a statistical test for minimizing false-positive results. Together with a highly optimized implementation, it can merge millions of paired end reads within a couple of minutes on a standard desktop computer.

For more information please look at the documentation and github repository.

Please note that PEAR is released under the [CC Attribution-NonCommercial-ShareAlike](https://creativecommons.org/licenses/by-nc-sa/3.0/) license and that commercial partners should obtain a license.