BOL

github.com - Generate unique k-mers for every contig in a FASTA file. Unique k-mer is consisted of k-mer keys (i.e. ATCGATCCTTAAGG) that are only presented in one contig, but not presented in any other contigs (for both forward and reverse strands). This tool...

www.genome.gov - This meeting's objective was to obtain a big picture look at the current state of the field of comparative genomics with a focus on commonalities across genomic investigations into humans, model organisms (both traditional and...

https://genomes.atcc.org/ - The ATCC Genome Portal (AGP, https://genomes.atcc.org/) is a database of authenticated genomes for bacteria, fungi, protists, and viruses held in ATCC’s biorepository. It now includes 3,938 assemblies (253% increase) produced under ISO...

Cost-effective whole human genome sequencing has revolutionized the landscape of genetic research and personalized medicine by making comprehensive genetic analysis accessible to a wider population. Through advancements in sequencing technologies,...

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...

github.com - Filtering on quality and/or read length, and optional trimming after passing filters.Reads from stdin, writes to stdout. Intended to be used: directly after fastq extraction prior to mapping in a stream between extraction and...

github.com - #Running TULIP (The Uncorrected Long-read Integration Process), version 0.4 late 2016 (European eel) TULIP currently consists of to Perl scripts, tulipseed.perl and tulipbulb.perl. These are very much intended as prototypes, and additional...

github.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...

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...

bowtie2 -x hs37m -X 650 -q -1 r1.fq -2 r2.fq -S r12.bowtie2.sam bwa aln hs37m.fa r1.fq > r1.sai && bwa aln hs37m.fa r2.fq > r2.sai \ && bwa sampe hs37m r1.sai r2.sai r1.fq r2.fq > r12.bwa.sam bwa bwasw...