Jit
Enthusiast computational biologist with business dream !!!
Our Sponsors
Related items
jackalope: A swift, versatile phylogenomic and high-throughput sequencing simulator
By Abhimanyu Singh 2514 days agogithub.com - jackalope simply and efficiently simulates (i) variants from reference genomes and (ii) reads from both Illumina and Pacific Biosciences (PacBio) platforms. It can either read reference genomes from FASTA files or simulate new ones. Genomic variants...genomics public data links !
By Jit 2312 days agoconsole.cloud.google.com - List of publically available databases on google server. More at https://software.broadinstitute.org/gatk/download/bundle ftp://ftp.ncbi.nlm.nih.gov/snp/organisms/human_9606/VCF/GATK/. ftp://ftp.broadinstitute.org/bundle/hg38/hg38bundle/ReMILO: reference assisted misassembly detection algorithm using short and long reads.
By Jit 2899 days agogithub.com - ReMILO, a reference assisted misassembly detection algorithm that uses both short reads and PacBio SMRT long reads. ReMILO aligns the initial short reads to both the contigs and reference genome, and then constructs a novel data structure called...Multi-CAR: a tool of contig scaffolding using multiple references
By Rahul Nayak 3021 days agogenome.cs.nthu.edu.tw - we design a simple heuristic method to further revise our single reference-based scaffolding tool CAR into a new one called Multi-CAR such that it can utilize multiple complete genomes of related organisms as references to more accurately order and...Omega2: metagenome assembly pipeline
By Jit 3260 days agoomega.omicsbio.org - Omega found overlaps between reads using a prefix/suffix hash table. The overlap graph of reads was simplified by removing transitive edges and trimming short branches. Unitigs were generated based on minimum cost flow analysis of the overlap graph...miniasm: very fast OLC-based de novo assembler for noisy long reads
By Jit 3120 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...RGFA: powerful and convenient handling of assembly graphs
By Rahul Nayak 3061 days ago Comments (1)www.ncbi.nlm.nih.gov - RGFA, an implementation of the proposed GFA specification in Ruby. It allows the user to conveniently parse, edit and write GFA files. Complex operations such as the separation of the implicit instances of repeats and the merging of linear paths can...Cerulean: A hybrid assembly using high throughput short and long reads
By Rahul Nayak 2930 days agosourceforge.net - Cerulean extends contigs assembled using short read datasets like Illumina paired-end reads using long reads like PacBio RS long reads. Cerulean v0.1 has been implemented with bacterial genomes in mind. The method is fully described in...FinisherSC:a repeat-aware tool for upgrading de novo assembly using long reads
By Jit 2854 days agogithub.com - Here is the command to run the tool: python finisherSC.py destinedFolder mummerPath If you are running on server computer and would like to use multiple threads, then the following commands can generate 20 threads to run FinisherSC. python...StringTie Transcript assembly and quantification for RNA-Seq
By Jit 2195 days agoccb.jhu.edu - StringTie is a fast and highly efficient assembler of RNA-Seq alignments into potential transcripts. It uses a novel network flow algorithm as well as an optional de novo assembly step to assemble and quantitate full-length...
