Skip to content

Commit 4ca6452

Browse files
author
Leszek Pryszcz
committed
docs
1 parent ed0c787 commit 4ca6452

File tree

2 files changed

+5
-3
lines changed

2 files changed

+5
-3
lines changed

README.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -29,7 +29,7 @@ so it can be run even on the laptop for small-to-medium size genomes
2929
- **flexible** toward many sequencing technologies (Illumina, 454 or Sanger) and library types (paired-end, mate pairs, fosmids)
3030
- **modular**: every step can be ommited or replaced by another tools
3131

32-
For more information have a look at the [poster](/docs/poster.pdf) or [manuscript](/docs/manuscript.pdf).
32+
For more information have a look at the [documentation](/docs), [poster](/docs/poster.pdf) or [manuscript](/docs/manuscript.pdf).
3333

3434
![Flowchart](/docs/redundans_flowchart.png)
3535

docs/README.md

Lines changed: 4 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,6 @@
22
- **[Redundans docs](#redundans-docs)**
33
- **[FAQ](#faq)**
44
- **[FAQ - INSTALL.sh](#faq---installsh)**
5-
- **[Citation](#citation)**
65

76
# Redundans docs
87

@@ -56,7 +55,7 @@ IOError: [Errno 2] No such file or directory: '.../test/run11/_sspace.1.1.fa'
5655
### Why does Redundans use two similarity search algorithms, [BLAT](https://genome.ucsc.edu/FAQ/FAQblat.html#blat3) & [LAST](http://last.cbrc.jp/)?
5756
BLAT is lightweight & very fast, but lack sensitivity for more diverged sequences. If you specify `--identity` below 0.85, the pipeline will use LAST, that is ~4x slower, but more sensitive than BLAT.
5857
Our simulations shows LAST is capable of correctly reducing heterozygous assemblies with up to 45% divergence between haplotypes.
59-
To limit speed difference between these two algorithms, LAST **runs in multiple threads**, so using `-t 4` you shouldn't see any difference in runtime between runs for `--identity 0.9` or `--identity 0.5`. Note, this only works in Python 2.7!
58+
To limit speed difference between these two algorithms, LAST **runs in multiple threads**, so using `-t 4` you shouldn't see any difference in runtime between runs for `--identity 0.9` or `--identity 0.5`.
6059

6160
### How is multiple redundancy handled?
6261
Redundans removes all contigs, but the longest one, that fullfill identity & overlap critaria during reduction step. For more info see [issue #8](https://github.com/lpryszcz/redundans/issues/8).
@@ -65,6 +64,9 @@ Redundans removes all contigs, but the longest one, that fullfill identity & ove
6564
https://github.com/Gabaldonlab/redundans is the official repository for Redundans, but we keep https://github.com/lpryszcz/redundans for back-compatibility, as some of the very first users of Redundans use it.
6665
**Both Redundans repositories contain the same code and are regularly updated.**
6766

67+
### How to cite Redundans?
68+
Leszek P. Pryszcz and Toni Gabaldón (Submitted) Redundans: an assembly pipeline for highly heterozygous genomes. NAR
69+
6870
## FAQ - INSTALL.sh
6971
### Installation succeeded, but redundans fails with `ImportError: No module named Bio`
7072
Make sure you opened new terminal window after installation finished.

0 commit comments

Comments
 (0)