BOL: Related items

Google Genomics

Reshma Khatun — Fri, 17 Oct 2014 02:14:14 -0500

Google Genomics provides an API to store, process, explore, and share DNA sequence reads, reference-based alignments, and variant calls, using Google's cloud infrastructure.

Store alignments and variant calls for one genome or a million.
Process genomic data in batch by running principal component analysis or Hardy-Weinberg equilibrium, in minutes or hours, by using parallel computing frameworks like MapReduce.
Explore data by slicing alignments and variants by genomic range across one or multiple samples -- for your own algorithms or for visualization; or interactively process entire cohorts to find transition/transversion ratios, allelic frequency, genome-wide association and more using BigQuery.
Share genomic data with your research group, collaborators, the broader community, or the public. You decide.

Google Genomics is implementing the API defined by the Global Alliance for Genomics and Health for visualization, analysis and more. Compliant software can access Google Genomics, local servers, or any other implementation.

Address of the bookmark: https://cloud.google.com/genomics/

MECAT: fast mapping, error correction, and de novo assembly for single-molecule sequencing reads

Rahul Nayak — Fri, 11 May 2018 05:07:45 -0500

MECAT is an ultra-fast Mapping, Error Correction and de novo Assembly Tools for single molecula sequencing (SMRT) reads. MECAT employs novel alignment and error correction algorithms that are much more efficient than the state of art of aligners and error correction tools. MECAT can be used for effectively de novo assemblying large genomes. For example, on a 32-thread computer with 2.0 GHz CPU , MECAT takes 9.5 days to assemble a human genome based on 54x SMRT data, which is 40 times faster than the current PBcR-Mhap pipeline. MECAT performance were compared with PBcR-Mhap pipeline, FALCON and Canu(v1.3) in five real datasets. The quality of assembled contigs produced by MECAT is the same or better than that of the PBcR-Mhap pipeline and FALCON.

https://www.nature.com/articles/nmeth.4432

Address of the bookmark: https://github.com/xiaochuanle/MECAT

Research Scientist – National Institute of Cholera and Enteric Diseases

Wed, 22 Oct 2014 10:26:46 -0500

The following post is to be filled up on purely temporary basis under the project entitled "Second phase of Task Force Biomedical Informatics Center of ICMR" under Dr. Santasabuj Das, Scientist 'D' of this Institute:-

01. Scientist II 01
Essential: Ph.D. degree in Life Sciences from a recognized university along with a minimum of 2 years of research experience in Bioinformatics as evidenced by publications in the peer reviewed journals.

OR
Ph.D. degree in Bioinformatics from a recognized university.

OR
M.Sc. in Bioinformatics from a recognized university along with a minimum of 3 years of research experience in Bioinformatics as evidenced by publications in the peer reviewed journals.

Desirable:
Thorough Knowledge about In silico genome analysis and comparative genomics.
Experience with in silico identification of novel virulence factors of pathogens, host-pathogen interactions and Systems Biology.
Additional Postdoctoral research experience in relevant subjects from a recognized institutions.

Rs. 44,000/- p.m. (consolidated) plus 30% HRA

Below 40 years

Applications along with Bio-Data containing detail work experience and full list of publications may be sent via email tosantasabujdas@yahoo.com latest by October 27, 2014.

Short-listed candidates will be called via email for an interview to be held at the institute in the second week of November, 2014.

Advertisement: www.niced.org.in/placements.htm

gapFinisher: A reliable gap filling pipeline for SSPACE-LongRead scaffolder output

Rahul Nayak — Fri, 24 Jan 2020 06:04:40 -0600

gapFinisher is based on the controlled use of a previously published gap filling tool FGAP and works on all standard Linux/UNIX command lines. They compare the performance of gapFinisher against two other published gap filling tools PBJelly and GMcloser.

gapFinisher can fill gaps in draft genomes quickly and reliably.

Address of the bookmark: https://github.com/kammoji/gapFinisher

Celebrating Crystallography - An animated adventure

Fri, 31 Oct 2014 15:59:00 -0500

NEW: Now with French or Spanish subtitles (click on the 'Captions' icon to select). Plus... Watch the French language version here: https://www.youtube.com/watch?v=PvLu7BOsJhM X-ray crystallography is arguably one of the greatest innovations of the twentieth century, but not that many people know what it is or how it came about. Join us on an animated journey through the 100 year history of crystallography -- from the pioneering work of William and Lawrence Bragg in 1913 to the surface of Mars! Narrated by structural biologist Stephen Curry and produced by animation company 12foot6, the film explores the extraordinary history of crystallography. To date 28 Nobel Prizes have been awarded to projects related to the field and X-ray crystallography remains the foremost technique in determining the structures of a huge range of complex molecules. This film was produced in celebration of the Bragg Centenary and was funded by STFC. Watch more science videos on the amazing Ri Channel: http://richannel.org Watch more animations from 12foot6: http://12foot6.com/ The Ri is on Twitter: http://twitter.com/ri_science and Facebook: http://www.facebook.com/royalinstitution Subscribe for the latest science videos: http://richannel.org/newsletter

Bioinformatics tools to explore SSRs in genomes !

BioStar — Tue, 07 Mar 2023 13:06:15 -0600

There are several bioinformatics tools that can be used to explore Simple Sequence Repeats (SSRs), which are also known as microsatellites. Here are a few examples:

MISA: MISA (MIcroSAtellite) is a web-based tool that can identify SSRs in DNA sequences. It can be used to analyze nucleotide sequences from various organisms and can identify perfect, compound, and imperfect SSRs.
SSR Locator: SSR Locator is a web-based tool that identifies SSRs in both DNA and RNA sequences. It can identify perfect, compound, and imperfect SSRs, and can also filter out low complexity regions.
SciRoKo: SciRoKo is a software tool that can identify SSRs in DNA sequences. It can be used to analyze genomic and transcriptomic sequences from various organisms and can identify perfect, compound, and imperfect SSRs.
Primer3: Primer3 is a web-based tool that designs PCR primers for SSRs. It can design primers for perfect and imperfect SSRs, and can be used to design primers for SSRs in various organisms.
QDD: QDD (Quick Detection of Duplication) is a software tool that can identify SSRs in DNA sequences and can also identify duplicate loci. It can be used to analyze genomic and transcriptomic sequences from various organisms.

These are just a few examples of the many bioinformatics tools available for exploring SSRs. Depending on your specific needs and research questions, you may find that other tools are more appropriate for your analysis.

Postdoctoral fellowship in Bioinformatics

Sat, 08 Nov 2014 14:41:14 -0600

A two-year post-doctoral position is available in the Biocomputing group of the Sapienza University led by Anna Tramontano to work on either genomics research or structural bioinformatics, focusing on the study of relevant biomedical problems.
The ideal candidate should be motivated and talented, hold a PhD degree, have good programming skills, a grasp of statistical methods and an understanding of biology.
Experience in the development of computational biology methods would be an added value.

Good communication skills and fluency in spoken and written English are required.
Please apply sending a curriculum vitae, the names of at least two referees and a letter of motivation describing past experience and future goals to anna.tramontano@uniroma1.it with subject: “Application for post-doctoral position November 2014 YOUR LAST NAME”

Deadline: No later than November 28th, 2014.
Duration: 2 years

Salary on grant: Commeasured to the experience of the candidate
Contact Person (Referent): Anna Tramontano
Ref. E-Mail: anna.tramontano@uniroma1.it
Group Web Page: http:/www.biocomputing.it

Alignment-free sequence comparison tools available for next-generation sequencing data analysis

Abhimanyu Singh — Tue, 07 Nov 2017 05:33:33 -0600

kallisto

Transcript abundance quantification from RNA-seq data (uses pseudoalignment for rapid determination of read compatibility with targets)

Software (C++)

https://pachterlab.github.io/kallisto/

Sailfish

Estimation of isoform abundances from reference sequences and RNA-seq data (k-mer based)

Software (C++)

http://www.cs.cmu.edu/~ckingsf/software/sailfish/

Salmon

Quantification of the expression of transcripts using RNA-seq data (uses k-mers)

https://combine-lab.github.io/salmon/

RNA-Skim

RNA-seq quantification at transcript-level (partitions the transcriptome into disjoint transcript clusters; uses sig-mers, a special type of k-mers)

Software (C++)

http://www.csbio.unc.edu/rs/

Variant calling

ChimeRScope

Fusion transcript prediction using gene k-mers profiles of the RNA-seq paired-end reads

Software (Java)

https://github.com/ChimeRScope/ChimeRScope/wiki

FastGT

Genotyping of known SNV/SNP variants directly from raw NGS sequence reads by counting unique k-mers

Software (C)

https://github.com/bioinfo-ut/GenomeTester4/

Phy-Mer

Reference-independent mitochondrial haplogroup classifier from NGS data (k-mer based)

Software (Python)

https://github.com/danielnavarrogomez/phy-mer

LAVA

Genotyping of known SNPs (dbSNP and Affymetrix's Genome-Wide Human SNP Array) from raw NGS reads (k-mer based)

Software (C)

http://lava.csail.mit.edu/

MICADo

Detection of mutations in targeted third-generation NGS data (can distinguish patients’ specific mutations; algorithm uses k-mers and is based on colored de Bruijn graphs)

Software (Python)

http://github.com/cbib/MICADo

General mapper

Minimap

Lightweight and fast read mapper and read overlap detector (uses the concept of “minimazers”, a special type of k-mers)

Software (C)

https://github.com/lh3/minimap

Assembly

De novo genome assembly

MHAP

Produces highly continuous assembly (fully resolved chromosome arms) from third-generation long and noisy reads (10 kbp) using a dimensionality reduction technique MinHash

Software (Java)

https://github.com/marbl/MHAP

Miniasm

Assembler of long noisy reads (SMRT, ONT) using the Overlap-Layout Consensus (OLC) approach without the necessity of an error correction stage (uses minimap)

Software (C)

https://github.com/lh3/miniasm

LINKS

Scaffolding genome assembly with error-containing long sequence (e.g., ONT or PacBio reads, draft genomes)

Software (Perl)

https://github.com/warrenlr/LINKS/

Read clustering

afcluster

Clustering of reads from different genes and different species based on k-mer counts

Software (C++)

https://github.com/luscinius/afcluster

QCluster

Clustering of reads with alignment-free measures (k-mer based) and quality values

Software (C++)

http://www.dei.unipd.it/~ciompin/main/qcluster.html

Reads error correction

Lighter

Correction of sequencing errors in raw, whole genome sequencing reads (k-mer based)

Software (C++)

https://github.com/mourisl/Lighter

QuorUM

Error corrector for Illumina reads using k-mers

Software (C++)

https://github.com/gmarcais/Quorum

Trowel

Software (C++)

https://sourceforge.net/projects/trowel-ec/

Metagenomics

Assembly-free phylogenomics

AAF

Phylogeny reconstruction directly from unassembled raw sequence data from whole genome sequencing projects; provides bootstrap support to assess uncertainty in the tree topology (k-mer based)

Software (Python)

https://github.com/fanhuan/AAF

kSNP v3

Reference-free SNP identification and estimation of phylogenetic trees using SNPs (based on k-mer analysis)

Software (C)

https://sourceforge.net/projects/ksnp/files/

NGS-MC

Phylogeny of species based on NGS reads using alignment-free sequence dissimilarity measures d2* and d2 S under different Markov chain models (using k-words)

R package

http://www-rcf.usc.edu/~fsun/Programs/NGS-MC/NGS-MC.html

Species identification/taxonomic profiling

CLARK

Taxonomic classification of metagenomic reads to known bacterial genomes using k-mer search and LCA assignment

Software (C++)

http://clark.cs.ucr.edu/

FOCUS

Reports organisms present in metagenomic samples and profiles their abundances (uses composition-based approach and non-negative least squares for prediction)

Web service Software (Python)

http://edwards.sdsu.edu/FOCUS/

GSM

Estimation of abundances of microbial genomes in metagenomic samples (k-mer based)

Software (Go)

https://github.com/pdtrang/GSM

Mash

Species identification using assembled or unassembled Illumina, PacBio, and ONT data (based on MinHash dimensionality-reduction technique)

Software (C++)

https://github.com/marbl/mash

Kraken

Taxonomic assignment in metagenome analysis by exact k-mer search; LCA assignment of short reads based on a comprehensive sequence database

Software (C++)

https://ccb.jhu.edu/software/kraken/

LMAT

Assignment of taxonomic labels to reads by k-mers searches in precomputed database

Software (C++/Python)

https://sourceforge.net/projects/lmat/

stringMLST

k-mer-based tool for MLST directly from the genome sequencing reads

Software (Python)

http://jordan.biology.gatech.edu/page/software/stringMLST

Taxonomer

k-mer-based ultrafast metagenomics tool for assigning taxonomy to sequencing reads from clinical and environmental samples

Web service

http://taxonomer.iobio.io/

Other

d2-tools

Word-based (k-tuple) comparison (pairwise dissimilarity matrix using d2S measure) of metatranscriptomic samples from NGS reads

Software (Python/R)

https://code.google.com/p/d2-tools/

VirHostMatcher

Prediction of hosts from metagenomic viral sequences based on ONF using various distance measures (e.g., d2)

Software (C++)

https://github.com/jessieren/VirHostMatcher

MetaFast

Statistics calculation of metagenome sequences and the distances between them based on assembly using de Bruijn graphs and Bray–Curtis dissimilarity measure

Software (Java)

https://github.com/ctlab/metafast

Centre for Systems Biology & Bioinformatics, Panjab University vacancy of Research Fellow

Wed, 12 Nov 2014 06:18:54 -0600

Applications are invited along with complete bio-data and attested copies of certificates of qualifications, experience etc. for the one post of
Research Fellow and one post of Program Assistant under PURSE Grant of the University in Centre for Systems Biology & Bioinformatics, UIEAST, Panjab University, Chandigarh which is tenable till the period of the project

Essential Qualification
For Research Fellow:-
M.Sc. in Systems Biology and Bioinformatics / Life
Sciences with minimum 55% marks.
Preference will be given to NET/GATE/ICMR qualified candidates without fellowship however, candidates who have cleared the Panjab University Ph.D. entrance test in Systems Biology & Bioinformatics will also be eligible.

Applications should be reach on or before 19-11-2014 in the office of the undersigned. Interview will be held on 21-11-2014 in the office of the Coordinator, Centre for Systems Biology & Bioinformatics, South Campus, Block-3, Sector-25, Panjab University, Chandigarh. No TA/DA will be paid.

more at http://jobs.puchd.ac.in/includes/jobs/2014/20141110143634-Advertisement.pdf

HISAT2: a fast and sensitive alignment program for mapping next-generation sequencing reads

Rahul Nayak — Tue, 08 May 2018 04:27:22 -0500

HISAT2 is a fast and sensitive alignment program for mapping next-generation sequencing reads (both DNA and RNA) to a population of human genomes (as well as to a single reference genome). Based on an extension of BWT for graphs [Sirén et al. 2014], we designed and implemented a graph FM index (GFM), an original approach and its first implementation to the best of our knowledge. In addition to using one global GFM index that represents a population of human genomes, HISAT2 uses a large set of small GFM indexes that collectively cover the whole genome (each index representing a genomic region of 56 Kbp, with 55,000 indexes needed to cover the human population). These small indexes (called local indexes), combined with several alignment strategies, enable rapid and accurate alignment of sequencing reads. This new indexing scheme is called a Hierarchical Graph FM index (HGFM).

more at https://ccb.jhu.edu/software/hisat2/index.shtml

Address of the bookmark: https://github.com/infphilo/hisat2