github.com - R Package to visualize alignments between two or multiple DNA sequences includinga number of functionalities to facilitate processing of alignments in PAF format.
SVbyEye, an open-source R package to visualize and annotate sequence-to-sequence...
github.com - A JavaScript module for the visualization of genomic sequence graphs. It automatically generates a "tube map"-like visualization of sequence graphs which have been created with vg. (https://github.com/vgteam/vg)
Link to working demo:...
prakharg24.github.io - We demonstrate a novel approach forlocal alignment of DNA reads with respect to reference genome.For this process we have used Skip-gram model for creatingencoding(Nucl2Vec) and k-nearest neighbor for the alignment.With our new approach we have...
github.com - ALPACA requires Celera Assembler 8.3 or later. It is recommended to build Celera Assembler from source. (Why? The pre-built binaries CA_8.3rc1 and CA8.3rc2 will work for any large data set.
Detail paper...
The Basic Local Alignment Search Tool (BLAST) is a powerful bioinformatics program used to compare an input sequence (such as DNA, RNA, or protein sequences) against a database of sequences to find regions of similarity.
bigd.big.ac.cn - 2019nCoVR features comprehensive integration of genomic and proteomic sequences as well as their metadata information from the GISAID, NCBI, NMDC and CNCB/NGDC. It also incorporates a wide range of relevant information including scientific...
bioconductor.org - doubletrouble aims to identify duplicated genes from whole-genome protein sequences and classify them based on their modes of duplication. The duplication modes are i. segmental duplication (SD); ii. tandem duplication (TD); iii. proximal...
github.com - Cactus is a reference-free whole-genome multiple alignment program. The principal algorithms are described here: https://doi.org/10.1101/gr.123356.111
Cactus uses substantial resources. For primate-sized genomes (3 gigabases each), you should...
github.com - LTR_Finder is an efficient program for finding full-length LTR retrotranspsons in genome sequences.
The Program first constructs all exact match pairs by a suffix-array based algorithm and extends them to long highly similar pairs. Then...