...
Upfront we need to discuss the two basic assembler types: overlap graph and de Bruijn:
...
| Wiki Markup |
|---|
{iframe:src=http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2928494/figure/F2/ |
...
|width |
...
=800 |
...
|height |
...
=800 |
...
} {iframe} |
In either case, more and longer reads are better as you can imagine. With an overlap graph (also called overlap layout consensus algorithm or overlap layout algorithm) your assembly grows much more effectively with longer reads and there are few parameters you can tweak. With a de Bruijn approach, obviously your choice of k can have a strong impact on your assembly.
Effect of trade-off in read length and coverage
...
...
| Wiki Markup |
|---|
{iframe:src=http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2928494/figure/F3/ |
...
|width |
...
=800 |
...
|height |
...
=800 |
...
} {iframe} |
k-mer distributions inherent in select genomes
...
...
| Wiki Markup |
|---|
{iframe:src=http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2928494/figure/F1/ |
...
|width |
...
=800 |
...
|height |
...
=800 |
...
} {iframe} |
Some example assembly statistics
...
...
| Wiki Markup |
|---|
{iframe:src=http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2928494/table/T1/ |
...
|width |
...
=800 |
...
|height |
...
=800 |
...
} {iframe} |
Many (many) assemblers are available. A list of assemblers can be found here.
...