BOL: Related items

Qualimap2: Evaluating next generation sequencing alignment data

Jit — Tue, 11 Sep 2018 04:44:29 -0500

Qualimap 2 is a platform-independent application written in Java and R that provides both a Graphical User Inteface (GUI) and a command-line interface to facilitate the quality control of alignment sequencing data and its derivatives like feature counts.

Supported types of experiments include:

Whole-genome sequencing
Whole-exome sequencing
RNA-seq (speical mode available)
ChIP-seq

Address of the bookmark: http://qualimap.bioinfo.cipf.es/

SeqMule: Automated human exome/genome variants detection

Abhimanyu Singh — Tue, 07 Mar 2017 10:12:36 -0600

SeqMule takes single-end or paird-end FASTQ or BAM files, generates a script consisting of more than 10 popular alignment, analysis tools and runs the script line by line. Users can change the pipeline or fine-tune the parameters by modifying its configuration file. SeqMule also has some built-in functions, such as pooling consensus calls from various callers, plotting a Venn diagram showing intersection among different callers, and downloading databases. SeqMule can be used for both Mendelian disease study and cancer genome study.

Address of the bookmark: http://seqmule.openbioinformatics.org/en/latest/

Cactus: a reference-free whole-genome multiple alignment program

Jit — Mon, 12 Aug 2019 07:52:33 -0500

Cactus is a reference-free whole-genome multiple alignment program. The principal algorithms are described here: https://doi.org/10.1101/gr.123356.111

Cactus uses substantial resources. For primate-sized genomes (3 gigabases each), you should expect Cactus to use approximately 120 CPU-days of compute per genome, with about 120 GB of RAM used at peak. The requirements scale roughly quadratically, so aligning two 1-megabase bacterial genomes takes only 1.5 CPU-hours and 14 GB RAM.

Address of the bookmark: https://github.com/ComparativeGenomicsToolkit/cactus

HTSlib

Jit — Wed, 15 Mar 2017 11:38:05 -0500

Samtools is a suite of programs for interacting with high-throughput sequencing data. It consists of three separate repositories:

Samtools: Reading/writing/editing/indexing/viewing SAM/BAM/CRAM format
BCFtools: Reading/writing BCF2/VCF/gVCF files and calling/filtering/summarising SNP and short indel sequence variants
HTSlib: A C library for reading/writing high-throughput sequencing data

Samtools and BCFtools both use HTSlib internally, but these source packages contain their own copies of htslib so they can be built independently.

Address of the bookmark: http://www.htslib.org/

The wavefront alignment (WFA) algorithm

BioStar — Sun, 28 Jun 2020 10:17:50 -0500

The wavefront alignment (WFA) algorithm is an exact gap-affine algorithm that takes advantage of
homologous regions between the sequences to accelerate the alignment process. As opposed to traditional dynamic programming algorithms that run in quadratic time, the WFA runs in time O(ns), proportional to the read length n and the alignment score s, using O(s^2) memory. Moreover, the WFA exhibits simple data dependencies that can be easily vectorized, even by the automatic features of modern compilers, for different architectures, without the need to adapt the code.

Address of the bookmark: https://github.com/smarco/WFA

JSON

Abhimanyu Singh — Tue, 04 Apr 2017 08:02:39 -0500

JSON (JavaScript Object Notation) is a lightweight data-interchange format. It is easy for humans to read and write. It is easy for machines to parse and generate. It is based on a subset of the JavaScript Programming Language, Standard ECMA-262 3rd Edition - December 1999. JSON is a text format that is completely language independent but uses conventions that are familiar to programmers of the C-family of languages, including C, C++, C#, Java, JavaScript, Perl, Python, and many others. These properties make JSON an ideal data-interchange language.

JSON is built on two structures:

A collection of name/value pairs. In various languages, this is realized as an object, record, struct, dictionary, hash table, keyed list, or associative array.
An ordered list of values. In most languages, this is realized as an array, vector, list, or sequence.

These are universal data structures. Virtually all modern programming languages support them in one form or another. It makes sense that a data format that is interchangeable with programming languages also be based on these structures.

Address of the bookmark: http://json.org/

Lifemap

Jit — Mon, 10 Apr 2017 05:42:37 -0500

Lifemap is an interactive tool to explore the WHOLE NCBI TAXONOMY. The concept used in Lifemap is similar to the one used in cartography with tools like Google Maps© or Open Street Maps: exploring is done by zooming and panning.

The current tree contains ALL species present in NCBI taxonomy as of October 18th, 2016: 1,135,169 species including 10,545 Archaea, 418,777 Bacteria and 705,847 Eukaryotes. The Lifemap tree is updated every two weeks.

All the nodes in the tree are clickable. This displays various information and options:

The species name (and the associated common name if there is one)
The rank (kingdom, family, class, species...)
Ability to go to the corresponding node/species on NCBI web site (displayed in a new window)
Possibility to download the corresponding subtree in newick extended format
Possibilty to get the whole lineage from the current node/tip to the root of the tree.

Address of the bookmark: http://lifemap-ncbi.univ-lyon1.fr/

Python vs Perl

Rahul Agarwal — Thu, 11 Jul 2013 14:39:19 -0500

Why bioinformatician still using Perl when Python is easy to code, good in ReXp and faster than perl?

ChromHMM: Chromatin state discovery and characterization

Abhimanyu Singh — Wed, 19 Apr 2017 04:06:23 -0500

ChromHMM is software for learning and characterizing chromatin states. ChromHMM can integrate multiple chromatin datasets such as ChIP-seq data of various histone modifications to discover de novo the major re-occuring combinatorial and spatial patterns of marks. ChromHMM is based on a multivariate Hidden Markov Model that explicitly models the presence or absence of each chromatin mark. The resulting model can then be used to systematically annotate a genome in one or more cell types. By automatically computing state enrichments for large-scale functional and annotation datasets ChromHMM facilitates the biological characterization of each state. ChromHMM also produces files with genome-wide maps of chromatin state annotations that can be directly visualized in a genome browser.

Address of the bookmark: http://compbio.mit.edu/ChromHMM/

Junior Research Fellow (JRF)

Sat, 13 Jul 2013 11:17:22 -0500

School of Biotechnology
Gautam Buddha University
Greater Noida, UP - 201310

Applications are invited for one position of Junior Research Fellow (JRF) in a Department of Biotechnology (DBT) sponsored research project entitled “Design, synthesis and evaluation of potent aminopeptidase inhibitors for malarial therapy” under the supervision of Dr. Shakti Sahi.

The monthly fellowship of JRF will be Rs 12,000/- plus HRA as per the University rules.

Essential Qualification: Master degree in any discipline of Life Science with NET qualified.

Desirable Qualification: Preference will be given to candidates having research experience in in silico drug designing/Bioinformatics.

Interested candidates may send their resume to undersigned on or before 14th July 2013 by post-mail/e-mail shaktis@gbu.ac.in or shaktisahi@gmail.com. No TA and DA will be paid for appearing for the interview. Dr. Shakti Sahi (Principle Investigator)

Advertisement:
www.gbu.ac.in/Recruitment/JRF_Advt_DBTProject_Shakt