BOL: All site bookmarks

TRITEX sequence assembly pipeline for Triticeae genomes

Jit — Tue, 20 Aug 2019 09:47:14 -0500

The pipeline is open-source and hosted in a public Bitbucket repository.

TRITEX has been run on highly inbred genotypes of barley (Hordeum vulgare), tetraploid wheat (Triticum turgidum) and hexaploid wheat (T. aestivum) with reasonable results: super-scaffold N50 values in the range of dozens of Mb and pseudomolecules with better gene space representation than a BAC-by-BAC assembly. It has never been tested and is not expected to work on heterozygous or autopolyploid genomes.

A protocol for generating chromosome-conformation capture sequencing (Hi-C) data suitable for use with the pipeline is described in Himmelbach et al. 2018. Refer to the technical notes of 10X Genomics on how to generate Chromium data.

Address of the bookmark: https://tritexassembly.bitbucket.io/

dnaPipeTE: a pipeline designed to find, annotate and quantify Transposable Elements

Jit — Mon, 12 Aug 2019 21:56:08 -0500

dnaPipeTE (for de-novo assembly & annotation Pipeline for Transposable Elements), is a pipeline designed to find, annotate and quantify Transposable Elements in small samples of NGS datasets. It is very useful to quantify the proportion of TEs in newly sequenced genomes since it does not require genome assembly and works on small datasets (< 1X).

https://github.com/clemgoub/dnaPipeTE/wiki/dnaPipeTE-WIKI-home

Address of the bookmark: https://github.com/clemgoub/dnaPipeTE

Cactus: a reference-free whole-genome multiple alignment program

Jit — Mon, 12 Aug 2019 07:52:33 -0500

Cactus is a reference-free whole-genome multiple alignment program. The principal algorithms are described here: https://doi.org/10.1101/gr.123356.111

Cactus uses substantial resources. For primate-sized genomes (3 gigabases each), you should expect Cactus to use approximately 120 CPU-days of compute per genome, with about 120 GB of RAM used at peak. The requirements scale roughly quadratically, so aligning two 1-megabase bacterial genomes takes only 1.5 CPU-hours and 14 GB RAM.

Address of the bookmark: https://github.com/ComparativeGenomicsToolkit/cactus

The Extensive de novo TE Annotator (EDTA)

Abhimanyu Singh — Thu, 08 Aug 2019 04:05:36 -0500

The EDTA package was designed to filter out false discoveries in raw TE candidates and generate a high-quality non-redundant TE library for whole-genome TE annotations. Selection of initial search programs were based on benckmarkings on the annotation performance using a manually curated TE library in the rice genome.

Address of the bookmark: https://github.com/oushujun/EDTA

gVolante: Completeness Assessment of Genome/Transcriptome Sequences

Jit — Tue, 06 Aug 2019 21:37:56 -0500

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

Address of the bookmark: https://gvolante.riken.jp/

Artificial Intelligence Material !

BioStar — Fri, 02 Aug 2019 09:56:54 -0500

Major Machine Learning Types Explianed in 11 Pages Credit: McKinsey

For more applied resource you can see at:

1. Data Science Process https://lnkd.in/fMHtxYP

2. Data Visualization in Business https://lnkd.in/fYUCzgC

3. Understand How to answer Why https://lnkd.in/f396Dqg

4. Know ML Key Terminology https://lnkd.in/fCihY9W

5. Understand ML Implementation https://lnkd.in/f5aUbBM

6. ML Applications on Marketing https://lnkd.in/fUDGAQW

and Retail https://lnkd.in/fihPTJf

Address of the bookmark: https://lnkd.in/f5aUbBM

Patterns: a modeling tool dedicated to biological network modeling

Abhimanyu Singh — Fri, 26 Jul 2019 01:11:59 -0500

It is designed to work with patterned data. Famous examples of problems related to patterned data are:

recovering signals in networks after a stimulation (cascade network reverse engineering),
analysing periodic signals.

Address of the bookmark: https://github.com/fbertran/Patterns

jackalope: A swift, versatile phylogenomic and high-throughput sequencing simulator

Abhimanyu Singh — Fri, 26 Jul 2019 00:58:12 -0500

jackalope simply and efficiently simulates (i) variants from reference genomes and (ii) reads from both Illumina and Pacific Biosciences (PacBio) platforms. It can either read reference genomes from FASTA files or simulate new ones. Genomic variants can be simulated using summary statistics, phylogenies, Variant Call Format (VCF) files, and coalescent simulations—the latter of which can include selection, recombination, and demographic fluctuations. jackalope can simulate single, paired-end, or mate-pair Illumina reads, as well as reads from Pacific Biosciences These simulations include sequencing errors, mapping qualities, multiplexing, and optical/PCR duplicates. All outputs can be written to standard file formats.

A swift, versatile phylogenomic and high-throughput sequencing simulator https://jackalope.lucasnell.com

Address of the bookmark: https://github.com/lucasnell/jackalope

Snakemake workflow: dna-seq-gatk-variant-calling

Jit — Thu, 25 Jul 2019 12:55:07 -0500

This Snakemake pipeline implements the GATK best-practices workflow for calling small genomic variants.

Address of the bookmark: https://github.com/snakemake-workflows/dna-seq-gatk-variant-calling

MSAProbs - Parallel and accurate multiple sequence alignment

Neel — Tue, 09 Jul 2019 23:58:44 -0500

MSAProbs is a well-established state-of-the-art multiple sequence alignment algorithm for protein sequences. The design of MSAProbs is based on a combination of pair hidden Markov models and partition functions to calculate posterior probabilities. Assessed using the popular benchmarks: BAliBASE, PREFAB, SABmark and OXBENCH, MSAProbs achieves statistically significant accuracy improvements over the existing top performing aligners, including ClustalW, MAFFT, MUSCLE, ProbCons and Probalign. In addition, MSAProbs is optimized for shared-memory CPUs by employing a multi-threaded design, and further parallelized for distributed-memory systems using MPI to overcome high memory overhead barrier and achieve good parallel and data-size scalability.

Address of the bookmark: http://msaprobs.sourceforge.net/homepage.htm#latest