BOL

webchem.ncbr.muni.cz - Local sequence alignment is a cornerstone of bioinformatics, allowing to compare the amino-acid sequences of different proteins, or the nucleotide sequences of different pieces of DNA. The Basic Local Alignment Search Tool (BLAST) has revolutionized...

github.com - Scripts for the analysis of HGT in genome sequence data

Ancestral sequence reconstruction (ASR) – also known as ancestral gene/sequence reconstruction/resurrection – is a technique used in the study of molecular evolution. The method consists of the synthesis of an...

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

tritexassembly.bitbucket.io - The pipeline is open-source and hosted in a public Bitbucket repository. TRITEX has been run on highly inbred genotypes of barley (Hordeum vulgare), tetraploid wheat (Triticum turgidum) and hexaploid wheat (T. aestivum) with reasonable...

github.com - GFA (Graphical Fragment Assembly) is an emerging standard format for representing sequence graphs. Although it was originally conceived as a format for sequence assembly (hence the name), and this remains its core application, it is more general,...

Submit your SARS-CoV-2 sequence data to GenBank and SRA with our new submission landing page.

help.rc.ufl.edu - More at https://help.rc.ufl.edu/doc/Kmer This also includes: A2Amapper: ATAC, Assembly to Assembly Comparision tool: Comparative mapping between two genome assemblies (same species), or between two different genomes (cross...

compbio.case.edu - Seal is a comprehensive sequencing simulation and alignment tool evaluation suite. This software (implemented in Java) provides several utilities that can be used to evaluate alignment algorithms, including: Reading a pre-existing reference...

ivory.idyll.org - DNA k-mers underlie much of our assembly work, and we (along with many others!) have spent a lot of time thinking about how to store k-mer graphs efficiently, discard redundant data, and count them efficiently. More recently, we've...