disco.omicsbio.org Open in urlscan Pro
50.87.219.111  Public Scan

URL: http://disco.omicsbio.org/
Submission: On January 14 via api from US — Scanned from DE

Form analysis 1 forms found in the DOM

GET http://disco.omicsbio.org/

<form role="search" method="get" class="search-form" action="http://disco.omicsbio.org/">
  <label>
    <span class="screen-reader-text">Search for:</span>
    <input type="search" class="search-field" placeholder="Search …" value="" name="s">
  </label>
  <input type="submit" class="search-submit screen-reader-text" value="Search">
</form>

Text Content

Skip to content

DISCO

Distributed Co-assembly of Overlap Graphs

Menu and widgets
 * Home
 * Downloads
 * User Manual
 * Benchmarkingexpand child menu
   * Reproducing Benchmark Results
 * DISCO Asssemblies
 * Publications
 * Contact Us

Search for:


ARCHIVES

 * January 2017
 * October 2016


DISCO

DISCO is a multi threaded and multiprocess distributed memory
overlap-layout-consensus (OLC) metagenome assembler. Disco was developed as
a scalable assembler to assemble large metagenomes from billions of Illumina
sequencing reads of complex microbial communities. Disco was parallelized for
computer clusters in a hybrid architecture that integrated shared-memory
multi-threading, point-to-point message passing, and remote direct memory
access. The assembly and scaffolding were performed using an iterative overlap
graph approach.

Disco has 3 modes of operation:

 1. Single Computer Version: Assembly on a single node with multiple threads.
    This mode is best for small assemblies and requires memory equivalent to the
    number  base pairs in the input dataset.
 2. Distributed Computation Version: Assembly on a cluster computer with MPI
    message passing library installed. This mode is best for small and medium
    sized assemblies and each node requires memory equivalent to the number
     base pairs in the input dataset.
 3. Distributed Memory Version:  Assembly on a cluster computer with MPI message
    passing library installed. This mode is best for large assemblies and each
    node requires at least 30% of the memory equivalent to the number  base
    pairs in the input dataset.

The flowchart of the Disco assembly algorithm shows the distributed computation
and iterative assembly.



Proudly powered by WordPress