Rahul Nayak
A Bioinformatician
Our Sponsors
Related items
LSC: Improving PacBio Long Read Accuracy by Short Read Alignment
By Abhimanyu Singh 2952 days agowww.healthcare.uiowa.edu - Added Command line argument support. Multi-stage execution modes. Support for parallelization. Now execution proceeds in batches of long reads the size of which can be set by --long_read_batch_size N. Better compressed intermediate files. Added...SPAdes
By Abhimanyu Singh 3822 days ago Comments (1)bioinf.spbau.ru - SPAdes – St. Petersburg genome assembler – is intended for both standard isolates and single-cell MDA bacteria assemblies. This manual will help you to install and run SPAdes. SPAdes version 3.7.1 was released under GPLv2 on March 8,...CABOG: Celera Assembler with Best Overlap Graph
By Abhimanyu Singh 3431 days agowww.jcvi.org - CABOG (Celera Assembler with Best Overlap Graph) is scientific software for DNA research. CABOG has been a critical component of many genome sequencing projects. CABOG operates on small genomes such as bacterial as well as large genomes such as...Wtdbg2: a de novo sequence assembler for long noisy reads produced by PacBio or Oxford Nanopore
By Neel 2909 days agogithub.com - Wtdbg2 is a de novo sequence assembler for long noisy reads produced by PacBio or Oxford Nanopore Technologies (ONT). It assembles raw reads without error correction and then builds the consensus from intermediate assembly output. Wtdbg2...HASLR: a hybrid assembler which uses both second and third generation sequencing reads
By BioStar 2346 days agogithub.com - HASLR, a hybrid assembler which uses both second and third generation sequencing reads to efficiently generate accurate genome assemblies. Our experiments show that HASLR is not only the fastest assembler but also the one with the lowest number of...miniasm: very fast OLC-based de novo assembler for noisy long reads
By Jit 3235 days agogithub.com - Miniasm is a very fast OLC-based de novo assembler for noisy long reads. It takes all-vs-all read self-mappings (typically by minimap) as input and outputs an assembly graph in the GFA format. Different from mainstream...PEAR
By Jit 3578 days agosco.h-its.org - PEAR is an ultrafast, memory-efficient and highly accurate pair-end read merger. It is fully parallelized and can run with as low as just a few kilobytes of memory. PEAR evaluates all possible paired-end read overlaps and without requiring the...De novo Genome Assembly for Illumina Data
By Rahul Nayak 2451 days agowww.melbournebioinformatics.org.au - Written and maintained by Simon Gladman - Melbourne Bioinformatics (formerly VLSCI) Protocol Overview / Introduction In this protocol we discuss and outline the process of de novo assembly for small to medium sized...HapSolo: An optimization approach for removing secondary haplotigs during diploid genome assembly...
By Jit 2171 days agogithub.com - Despite marked recent improvements in long-read sequencing technology, the assembly of diploid genomes remains a difficult task. A major obstacle is distinguishing between alternative contigs that represent highly heterozygous regions. If primary...MIKE: an ultrafast, assembly-, and alignment-free approach for phylogenetic tree construction
By Abhi 911 days agogithub.com - MIKE (MinHash-based k-mer algorithm). This algorithm is designed for the swift calculation of the Jaccard coefficient directly from raw sequencing reads and enables the construction of phylogenetic trees based on the resultant Jaccard...
