<![CDATA[BOL: Related items]]> https://bioinformaticsonline.com/related/42166?offset=730 https://bioinformaticsonline.com/bookmarks/view/36510/scallop-reference-based-transcriptome-assembler-for-rna-seq Tue, 08 May 2018 04:23:27 -0500 https://bioinformaticsonline.com/bookmarks/view/36510/scallop-reference-based-transcriptome-assembler-for-rna-seq <![CDATA[Scallop: reference-based transcriptome assembler for RNA-seq]]> Scallop is an accurate reference-based transcript assembler. Scallop features its high accuracy in assembling multi-exon transcripts as well as lowly expressed transcripts. Scallop achieves this improvement through a novel algorithm that can be proved preserving all phasing paths from reads and paired-end reads, while also achieves both transcripts parsimony and coverage deviation minimization.

Scallop paper has been published at Nature Biotechnology. The datasets and scripts used in this paper to compare the performance of Scallop and other assemblers are available at scalloptest.

Please also checkout the podcast about Scallop (thanks Roman Cheplyaka for the interview). It is available at both the bioinformatics chat and iTunes.

 

https://github.com/Kingsford-Group/scallop

Address of the bookmark: https://github.com/Kingsford-Group/scallop

]]> Rahul Nayak https://bioinformaticsonline.com/news/view/19556/genome-origami Fri, 12 Dec 2014 22:48:17 -0600 https://bioinformaticsonline.com/news/view/19556/genome-origami <![CDATA[Genome Origami]]> There are several interesting factoid about our genomes, one of them is their folding. If we stretched out the DNA in a single cell, which is only a few millionths of an inch wide, it would span more than six feet. In other word, the size of six feet DNA fold themself to fit in a few millionths of an inch wide space. These DNA folding is a dynamic process that changes over time (!!). Researchers around the world have been trying to understand how DNA folds itself up so efficiently, and a recent post on the NIH Director’s Blog highlights new research illustrating how the human genome folds inside the cell’s nucleus, as well as how DNA folding affects gene regulation. The research team created this delightful video that demonstrates the principles involved using origami art.

http://bioinformaticsonline.com/videolist/watch/19555/a-3d-map-of-the-human-genome

Researchers have been working to determine how cells regulate gene expression for nearly as long as we’ve known about DNA. How, for example, do nerve cells know to turn off only nerve cell genes and turn off bone cell genes? DNA folding loops are part of the answer. This research team, which published their findings in a paper in Cell http://www.cell.com/cell/abstract/S0092-8674%2814%2901497-4 , found that the number of loops is much lower than expected. There are only 10,000 loops instead of the predicted millions, and they form on/off switches in DNA.

More at http://www.eurekalert.org/pub_releases/2014-12/ru-3mr121114.php

Reference http://www.cell.com/cell/abstract/S0092-8674%2814%2901497-4

]]> Jitendra Narayan https://bioinformaticsonline.com/bookmarks/view/40604/gapfinisher-a-reliable-gap-filling-pipeline-for-sspace-longread-scaffolder-output Fri, 24 Jan 2020 06:04:40 -0600 https://bioinformaticsonline.com/bookmarks/view/40604/gapfinisher-a-reliable-gap-filling-pipeline-for-sspace-longread-scaffolder-output <![CDATA[gapFinisher: A reliable gap filling pipeline for SSPACE-LongRead scaffolder output]]> 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

]]> Rahul Nayak https://bioinformaticsonline.com/opportunity/view/19545/walk-%E2%80%93-in-%E2%80%93-interview-agricultural-knowledge-management-unit-indian-agricultural-research-institute-new-delhi-110012 Fri, 12 Dec 2014 21:33:02 -0600 <![CDATA[WALK – IN – INTERVIEW @ Agricultural Knowledge Management Unit Indian Agricultural Research Institute, New Delhi-110012]]> Walk-in-interview for the following temporary positions will be conducted on 20th December 2014 (between 10:00 AM to 01:00 PM) at Agricultural Knowledge Management Unit, A0 block (Ground Floor), LBS Building, Indian Agricultural Research Institute, New Delhi-110012:

1 Dr. A.K.Mishra Coordinator & PI (BTISnet)

Traineeship (two) for one year

Rs. 5000/- (consolidated)

M.Sc. (Bioinformatics) with 60 % marks from a recognized University

20-12-2014 (10:00 AM -11:00 AM)

Studentship (four) for one year

Rs. 2500/- (consolidated)

Final year M.Sc./ M.Tech (Bioinformatics) Students from a recognized University

20-12-2014 (11:00 AM- 1:00 PM)

The positions are purely temporary and co-terminus with the DBT Programme. Eligible candidates are requested to submit the application form in the prescribed format along with original certificates/ documents (Degree, Marks sheets, Work experience, if any) at the time of interview. No TA/DA will be paid. Maximum age limit is 28 years for all positions. Age relaxation of 5 yrs for SC/ST and woman candidates and 3 years for OBC candidates will be given. Canvassing in any form invites disqualification.

Advertisement: http://www.iari.res.in/files/BIC-08122014-20141208-172344.pdf

]]> https://bioinformaticsonline.com/blog/view/43999/tools-for-differential-expression-analysis Tue, 08 Nov 2022 03:40:33 -0600 https://bioinformaticsonline.com/blog/view/43999/tools-for-differential-expression-analysis <![CDATA[Tools for Differential expression analysis]]> apeglm - https://bioconductor.org/packages/release/bioc/html/apeglm.html

ashr - https://github.com/stephens999/ashr, https://cran.r-project.org/web/packages/ashr/index.html

consensusDE - https://bioconductor.org/packages/release/bioc/html/consensusDE.html

DESeq2 - https://bioconductor.org/packages/release/bioc/html/DESeq2.html

edgeR - https://bioconductor.org/packages/release/bioc/html/edgeR.html

limma - https://kasperdanielhansen.github.io/genbioconductor/html/limma.html  https://bioconductor.org/packages/release/bioc/html/limma.html

MetaCycle - https://cran.r-project.org/web/packages/MetaCycle/index.html, https://github.com/gangwug/MetaCycle

RUVSeq - https://bioconductor.org/packages/release/bioc/html/RUVSeq.html

SARTools - https://github.com/PF2-pasteur-fr/SARTools

tximport - https://github.com/mikelove/tximport

 

]]> Abhi https://bioinformaticsonline.com/pages/view/34221/alignment-free-sequence-comparison-tools-available-for-next-generation-sequencing-data-analysis Tue, 07 Nov 2017 05:33:33 -0600 https://bioinformaticsonline.com/pages/view/34221/alignment-free-sequence-comparison-tools-available-for-next-generation-sequencing-data-analysis <![CDATA[Alignment-free sequence comparison tools available for next-generation sequencing data analysis]]>

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

]]> Abhimanyu Singh https://bioinformaticsonline.com/opportunity/view/19600/studentship-at-nagaland-university Tue, 16 Dec 2014 01:35:00 -0600 <![CDATA[Studentship at Nagaland University]]> Nagaland University
(A Central University Estd. By the Act of Parliament No. 35 of 1989)
Lumami 798 627, Nagaland
DBT Sponsored ‘Bioinformatics Infrastructure Facility’ Centre

Applications in plain paper are invited for the posts of (1) Traineeship (2 Nos.) and (2) Studentship – (2 Nos.) in the DBT funded-Bioinformatics Infrastructure Facility (BIF), Nagaland University, Lumami-798627, Nagaland. Details are given below. Interested candidates may submit the application along with self attested copies of certificates in support of the candidature to Prof. Chitta Ranjan Deb, Coordinator or Dr. L. N. Kakati, Deputy Coordinator, BIF Centre, Nagaland University, Lumami-798627, Nagaland on or before 15th January 2015.

The scanned application with relevant documents may be sent by email attachment to bifnulumami@gmail.com. Shortlisted candidates will be informed by email if called for interview. No TA/DA is admissible for attending the interview.

Traineeship (Two nos.)

Post Graduate degree in any branch of Life Sciences from UGC recognized Universities

Knowledge of computers and bioinformatics

Rs.8000/- p.m. fixed.

6 months

Studentship (Two nos.)

Pursuing Post Graduate degree in any branch of Life Sciences from UGC recognized Universities

Knowledge of computers and bioinformatics

Rs.8000/- p.m. fixed.

6 months

Terms and Conditions:

i) Applicants need to produce all original documents if call for interview.
ii) The posts are purely temporary and the appointment does not confer any entitlement or right over the job and will not be considered as formal service.
iii) No TA & DA will be paid for appearing in the walk-in-interview.
iv) The stipend/salary amount is subject to the sanction of DBT, New Delhi.

Advertisement: http://www.nagauniv.org.in/files/BIF%20Advt.pdf

]]> https://bioinformaticsonline.com/bookmarks/view/36512/hisat2-a-fast-and-sensitive-alignment-program-for-mapping-next-generation-sequencing-reads Tue, 08 May 2018 04:27:22 -0500 https://bioinformaticsonline.com/bookmarks/view/36512/hisat2-a-fast-and-sensitive-alignment-program-for-mapping-next-generation-sequencing-reads <![CDATA[HISAT2: a fast and sensitive alignment program for mapping next-generation sequencing reads]]> 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

]]> Rahul Nayak https://bioinformaticsonline.com/opportunity/view/19729/senior-scientist-agricultural-bio-informatics-one-post Wed, 24 Dec 2014 05:01:02 -0600 <![CDATA[Senior Scientist (Agricultural Bio-informatics) (One post)]]> Agricultural Scientists Recruitment Board

Qualifications Essential:
Doctoral degree in Bio-informatics/ Biotechnology/Molecular Biology and Biotechnology/Life Sciences/ Computer Sciences with specialization in Bio-informatics including relevant basic sciences with 8 years’ experience in the relevant subject as Scientist/Lecturer or in an equivalent position in the Pay Band- 3 of 15600-39100 with Grade Pay of 5400/6000/7000/8000 having made contribution to research/teachin/extension education as evidenced by published work/innovations and impact.

OR

Doctoral degree in the above subject(s) including relevant basic sciences with minimum 8 years’ experience of high quality post-doctoral research in an institution/organization as evidenced by at least 6 publications in journals with NAAS rating of 7.5 or above.

Desirable:
(i) Specialization and experience: Knowledge of software development and its application in crop bioinformatics, experience in handling ‘omies’data.
(ii) Teaching experience in relevant subject

The Secretary, Agricultural Scientists Recruitment Board, Indian Council of Agricultural Research Krishi Anusandhan Bhavan-I, Pusa New Delhi –110 012, India

Detailed eligibility criteria with how to apply information can be had at:
http://www.indiastudychannel.com/jobs/333467-Indian-Council-of-Agricultural-Research-looking-for-Assistant-Director-General.aspx

More at http://asrb.org.in/administrator/uploads_dir/1418978057english.pdf

]]> https://bioinformaticsonline.com/blog/view/38238/list-of-motif-discovery-tools Tue, 20 Nov 2018 03:54:26 -0600 https://bioinformaticsonline.com/blog/view/38238/list-of-motif-discovery-tools <![CDATA[List of motif discovery tools !]]>
In genetics, a sequence motif is a nucleotide or amino-acid sequence pattern that is widespread and has, or is conjectured to have, a biological significance. For proteins, a sequence motif is distinguished from a structural motif, a motif formed by the three-dimensional arrangement of amino acids which may not be adjacent.
 
Following are the list of tools for motif discovery:
 

Perform secondary structure predictions on protein sequences.

Find binding specificity information about DNA-protein complexes.

Find information about the binding specificity of DNA-binding proteins.

Use this web-based sequence motif visualization system to display sequence motif information in its appropriate three-dimensional (3D) context.

Protein function prediction and annotation in an integrated environment powered by web service.

Use to predict function from de novo protein sequences.

Search for short active protein sequences with demonstrated biological activities.

Search for ungapped segments corresponding to the most highly conserved regions of proteins.

Identify and measure surface accessible pockets as well as interior inaccessible cavities, for proteins and other molecules.

To search for catalytic residue annotation for enzymes in the Protein Data Bank.

Predict protein function using Gene Ontology.

Automatically calculate evolutionary conservation scores of key amino acid residues and map them on protein structures.

Mine the protein structure space.

Predict short linear motifs (3-8 residues) in a set of protein sequences.

A web client for visualizing protein sequence feature information using DAS.

Identify the domain architecture within a protein sequence.

Predict functional sites in eukaryotic proteins.

Use a collection of tools for protein analyses.

Predict potential protein post-translational modifications and find potential single amino acid substitutions in peptides.

Search for information related to the catalytic mechanisms of enzymes.

An integrated feature-based function prediction server for vertebrate proteomes.

Identify the closest matching PRINTS sequence motif fingerprints in a protein sequence.

Search for functional annotation of important sites in proteins with known structures.

Produce 3D conformations of small drug compounds.

A database presenting experiment-based results in human proteomics.

Conduct exhaustive intermediate profile searches of a set of homologous protein sequences.

Design protein mutations in site-directed mutagenesis.

Annotate protein using this integrated annotation resource.

Identify protein family (and DNA) domains, patterns, motifs, protein families, and functional sites.

Interactive forecasting of protein interaction hot spots.

Database containing pairs of structural analogs and their alignments.

Find sequence patterns in DNA and protein sequences.

A web server for knowledge-based modeling of protein-peptide complexes, specifically peptides in complex with major histocompatibility complex (MHC) proteins and kinases.

Find structural segments or motifs for protein structures.

Visualize protein sequence motifs on the 3D protein structures.

Find presence of any known protein motif (Prosite and Pfam) in a protein sequence.

Recognize spatial chemical binding patterns common to a set of protein structures.

Analyze proteins for the presence of N-terminal N-myristoylation site.

Find the presence of N-Glycosylation sites in human proteins.

Find the presence of O-GalNAc (mucin type) glycosylation sites in mammalian proteins.

Analyze eukaryotic proteins for the presence of serine, threonine and tyrosine phosphorylation sites.

Find possible kinase specific phosphorylation sites in eukaryotic proteins.

Predict cleavage sites at basic amino acid locations in neuropeptide precursor sequences.

Find information about patented nucleotide and protein sequences.

Search for information about glycoproteins with O-linked and C-linked glycosylation sites.

Find information about protein sequence annotations.

A server to predict protein active site residues.

Search for structural and functional information on the protein functional sites.

Search 3D protein fragments similar in structure to known active, binding and posttranslational modification sites.

Conduct genome wide functional and structural analysis.

Search for phosphorylation data of any protein of interest.

Search for information on prokaryotic proteins that undergo serine, threonine, or tyrosine phosphorylation.

Determine correct names for proteins.

Web application for predicting protein disorder by using physicochemical features and reduced amino acid set of a position-specific scoring matrix.

Find homologous protein-protein interactions across multiple species.

Search your query sequence against PROSITE pattern database for protein motifs.

Find information about protein-RNA complexes from the Protein Data Bank (PDB).

Identify protein families and domains for a given protein sequence.

A comprehensive database of pattern-recognition receptors and their ligands.

Search for short nucleotide or peptide sequences such as cis-elements in nucleotide sequences or small domains and motifs in protein sequences.

Database specialized in documenting human PPBD-containing proteins and PPBD-mediated interactions.

Predicts potential protease cleavage sites and sites cleaved by chemicals in a given protein sequence.

Predict combined transmembrane topology and signal peptides.

Search for eukaryotic phosphorylation sites.

Search for 3D structure and functional annotation of phosphorylation sites in proteins.

Search the database of in vivo phosphorylation sites of human and mouse proteins

Find information about polyglutamine (polyQ) repeats.

Find the presence of protein motifs and patterns in an amino acid sequence.

Predict signal peptide sequences and their cleavage positions in bacterial and eukaryotic amino acid sequences.

Predict protein functions based on known structures.

Predict the location of potential protein-protein binding sites for unbound proteins.

Identify short linear signatures in protein termini.

Analyze and identify newly obtained protein sequences.

Predict protein binding sites in a protein sequence based on geometrical analysis of protein tertiary substructures.

Search for evolutionarily conserved motif-like patterns in protein sequences.

Web-based server for analyzing and predicting RNA binding sites in proteins.

Search for similarities between proteins by simultaneous matching of multiple motifs.

Predict residues in protein sequences that determine the proteins' functional specificity.

Predict specificity-determining residues in protein families.

Find shared motifs in proteins with a common attribute.

Conduct in silico sumoylation sites prediction.

Search for motifs and patterns within protein sequences.

Search for motifs within proteins that are likely to be phosphorylated by specific protein kinases or bind to domains such as SH2 domains, 14-3-3 domains or PDZ domains.

Find information about populations carrying polymorphisms within protein binding pockets that make them susceptible to serious adverse drug reaction (SADR).

Search the presence of a motif in either amino acid sequence or nucleotide sequence.

Predict the presence of tyrosine sulfation sites in protein sequences

Look at protein structure from a ligand and binding site perspective.

Use a collection of bioinformatics tools at this portal site.

Find information about tandem repeats in proteins that carry fundamental biological functions and are related to a number of human diseases.

Find information about functional residues in alpha-helical and beta-barrel membrane proteins.

Database of domains and motifs with conservative location in transmembrane proteins.

Search for highly conserved and specific protein sequence motifs.

Predict functional sites in protein sequence alignments use different methodologies.

Find de novo protein motifs from chromatin immunoprecipitation data.

Scan query structures for functional sites in both proteins and nucleic acids.

Analyze quantitative structure-activity relationship of related protein families.

Search for ungapped alignments of highly conserved regions among a protein family or superfamily.

An expert system for predicting ligand-binding residues in protein structures.

Automatically identify spatially interacting motifs among distantly related proteins sharing similar folds and possessing common ancestral lineage.

]]> Neel