BOL: Related items

Dynamic Programming Alignment

Thu, 22 Aug 2013 09:38:28 -0500

lecture 9, Chem. C100, Spring 2013, UCLA

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/

YAHA

Jit — Fri, 20 Jan 2017 05:38:05 -0600

YAHA, a fast and flexible hash-based aligner. YAHA is as fast and accurate as BWA-SW at finding the single best alignment per query and is dramatically faster and more sensitive than both SSAHA2 and MegaBLAST at finding all possible alignments. Unlike other aligners that report all, or one, alignment per query, or that use simple heuristics to select alignments, YAHA uses a directed acyclic graph to find the optimal set of alignments that cover a query using a biologically relevant breakpoint penalty. YAHA can also report multiple mappings per defined segment of the query. We show that YAHA detects more breakpoints in less time than BWA-SW across all SV classes, and especially excels at complex SVs comprising multiple breakpoints.

Availability: YAHA is currently supported on 64-bit Linux systems. Binaries and sample data are freely available for download from http://faculty.virginia.edu/irahall/YAHA.

Contact:

http://genome.wustl.edu/people/groups/detail/hall-lab/

Address of the bookmark: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3463118/

MetaGraph: Ultra Scalable Framework for DNA Search, Alignment, Assembly

Abhi — Sat, 08 Jun 2024 16:15:25 -0500

The MetaGraph framework is designed to work with a wide range of input data sets, indexing from a few samples up to the contents of entire archives with hundreds of thousands of records. The indexing workflow always follows the same principle, transforming single input samples into error-removed, refined sample graphs, which are then merged into a joint metagraph index. Each input sample is annotated in the joint index as a subgraph. This graph index enriched with metadata can then be used for downstream applications such as sequence search or differential assembly.

Searcg link https://metagraph.ethz.ch/search

Pre-print https://www.biorxiv.org/content/10.1101/2020.10.01.322164v4

Address of the bookmark: https://metagraph.ethz.ch/

Genome Stability Laboratory

Mon, 07 Mar 2016 04:16:32 -0600

The bakers yeast, Saccharomyces cerevisiae is an ideal model organism to understand mechanisms of meiotic chromosome segregation. In S. cerevisiae and in mammals, the majority of meiotic crossovers are formed through a highly conserved MSH4p-MSH5p, MLH1p-MLH3p dependent pathway. We are interested in charactering the role of these complexes in crossover formation and distribution among all homolog pairs. Errors in this process are linked to congenital birth defects in humans such as Down's syndrome.Our laboratory is also interested in understanding the effect of genetic background on mutation rate variation using S. cerevisiae as a model. These studies are relevant for understanding cancer progression, genome evolution and architecture. We use high- throughput genomic methods as well as classical genetics to achieve these aims.

More at http://faculty.iisertvm.ac.in/~nishantkt/index.html

BioinfoLab

Fri, 25 Mar 2016 11:05:35 -0500

Laboratory of Statistics and Computational tools for Bioinformatics

The Laboratory of Statistics and Computational tools for Bioinformatics (BioinfoLab) is hosted at the Istituto per le Applicazioni del Calcolo "Mauro Picone" - CNR . The laboratory has been officially opened in 2012 with the support of Programma Operativo Nazionale "Ricerca e Competitività" 2007-2013 (PON "R&C"), and it incorporates several expertise and research activities started since 2007, and supported by several CNR projects. Main interest of BioinfoLab is to develop novel statistical methods and computational tools for the analysis of high dimensional data arising from "Multi-omics" applications. In particular, current activities involve the analysis of ChIP-seq and RNA-seq experiments.

More at http://bioinfo.na.iac.cnr.it/BioinfoLab/index.html

MUMmer4: A fast and versatile genome alignment system

Jit — Sat, 03 Feb 2018 04:59:17 -0600

MUMmer4, a substantially improved version of MUMmer that addresses genome size constraints by changing the 32-bit suffix tree data structure at the core of MUMmer to a 48-bit suffix array, and that offers improved speed through parallel processing of input query sequences. With a theoretical limit on the input size of 141Tbp, MUMmer4 can now work with input sequences of any biologically realistic length. We show that as a result of these enhancements, the nucmer program in MUMmer4 is easily able to handle alignments of large genomes;

Address of the bookmark: https://mummer4.github.io/

Katju Lab

Fri, 26 Feb 2016 03:25:32 -0600

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 natural, and genomes. Our research interests encompass a wide range of topics, including the evolution of organellar and nuclear genomes, gene duplication and the origin of novel function, and the fitness and phenotypic consequences of mutation in evolution. For details regards ongoing projects, please see the Research page.

http://katjulab.com/research.html

Spines

Jitendra Narayan — Tue, 09 Feb 2016 05:07:15 -0600

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, variation etc.), as well as specialized tool sets for various analyses. It also features three sequence alignment packages: Satsuma, a highly parallelized program for high-sensitivity, genome-wide synteny; Papaya, an all-purpose alignment tool for less diverged sequences; and SLAP, a context-sensitive local aligner for diverged sequences with large gaps.

Access Spines here.

http://www.broadinstitute.org/science/programs/genome-biology/spines

Address of the bookmark: http://www.broadinstitute.org/science/programs/genome-biology/spines

Advanced Bash-Scripting Guide

Jit — Thu, 18 Feb 2016 04:50:51 -0600

This tutorial assumes no previous knowledge of scripting or programming, yet progresses rapidly toward an intermediate/advanced level of instruction . . . all the while sneaking in little nuggets of UNIX® wisdom and lore. It serves as a textbook, a manual for self-study, and as a reference and source of knowledge on shell scripting techniques. The exercises and heavily-commented examples invite active reader participation, under the premise that the only way to really learn scripting is to write scripts.

This book is suitable for classroom use as a general introduction to programming concepts.

More at http://tldp.org/LDP/abs/html/

Address of the bookmark: http://tldp.org/LDP/abs/html/