BOL

journals.plos.org - Recent studies of the human genome have indicated that regulatory elements (e.g. promoters and enhancers) at distal genomic locations can interact with each other via chromatin folding and affect gene expression levels. Genomic technologies for...

Genome Workbench 2.10.7 is here! New features include added support for local custom BLAST databases and improvements to Tree View.

drive5.com - USEARCH >Extreme high-throughput sequence analysis. Orders of magnitude faster than BLAST. MUSCLE >Multiple sequence alignment. Faster and more accurate than CLUSTALW.  UPARSE >OTU clustering for 16S and other marker genes....

github.com - Solutions to Coursera Genome Sequencing (Bioinformatics II)

ftp.genomics.org.cn - An efficient tool called Connecting Overlapped Pair-End (COPE) reads, to connect overlapping pair-end reads using k-mer frequencies. We evaluated our tool on 30× simulated pair-end reads from Arabidopsis thaliana with 1% base error. COPE...

github.com - This code is designed to enable anyone to reproduce the Hs2-HiC and the AaegL4 genomes reported in: Dudchenko et al., De novo assembly of the Aedes aegypti genome using Hi-C yields chromosome-length scaffolds. Science, 2017. Unless otherwise...

github.com - ALPACA requires Celera Assembler 8.3 or later. It is recommended to build Celera Assembler from source. (Why? The pre-built binaries CA_8.3rc1 and CA8.3rc2 will work for any large data set.  Detail paper...

cab.spbu.ru - QUAST-LG-a tool that compares large genomic de novo assemblies against reference sequences and computes relevant quality metrics. Since genomes generally cannot be reconstructed completely due to complex repeat patterns and low coverage regions, we...

murasaki.dna.bio.keio.ac.jp - Murasaki is an anchor alignment program that is exteremely fast (17 CPU hours for whole Human x Mouse genome (with 40 nodes: 35 wall minutes), or 8 mammals in 21 CPU hours (42 wall minutes)) scalable (Arbitrarily parallelizable across multiple...

www.nature.com - Segmental Duplication Assembler (SDA; https://github.com/mvollger/SDA) constructs graphs in which paralogous sequence variants define the nodes and long-read sequences provide attraction and repulsion edges, enabling the partition and assembly of...