github.com - odgi provides an efficient and succinct dynamic DNA sequence graph model, as well as a host of algorithms that allow the use of such graphs in bioinformatic analyses.
Careful encoding of graph entities allows odgi to efficiently...
shendurelab.github.io - LACHESIS is method that exploits contact probability map data (e.g. from Hi-C) for chromosome-scale de novo genome assembly.
Further information about LACHESIS, including source code, documentation and a user's guide are available...
sourceforge.net - Contiguity preserving transposition and sequencing (CPT-seq) is an entirely in vitro means of generating libraries comprised of 9216 indexed pools, each of which contains thousands of sparsely sequenced long fragments ranging from 5 kilobases to...
ftp.ncbi.nih.gov - Now a days there are a lots of genomics databases available around the world. This bookmark is created to provide all links in one place ...
ftp://ftp.ncbi.nih.gov/genomes/
https://hgdownload.soe.ucsc.edu/downloads.html
github.com - Hagfish is a tool that is to be used in data analysis of Next Generation Sequencing (NGS) experiments. Hagfish builds on the concept of coverage plots and aims to assist (amongst others) in quality control of de novo genome assembly or...
github.com - ChopStitch is a new method for finding putative exons and constructing splice graphs using an assembled transcriptome and whole genome shotgun sequencing (WGSS) data. ChopStitch identifies exon-exon boundaries in de novo assembled RNA-seq data with...
In graph theory, a string graph is an intersection graph of curves in the plane; each curve is called a "string". String graphs were first proposed by E. W. Myers in a 2005 publication.
www.atcgn.com - quarTeT is a collection of tools for T2T genome assembly and basic analysis in automatic workflow.Task include:
AssemblyMapper : reference-guided genome assembly
GapFiller : long-reads based gap filling
TeloExplorer : telomere...
github.com - 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 DNA sequence reads.
More at
https://github.com/jts/sga
SGA...