Address of the bookmark: http://schatzlab.cshl.edu/data/nanocorr/

It is enormous, billions of letters long. Some of those letters are easy to understand because they contain instructions for building proteins, the tiny machines that keep our cells alive.

But what if some of the most important instructions aren't in those obvious chapters?

Scientists have long suspected that the mysterious stretches of DNA between protein-coding genes may contain some of life's most interesting secrets. These regions can act like switches, telling genes when, where, and how strongly to turn on. Among them are conserved non-coding elements, or CNEs DNA sequences that have remained remarkably similar across different species.

Think of a CNE as a sentence that nature has copied into several editions of the same book.

A mouse has it.

A bird has it.

A human has it.

And despite millions of years of evolution, much of the sentence remains almost unchanged.

That conservation is a clue: this piece of DNA probably matters.

But there was a problem. Finding these hidden sentences across enormous genomes is difficult. Researchers needed to compare many genomes, identify conserved regions, and then determine which of those regions might have evolved unusually quickly in particular branches of the evolutionary tree.

Enter CNEwrap. https://github.com/YanCCscu/CNEwrap

The researchers developed CNEwrap as a streamlined toolkit capable of handling large-scale genome comparisons, conserved-element detection, and evolutionary analysis. Inside it is a new algorithm called EvoAcc, designed to identify CNEs that show accelerated evolution in specific species or lineages.

Why does that matter?

Because evolution isn't just about what stays the same.

Sometimes, the most interesting story is hidden in what changed.

Imagine that nearly every species carries the same regulatory sentence, but one lineage suddenly has several unusual edits. Perhaps those changes helped shape a new body structure, a different adaptation, or another distinctive trait.

EvoAcc is designed to help researchers find these evolutionary clues. In the study's tests, it performed particularly well in scenarios involving two or three accelerated lineages and showed improved sensitivity to insertion and deletion mutations compared with several existing approaches.

The researchers also tested CNEwrap using functional genomic regions from mammals and found that EvoAcc could recover human-specific accelerated regions while identifying some signals that other methods missed.

So the story of CNEwrap is really a story about looking beyond the obvious.

For decades, scientists have often focused on the DNA that directly encodes proteins. But the genome is more like a vast library: the protein-coding genes are the main text, while non-coding regions may contain punctuation, instructions, switches, annotations, and editing notes that tell the cell how to read the book.

CNEwrap gives researchers a new way to search that hidden material.

And perhaps somewhere inside those billions of DNA letters is an evolutionary story we haven't read yet.

The exciting part is that we now have better tools to find it.

Read more about it https://academic.oup.com/nar/article/54/14/gkag709/8738333?

So far miniasm is in early development stage. It has only been tested on a dozen of PacBio and Oxford Nanopore (ONT) bacterial data sets. Including the mapping step, it takes about 3 minutes to assemble a bacterial genome. Under the default setting, miniasm assembles 9 out of 12 PacBio datasets and 3 out of 4 ONT datasets into a single contig. The 12 PacBio data sets are PacBio E. coli sample, ERS473430, ERS544009, ERS554120, ERS605484, ERS617393, ERS646601, ERS659581, ERS670327, ERS685285, ERS743109 and a deprecated PacBio E. coli data set. ONT data are acquired from the Loman Lab.

For a C. elegans PacBio data set (only 40X are used, not the whole dataset), miniasm finishes the assembly, including reads overlapping, in ~10 minutes with 16 CPUs. The total assembly size is 105Mb; the N50 is 1.94Mb. In comparison, the HGAP3produces a 104Mb assembly with N50 1.61Mb. This dotter plot gives a global view of the miniasm assembly (on the X axis) and the HGAP3 assembly (on Y). They are broadly comparable. Of course, the HGAP3 consensus sequences are much more accurate. In addition, on the whole data set (assembled in ~30 min), the miniasm N50 is reduced to 1.79Mb. Miniasm still needs improvements.

Miniasm confirms that at least for high-coverage bacterial genomes, it is possible to generate long contigs from raw PacBio or ONT reads without error correction. It also shows that minimap can be used as a read overlapper, even though it is probably not as sensitive as the more sophisticated overlapers such as MHAP and DALIGNER. Coupled with long-read error correctors and consensus tools, miniasm may also be useful to produce high-quality assemblies.

Minimap and miniasm are ultrafast tools for (i) mapping and (ii) assembly. Designed for long, noisy reads, they do not have a correction or consensus step, and therefore the resulting assemblies are contiguous (i.e. long) but very noisy (i.e. full of errors)

We start with an all against all comparison:

minimap -Sw5 -L100 -m0 -t8 reads.fq reads.fq | gzip -1 > reads.paf.gz

Then we can assemble

miniasm -f reads.fq reads.paf.gz > reads.gfa

Convert GFA to FASTA:

awk '/^S/{print ">"$2"\n"$3}' reads.gfa | fold > reads.fa

And then count how many contigs:

grep ">" reads.fa | wc -l

# Download sample PacBio from the PBcR website
wget -O- http://www.cbcb.umd.edu/software/PBcR/data/selfSampleData.tar.gz | tar zxf -
ln -s selfSampleData/pacbio_filtered.fastq reads.fq
# Install minimap and miniasm (requiring gcc and zlib)
git clone https://github.com/lh3/minimap && (cd minimap && make)
git clone https://github.com/lh3/miniasm && (cd miniasm && make)
# Overlap
minimap/minimap -Sw5 -L100 -m0 -t8 reads.fq reads.fq | gzip -1 > reads.paf.gz
# Layout
miniasm/miniasm -f reads.fq reads.paf.gz > reads.gfa

Address of the bookmark: https://github.com/lh3/miniasm

Address of the bookmark: https://github.com/fenderglass/Flye

Further information about LACHESIS, including source code, documentation and a user's guide are available at: http://shendurelab.github.io/LACHESIS.

Manuscript describing LACHESIS was published as: Burton JN#, Adey A, Patwardhan RP, Qiu R, Kitzman JO, Shendure J#. Chromosome-scale scaffolding of de novo genome assemblies based on chromatin interactions. Nature Biotechnology 2013 Dec;31(12):1119-25. doi: 10.1038/nbt.272. PubMed PMID: 24185095.

http://shendurelab.github.io/LACHESIS/

Address of the bookmark: http://shendurelab.github.io/LACHESIS/

Searcg link https://metagraph.ethz.ch/search 

Pre-print https://www.biorxiv.org/content/10.1101/2020.10.01.322164v4 

Address of the bookmark: https://metagraph.ethz.ch/

• single-end/paired-end bulk RNA-seq (strand-specific/agnostic)
• paired-end single-cell RNA-seq (strand-specific/agnostic)
• nanopore RNA-seq (PCR cDNA/direct cDNA/direct RNA)

Written by Ka Ming Nip ✉️

Address of the bookmark: https://github.com/bcgsc/RNA-Bloom

High Throughput Sequencing Analysis
Comparative Genomics
Identification and Annotation of Non-coding RNAs
Bioinformatic Analysis and System Biology of Viruses
Coevolution of Proteins and RNAs
Algorithmic Bioinformatics
Phylogenetic Analysis

http://www.rna.uni-jena.de/index.php

Hercules source code is available at https://github.com/BilkentCompGen/Hercules

Address of the bookmark: https://github.com/BilkentCompGen/Hercules

Protein-protein and protein-DNA/RNA docking based on a hybrid algorithm of template-based modeling and ab initio free docking.

The HDOCK server distinguishes itself from similar docking servers in its ability to support amino acid sequences as input and a hybrid docking strategy in which experimental information about the protein–protein binding site and small-angle X-ray scattering can be incorporated during the docking and post-docking processes.

Address of the bookmark: http://hdock.phys.hust.edu.cn/