BOL: Related items

Surrogate Variable Analysis (SVA)

Jit — Thu, 30 Oct 2014 08:01:58 -0500

The sva package contains functions for removing batch effects and other unwanted variation in high-throughput experiment. Specifically, the sva package contains functions for the identifying and building surrogate variables for high-dimensional data sets. Surrogate variables are covariates constructed directly from high-dimensional data (like gene expression/RNA sequencing/methylation/brain imaging data) that can be used in subsequent analyses to adjust for unknown, unmodeled, or latent sources of noise. The sva package can be used to remove artifacts in three ways:

(1) identifying and estimating surrogate variables for unknown sources of variation in high-throughput experiments (Leek and Storey 2007 PLoS Genetics,2008 PNAS),

(2) directly removing known batch effects using ComBat (Johnson et al. 2007 Biostatistics) and

(3) removing batch effects with known control probes (Leek 2014 biorXiv).

Removing batch effects and using surrogate variables in differential expression analysis have been shown to reduce dependence, stabilize error rate estimates, and improve reproducibility, see (Leek and Storey 2007 PLoS Genetics, 2008 PNAS or Leek et al. 2011 Nat. Reviews Genetics).

More at http://www.bioconductor.org/packages/release/bioc/html/sva.html

Zhang Lab

Sun, 28 Dec 2014 12:43:08 -0600

We develop and use integrative bioinformatics approaches to extract biological meanings from experimental data and generate hypotheses for experimental validation. Please explore our website to learn more about our people and our research.

More at http://bioinfo.vanderbilt.edu/zhanglab/

Narcis Fernandez-Fuentes Lab

Mon, 25 May 2015 07:30:00 -0500

Welcome to our web-site compiling all the research-related activities of the group. Our research interests relate to a number of areas within Bioinformatics. We have a long-standing interest in protein structure prediction and structure-to-function relationships. We work in the study of biomolecular interactions, modeling of protein complexes, the study and characterization of protein-protein interactions, peptide design, modeling of genetic variation, structure-based protein design and different aspects of Plant Bioinformatics. Take a look at the our databases and servers and the list of publications for more information.

More at http://www.bioinsilico.org/

X. Shirley Liu Lab

Tue, 26 May 2015 17:28:23 -0500

The research in our laboratories are focused on the following three areas:

Bioinformatics
Cancer
Epigenetics

More at http://liulab.dfci.harvard.edu/

BISR Jaipur

Tue, 07 Jul 2015 23:12:26 -0500

The Bioinformatics Centre at BISR has created an infrastructure for providing facilities to the users working in the field of Biological Sciences. The users of Rajasthan, Jaipur in particular, are using facilities available at the Bioinformatics Centre extensively. The centre has leased line Internet connection as well latest Bioinformatics software for sequence and structure analysis. The centre provides the following services:

Bioinformatics supports to researchers
Customized training in Bioinformatics for researchers and faculty members
Support in Installing, implementing and maintaining software on computer.
Create awareness for taking preventive measure against data security
Organize workshops on thrust ares of Bioinformatics
Research Training to students of Biotechnology and Bioinformatics

More at http://bioinfo.bisr.res.in/index.php

liftover

Jitendra Narayan — Mon, 08 Feb 2016 15:45:03 -0600

Convenient conversions between genome assemblie. The liftover package makes it easy to remap genomic coordinates to a different genome assembly.

More at https://github.com/aaronwolen/liftover

https://www.bioconductor.org/help/workflows/liftOver/

Address of the bookmark: https://github.com/aaronwolen/liftover

SATSUMA : Highly sensitive whole-genome synteny alignments.

Jit — Fri, 13 May 2016 05:25:26 -0500

Satsuma is a whole-genome synteny alignment program. It takes two genomes, computes alignments, and then keeps only the parts that are orthologous, i.e. following the conserved order and orientation of features, such as protein coding genes, non-coding genes, or neutral sequences. Satsuma does not require any pre-processing, such as repeat masking, since it will automatically detect ambiguous mappings.

Satsuma has parallelization built-in and is designed to run on multi-core architectures. The run-time for aligning two bird-size genomes (~1.2 Gb) is around two days on 24 CPUs.

You can find the manual here.
Download the latest source code from here.
Stable versions can also be downloaded from the Broad Institute's web site.

An incomplete list of questions and answers (yes, these have really been asked by our users! Please feel free to add your own by e-mailing us) is here.

If you use Satsuma in your research, please cite:
Grabherr, M. G., Russell, P., Meyer, M., Mauceli, E., Alföldi, J., Di Palma, F., & Lindblad-Toh, K. (2010). Genome-wide synteny through highly sensitive sequence alignment: Satsuma. Bioinformatics, 26(9), 1145-51.

Tutorial at http://evomics.org/learning/genomics/satsuma/

Address of the bookmark: http://satsuma.sourceforge.net/

Method in Comparative genomics !!

Jit — Wed, 09 Nov 2016 16:29:24 -0600

We present methods for the automatic determination of genome correspondence. The algorithms enabled the automatic identification of orthologs for more than 90% of genes and intergenic regions across the four species despite the large number of duplicated genes in the yeast genome. The remaining ambiguities in the gene correspondence revealed recent gene family expansions in regions of rapid genomic change.

We present methods for the identification of protein-coding genes based on their patterns of nucleotide conservation across related species. We observed the pressure to conserve the reading frame of functional proteins and developed a test for gene identification with high sensitivity and specificity. We used this test to revisit the genome of S. cerevisiae, reducing the overall gene count by 500 genes (10% of previously annotated genes) and refining the gene structure of hundreds of genes. We present novel methods for the systematic de novo identification of regulatory motifs. The methods do not rely on previous knowledge of gene function and in that way differ from the current literature on computational motif discovery. Based on the genome-wide conservation patterns of known motifs, we developed three conservation criteria that we used to discover novel motifs. We used an enumeration approach to select strongly conserved motif cores, which we extended and collapsed into a small number of candidate regulatory motifs. These include most previously known regulatory motifs as well as several noteworthy novel motifs. The majority of discovered motifs are enriched in functionally related genes, allowing us to infer a candidate function for novel motifs.

Our results demonstrate the power of comparative genomics to further our understanding of any species. Our methods are validated by the extensive experimental knowledge in yeast, and will be invaluable in the study of complex genomes like that of human.

Address of the bookmark: http://web.mit.edu/manoli/www/publications/Kellis_JCB_04.pdf

DIYA: a bacterial annotation pipeline for any genomics lab

Jit — Fri, 30 Jun 2017 08:48:26 -0500

DIY Genomics is an open source bioinformatics consortium intended to bring a collection of tools and libraries into the hands of small scale genomics labs for the process of sequence assembly and annotation. Projects include DIYA, MGAP, CRISPR, and DIYGV

http://gmod.org/wiki/Diya

Address of the bookmark: https://sourceforge.net/projects/diyg/

TeachEnG: Teaching Engine for Genomics

Jit — Wed, 13 Dec 2017 17:55:23 -0600

TeachEnG (pronounced “teaching”), a Teaching Engine for Genomics, provides educational games to help students and researchers understand key bioinformatics concepts. The current version includes interactive modules for sequence alignment and phylogenetic tree reconstruction algorithms, with accompanying video tutorials.

Please contact us via email (knoweng@illinois.edu) if you have any questions or suggestions.

Address of the bookmark: http://teacheng.illinois.edu/