Results for "Graph Mining"

Bookmarks

  • GATB : Genome Analysis Toolbox with de-Bruijn graph

    The Genome Analysis Toolbox with de-Bruijn graph (GATB) provides a set of highly efficient algorithms to analyse NGS data sets. These methods enable the analysis of data se...

    2940 days ago

  • QuIN’s web server

    Recent studies of the human genome have indicated that regulatory elements (e.g. pro...omatin interaction maps enables effective data visualization, integration, and mining. Currently, there is no softw...

    2880 days ago

  • FERMI

    Fermi is a de novo assembler with a particular focus on assembling Illumina short sequence reads from a mamma...index (FMD-index) as the key data structure. It is inspired by the string graph&...

    2807 days ago

  • Graph Genome Suite

    Seven Bridges is the biomedical data analysis company accelerating breakthroughs in genomics research for cancer,...uild self-improving systems to analyze millions of genomes, including the Graph...

    2758 days ago

  • Minia

    Minia is a short-read assembler based on a de Bruijn graph, capable of assembling a human genome on a desktop computer in a day. The output of Minia is a set of contigs. Minia pro...

    2717 days ago

  • SGA: String Graph Assembler

    SGA is a de novo genome assembler based on the concept of string graphs. The major goal of SGA is to be very memory efficient, which is achieved by using a compressed representation of...

    2717 days ago

  • GAM-NGS: genomic assemblies merger for next generation sequencing

    GAM-NGS (Genomic Assemblies Merger for Next Generation Sequencing), whose primary goal...ough reads' alignments and stored in a weightedgraph. The merging phase is carried out with the help of this weighted graph...

    2706 days ago

  • Genome Assembly Tutorial

    If genomes were completely random sequences in a statistical sense, 'overlap-consensus-layout' method would have b...d they are hard to assemble using overlap-consensus-layout approach. De Bruijn graph-...

    2705 days ago

  • YAHA

    YAHA, a fast and flexible hash-based aligner. YAHA is as fast and accurate as BWA-SW at finding the single best al...that use simple heuristics to select alignments, YAHA uses a directed acyclic graph...

    2674 days ago

  • Mercator

    Our basic strategy in building homology maps is to use exons that are orthologous in mu...ents being performed in protein space. Construct a graph with each vertex correspondin...e significant alignments. Identify cliques in this graph....

    2657 days ago