BOL: Related items

MetaPred2CS

Manisha Mishra — Fri, 03 Mar 2017 05:15:07 -0600

MetaPred2CS Web server is a meta-predictor based on Support Vector Machine (SVM) that combines 6 individual sequence based protein-protein interaction prediction methods to predict prokaryotic two-component system protein-protein interactions (PPIs). The methods implemented in MetaPred2CS are 2 co-evolutionary methods: in-silico two hybrid (i2h) and mirror tree (MT) methods and 4 genomics context based methods: phylogenetic profiling (PP), gene fusion (GF), gene neighbourhood (GN) and and gene operon methods (GO).

http://metapred2cs.ibers.aber.ac.uk/

Address of the bookmark: https://github.com/martinjvickers/MetaPred2CS

Genome Workbench 2.10.7

Gudiya Pal — Fri, 01 Jul 2016 12:09:59 -0500

Genome Workbench 2.10.7 is here! New features include added support for local custom BLAST databases and improvements to Tree View.

For the full list of features, improvements and fixes, see the release notes:https://ncbi.nlm.nih.gov/tools/gbench/releasenotes

New Features

BLAST Tool: added support for local custom BLAST databases
Graphical Sequence View: added log scaling option for graph tracks
Generic Table View: new tutorial added

Bug Fixes and Improvements

Project Tree View: Genomic Collections/Assemblies now show accessions, not just names
Tree View: layout updated to better accommodate nodes of different sizes
Table Import Dialog (MacOS): fixed issue with table visibility
Fixed bug where different molecules IDs in GenBank could resolve to the same sequence
Graphical Sequence View: fixed issue where sequence track was not shown for some sequences
Graphical Sequence View: fixed protein coloration methods
Graphical Sequence View: improved rendering of Markers to better indicate boundaries and produce higher quality PDF images
Create Gene Model tool: fixed scenario when gene model tool failed with local sequences
Search View: ORF Finder – fixed incorrect protein lengths
Fixed bug with not opening project file (.gbp) on a click
Fixed issues in GVF import
Fixed BLAST Search tool against NCBI databases not working
Fixed tblastn (protein BLAST) not working in standalone mode
Fixed GTF export failure

HOMER: Software for motif discovery and next-gen sequencing analysis

Neel — Tue, 26 Apr 2016 03:48:23 -0500

This tutorial covers topics independently of HOMER, and represents knowledge which is important to know before diving head first into more advanced analysis tools such as HOMER.

Setting up your computing environment
Retrieving and storing sequencing files (your own data or from public sources)
Checking sequence quality, trimming, general sequence manipulation
Mapping reads to a reference genome
Manipulating SAM/BAM alignment files
Visualizing data in a genome browser

RNA-Seq

Microarray

Basic analysis of Affymetrix Gene Expression Arrays using R/Bioconductor

General Tips for Data Analysis

Excel workarounds, adding gene annotation, X-Y plots tips, etc.

Address of the bookmark: http://homer.salk.edu/homer/basicTutorial/

YASS :: genomic similarity search tool

Jit — Mon, 02 May 2016 09:26:00 -0500

YASS is a genomic similarity search tool, for nucleic (DNA/RNA) sequences in fasta or plain text format (it produces local pairwise alignments). Like most of the heuristic pairwise local alignment tools for DNA sequences (FASTA, BLAST, PATTERNHUNTER, BLASTZ/LASTZ, LAST ...), YASS uses seeds to detect potential similarity regions, and then tries to extend them to local alignments. This genomic search tool uses multiple transition constrained spaced seeds that enable to search more fuzzy repeats, as non-coding DNA/RNA. Another simple, but interesting feature is that you can specify the seed pattern used in the search step (as provided for example by iedera).

Main features of YASS are:

multiple, possibly overlapping seeds and a new hit criterion to ensure a good sensitivity/selectivity trade-off
transition-constrained spaced seeds to improve sensitivity (transition mutations are purine to purine [A<->G] or pyrimidine to pyrimidine [C<->T])
using different scoring schemes with bit-score and E-value evaluated according to the sequence background frequencies
parameterizable output filter for low complexity repeats
reporting of various alignment statistical parameters (mutation bias along triplets, transition/transversion)
post-processing step to group gapped alignments

Address of the bookmark: http://bioinfo.lifl.fr/yass/

Statistics and probability

Jit — Tue, 08 Nov 2016 07:34:25 -0600

Topics

Displaying and describing data

Modeling distributions of data

Describing relationships in quantitative data

Designing studies

Probability

Random variables

Sampling distributions

Confidence intervals (one sample)

Significance tests (one sample)

Significance tests and confidence intervals (two samples)

Inference for categorical data (chi-square tests)

Advanced regression (inference and tran

Address of the bookmark: https://www.khanacademy.org/math/statistics-probability

Andi

Jit — Fri, 13 May 2016 05:16:35 -0500

This is the andi program for estimating the evolutionary distance between closely related genomes. These distances can be used to rapidly infer phylogenies for big sets of genomes. Because andi does not compute full alignments, it is so efficient that it scales even up to thousands of bacterial genomes.

This readme covers all necessary instructions for the impatient to get andi up and running. For extensive instructions please consult the manual.

More at https://github.com/evolbioinf/andi/

Address of the bookmark: http://bioinformatics.oxfordjournals.org/content/early/2015/01/13/bioinformatics.btu815.full

E-MEM: Efficient computation of Maximal Exact Matches

Jit — Thu, 15 Dec 2016 09:30:43 -0600

E-MEM is a C++/OpenMP program designed to efficiently compute MEMs between large genomes. See the README file for instructions on how to use E-MEM.

E-MEM source code

The source code can be downloaded here.

If you use E-MEM, please cite:

N. Khiste, L. Ilie, E-MEM: Efficient computation of Maximal Exact Matches for very large genomes, Bioinformatics 31(4) (2015) 509 -- 514.

For any questions, please contact Lucian Ilie: ilie@uwo.ca

Address of the bookmark: http://www.csd.uwo.ca/~ilie/E-MEM/

Stampy

Abhi — Fri, 20 May 2016 19:13:32 -0500

Stampy is a package for the mapping of short reads from illumina sequencing machines onto a reference genome. It's recommended for most workflows, including those for genomic resequencing, RNA-Seq and Chip-seq. Stampy excels in the mapping of reads containing that contain sequence variation relative to the reference, in particular for those containing insertions or deletions.

Address of the bookmark: http://www.well.ox.ac.uk/project-stampy

Mercator

Jit — Mon, 06 Feb 2017 04:20:36 -0600

Our basic strategy in building homology maps is to use exons that are orthologous in multiple genomes as map "anchors." Given K genomes, the steps in the map construction are as follows:

For each genome, obtain a set of exon annotations. These annotations can be a combination of both exon predictions (e.g. Genscan) and annotations that have been experimentally verified (e.g. RefSeq). Ideally, we would like to have these annotations be as sensitive as possible. Specificity is not a concern, as incorrect annotations are not likely not have significant alignments with other gene annotations.
Compare all exons against all exons in other genomes and record significant alignments between exons. Currently, we use BLAT to do this all-vs-all comparison with alignments being performed in protein space.
Construct a graph with each vertex corresponding to a exon and edges between vertices whose corresponding exons have significant alignments.
Identify cliques in this graph. These cliques are potential anchors to be used in the map.
Starting with the largest cliques (those that have exons in all or most of the genomes), join neighboring (adjacent in genomic coordinates, in each genome) cliques to form runs. Smaller cliques that are inconsistent with runs formed by larger cliques are filtered out. After the smallest cliques have been considered, cliques that are not part of a run are discarded.
The extents of each run in each genome are outputted as orthologous segments. The cliques from each run are used to output the exact genomic coordinates of anchors within each orthologous segment. These anchors can be used by genomic alignment programs (such as MAVID) to do a detailed alignment of each orthologous segment.

https://www.biostat.wisc.edu/~cdewey/mercator/

Address of the bookmark: https://www.biostat.wisc.edu/~cdewey/mercator/

4DGenome

Jitendra Narayan — Mon, 04 Jul 2016 00:44:55 -0500

Records in 4DGenome are compiled through comprehensive literature curation of experimentally-derived and computationally-predicted interactions. The current release contains 4,433,071 experimentally-derived and 3,605,176 computationally-predicted interactions in 5 organisms. Experimental data cover both high throughput datasets and individiual focused studies.

All interaction data are freely available in a standardized file format. Records can be queried by genomic regions, gene names, organism, and detection technology.

Address of the bookmark: http://4dgenome.research.chop.edu/