Rahul Nayak
A Bioinformatician
Our Sponsors
Related items
LAMSA: fast split read alignment with long approximate matches
By Jit 3005 days ago Comments (1)github.com - LAMSA (Long Approximate Matches-based Split Aligner) is a novel split alignment approach with faster speed and good ability of handling SV events. It is well-suited to align long reads (over thousands of base-pairs). LAMSA takes takes the...TULIP - The Uncorrected Long read Integration Pipeline
By Jit 3005 days agogithub.com - TULIP currently consists of two Perl scripts, tulipseed.perl and tulipbulb.perl. These are very much intended as prototypes, and additional components and/or implementations are likely to follow. Tulipseed takes as input alignments files of long...lordFAST: sensitive and Fast Alignment Search Tool for LOng noisy Read sequencing Data
By BioJoker 2809 days agogithub.com - lordFAST is a sensitive tool for mapping long reads with high error rates. lordFAST is specially designed for aligning reads from PacBio sequencing technology but provides the user the ability to change alignment parameters depending on the reads...IONiseR: tools for the quality assessment of data produced by Oxford Nanopore’s MinION sequencer
By Jit 3178 days agowww.bioconductor.org - This package is intended to provide tools for the quality assessment of data produced by Oxford Nanopore’s MinION sequencer. It includes a functions to generate a number plots for examining the statistics that we think will be useful for this...Now time is come to revolutionize amino acid sequencing by Nanopore technology
By Rahul Agarwal 4504 days agowww.eurekalert.org - Amino acid sequencing by Nanopore recognition tunneling method1mb long DNA with Nanopore technology
By Jit 3152 days agoLongest read of 1mb achievements with NanoporenpScarf: Scaffolding and Completing Assemblies in Real-time Fashion
By Jit 3362 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...Reference-free prediction of rearrangement breakpoint reads
By Neel 3073 days agocode.google.com - lideSort-BPR ( b reak p oint r eads) is based on a fast algorithm for all-against-all comparisons of short reads and theoretical analyses of the number of neighboring reads. When applied to a dataset with a sequencing...Circlator: automated circularization of genome assemblies using long sequencing reads
By Poonam Mahapatra 3005 days agosanger-pathogens.github.io - A tool to circularize genome assemblies. The algorithm and benchmarks are described in the Genome Biology manuscript. Citation: "Circlator: automated circularization of genome assemblies using long sequencing reads", Hunt et al, Genome Biology...
