Abhimanyu Singh
A bioinformatics beginner
Our Sponsors
Related items
Gblocks: eliminates poorly aligned positions and divergent regions of a DNA or protein alignment
By Poonam Mahapatra 2365 days agomolevol.cmima.csic.es - Gblocks eliminates poorly aligned positions and divergent regions of a DNA or protein alignment so that it becomes more suitable for phylogenetic analysis. This server implements the most important features of the Gblocks program to make its...Mulan: Multiple-sequence local alignment and visualization for studying function and evolution
By Jit 2282 days agowww.ncbi.nlm.nih.gov - Mulan: Multiple-sequence local alignment and visualization for studying function and evolution Mulan (http://mulan.dcode.org/), a novel method and a network server for comparing multiple draft and finished-quality sequences to identify functional...Cactus: a reference-free whole-genome multiple alignment program
By Jit 1929 days agogithub.com - 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...The wavefront alignment (WFA) algorithm
By BioStar 1608 days agogithub.com - The wavefront alignment (WFA) algorithm is an exact gap-affine algorithm that takes advantage ofhomologous regions between the sequences to accelerate the alignment process. As opposed to traditional dynamic programming algorithms that run in...GraphMap - A highly sensitive and accurate mapper for long, error-prone reads
By Jit 2725 days agogithub.com - GraphMap - A highly sensitive and accurate mapper for long, error-prone reads http://www.nature.com/ncomms/2016/160415/ncomms11307/full/ncomms11307.htmlFeatures Mapping position agnostic to alignment parameters. ...BASE: a practical de novo assembler for large genomes using long NGS reads
By Rahul Nayak 2226 days agogithub.com - new de novo assembler called BASE. It enhances the classic seed-extension approach by indexing the reads efficiently to generate adaptive seeds that have high probability to appear uniquely in the genome. Such seeds form the basis for BASE...Genome assembly tutorial "Genome Assembly for short and long reads"
By Jit 2134 days ago Comments (1)bioinformaticsdotca.github.io - In this lab we will perform de novo genome assembly of a bacterial genome. You will be guided through the genome assembly starting with data quality control, through to building contigs and analysis of the results. At the end of the lab you will...HECIL: A Hybrid Error Correction Algorithm for Long Reads with Iterative Learning
By Abhimanyu Singh 2152 days agogithub.com - HECIL—Hybrid Error Correction with Iterative Learning—a hybrid error correction framework that determines a correction policy for erroneous long reads, based on optimal combinations of decision weights obtained from short read...Nanopore adaptor !
By Jit 1754 days agogithub.com - Porechop is a tool for finding and removing adapters from Oxford Nanopore reads. Adapters on the ends of reads are trimmed off, and when a read has an adapter in its middle, it is treated as chimeric and chopped into separate reads....npScarf: Scaffolding and Completing Assemblies in Real-time Fashion
By Jit 2740 days agogithub.com - npScarf (jsa.np.npscarf) is a program that scaffolds and completes draft genomes assemblies in real-time with Oxford Nanopore sequencing. The pipeline can run on a computing cluster as well as on a laptop computer for microbial datasets. It...
