BOL

To decide which strategy should be our “preferred” genome assembly approach based on data rather than my gut-feeling about the “best assembly” I decided to do some testing with a known “true” reference E Coli K12 MG1655

shendurelab.github.io - LACHESIS is method that exploits contact probability map data (e.g. from Hi-C) for chromosome-scale de novo genome assembly. Further information about LACHESIS, including source code, documentation and a user's guide are available...

Bioinformatics tools

The study of biological pathways is a key to understand the different processes inside a cell: proteins exert their function not in isolation but in a tightly controlled network of interactions and reactions. Activation of a pathway typically leads...

samtools.sourceforge.net - In current genome era, our day to day work is to handle the huge geneome sequences, expression data, several other datasets. This link provide a comprehensive list of commonly used sofware/tools.

pevsnerlab.kennedykrieger.org - DRAGON: Database Referencing of Array Genes Online SNOMAD: Standardization and Normalization of Microarray Data SNPduo: SNP Analysis Between Two Individuals SNPtrio: Analyzing and Visualizing and Inheritance Patterns in Trios SNPscan: Data...

arthropods.eugenes.org - EvidentialGene is a genome informatics project, "Evidence Directed Gene Construction for Eukaryotes", to construct high quality, accurate gene sets for animals and plants, developed by Don Gilbert at Indiana University,...

www.broadinstitute.org - Spines Spines is a collection of software tools, developed and used by the Vertebrate Genome Biology Group at the Broad Institute. It provides basic data structures for efficient data manipulation (mostly genomic sequences, alignments,...

TheLab seek to understand the genetic factors contributing to genomic variation and phenotypic diversity. To this end, we employ molecular and bioinformatic tools to study evolutionary processes at the level of populations, both experimental and...

In graph theory, a string graph is an intersection graph of curves in the plane; each curve is called a "string". String graphs were first proposed by E. W. Myers in a 2005 publication.