BOL

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...

github.com - DeepVariant is an analysis pipeline that uses a deep neural network to call genetic variants from next-generation DNA sequencing data. DeepVariant is an analysis pipeline that uses a deep neural network to call genetic variants from next-generation...

ENCODE 3 A collection of research articles and related content describing the Encyclopedia of DNA Elements, its datasets and tools.

github.com - Metabuli 분리 improves metagenomic read classification through metamers, DNA-AA k-mers, to be sensitive and specific, recovering 99% and 98% of DNA or AA classifiers.   Metabuli is metagenomic classifier that jointly analyze both DNA and amino...

Explain the DNA and RNA with picture ...

What are genomic interspersed repeats? In the mid 1960's scientists discovered that many genomes contain stretches of highly repetitive DNA sequences ( see Reassociation Kinetics Experiments, and C-Value Paradox ). These sequences were later...

gvolante.riken.jp - gVolante provides an online interface for completeness assessment of user’s original or publicly available sequence datasets as well as for browsing results of completeness assessment performed on publicly available genome and...

github.com - pbalign aligns PacBio reads to reference sequences, filters aligned reads according to user-specific filtering criteria, and converts the output to either the SAM format or PacBio Compare HDF5 (e.g., .cmp.h5) format. The output Compare HDF5 file...

github.com - GRSR is a Tool for Deriving Genome Rearrangement Scenarios for Multiple Uni-chromosomal Genomes. This tool will do the following steps: Step 1. Run mugsy to get multiple sequence alignment results. Step 2 & 3. Extraction of the Coordinates...

github.com - LTR_Finder is an efficient program for finding full-length LTR retrotranspsons in genome sequences. The Program first constructs all exact match pairs by a suffix-array based algorithm and extends them to long highly similar pairs. Then...