BOL: Related items

VCF2PopTree: a client-side software to construct population phylogeny from genome-wide SNPs

Surabhi Chaudhary — Sat, 25 Dec 2021 00:13:31 -0600

VCF2PopTree is a client-side software written in Javascript and it runs purely within the user’s computer/browser. VCF2PopTree is compatible with all population browsers including Chrome, Opera, Edge and Firefox and works equally efficient in Mac, Windows and Linux (Ubuntu).

Furthermore, it displays the tree in a mobile phone (iPhone and Android) if the input file size is small. CITATION: Subramanian, S., Ramasamy, U. and Chen, D. (2019). VCF2PopTree: a client-side software to construct population phylogeny from genome-wide SNPs. Peer J. x:yy.

Address of the bookmark: https://github.com/sansubs/vcf2pop

dna2bit: an ultra-fast and accurate genomic distance estimation software

Neel — Wed, 13 Aug 2025 19:56:21 -0500

dna2bit: an ultra-fast and accurate genomic distance estimation software

dna2bit is a software tool developed in C++11, leveraging the capabilities of OpenMP for parallel computing and the popcount technique for efficient bit manipulation.

Address of the bookmark: https://github.com/lijuzeng/dna2bit

HALC: High throughput algorithm for long read error correction

Jit — Fri, 08 Jun 2018 10:47:41 -0500

HALC, a high throughput algorithm for long read error correction. HALC aligns the long reads to short read contigs from the same species with a relatively low identity requirement so that a long read region can be aligned to at least one contig region, including its true genome region’s repeats in the contigs sufficiently similar to it (similar repeat based alignment approach) HALC was able to obtain 6.7-41.1% higher throughput than the existing algorithms while maintaining comparable accuracy. The HALC corrected long reads can thus result in 11.4-60.7% longer assembled contigs than the existing algorithms.

Address of the bookmark: https://github.com/lanl001/halc

SiLiX: implements an ultra-efficient algorithm for the clustering of homologous sequences

Jit — Wed, 12 Dec 2018 09:22:41 -0600

The software package SiLiX implements an ultra-efficient algorithm for the clustering of homologous sequences, based on single transitive links (single linkage) with alignment coverage constraints.

SiLiX adopts a graph-theoretical framework to interpret similarity pairs as edges of a network. A very efficient algorithm, based on the Disjoint Sets Data Structure, allows the computation of sequence families with low time and space requirements.

A parallel version of SiLiX, based on MPI, is also available in this package and has been proved to be scalable, so that its allows the study of very large datasets.

SiLiX is already included in the analysis pipeline for HOGENOM.

Address of the bookmark: http://lbbe.univ-lyon1.fr/SiLiX?lang=fr

AlfaPang: alignment free algorithm for pangenome graph construction

BioStar — Thu, 28 Aug 2025 02:56:35 -0500

AlfaPang constructs variation graphs, leveraging its alignment-free and reference-free approach, based solely on intrinsic sequence properties. This design allows AlfaPang's runtime and memory usage to scale linearly with the size of input sequences, enabling it to handle significantly larger genome sets compared to other methods.

Address of the bookmark: https://github.com/AdamCicherski/AlfaPang

HECIL: A Hybrid Error Correction Algorithm for Long Reads with Iterative Learning

Abhimanyu Singh — Tue, 01 Jan 2019 12:01:00 -0600

HECIL—Hybrid Error Correction with Iterative Learning—a hybrid error correction framework that determines a correction policy for erroneous long reads, based on optimal combinations of decision weights obtained from short read alignments.

HECIL’s core algorithm by introducing an iterative learning paradigm that enhances the correction policy at each iteration by incorporating knowledge gathered from previous iterations via data-driven confidence metrics assigned to prior corrections.

Address of the bookmark: https://github.com/NDBL/HECIL

%MinMax: A versatile tool for calculating and comparing synonymous codon usage and its impact on protein folding.

Surabhi Chaudhary — Thu, 24 May 2018 02:53:31 -0500

%MM calculates whether a given gene sequence encodes amino acids using the most common codons possible, the least common codons possible, or (most typically) some combination of these extremes. See our PLoS ONE paper for more details on how the %MinMax algorithm works. %MinMax results are averaged over an 18-codon sliding window; hence the result for "codon window = 1" is the average codon usage for codons 1-18, codon window 2 = codons 2-19, etc.

Address of the bookmark: http://www.codons.org/

Genetic code - Amino Acid

Poonam Mahapatra — Sun, 26 Oct 2014 07:45:58 -0500

The genetic code consists of 64 triplets of nucleotides. These triplets are called codons.With three exceptions, each codon encodes for one of the 20 amino acids used in the synthesis of proteins. That produces some redundancy in the code: most of the amino acids being encoded by more than one codon.

The image summarise all in one.

More at http://users.rcn.com/jkimball.ma.ultranet/BiologyPages/C/Codons.html

minimap2: A versatile pairwise aligner for genomic and spliced nucleotide sequences

Jit — Wed, 20 Jun 2018 07:55:29 -0500

git clone https://github.com/lh3/minimap2 cd minimap2 && make # long sequences against a reference genome ./minimap2 -a test/MT-human.fa test/MT-orang.fa > test.sam # create an index first and then map ./minimap2 -d MT-human.mmi test/MT-human.fa ./minimap2 -a MT-human.mmi test/MT-orang.fa > test.sam # use presets (no test data) ./minimap2 -ax map-pb ref.fa pacbio.fq.gz > aln.sam # PacBio genomic reads ./minimap2 -ax map-ont ref.fa ont.fq.gz > aln.sam # Oxford Nanopore genomic reads ./minimap2 -ax sr ref.fa read1.fa read2.fa > aln.sam # short genomic paired-end reads ./minimap2 -ax splice ref.fa rna-reads.fa > aln.sam # spliced long reads ./minimap2 -ax splice -k14 -uf ref.fa reads.fa > aln.sam # Nanopore Direct RNA-seq ./minimap2 -cx asm5 asm1.fa asm2.fa > aln.paf # intra-species asm-to-asm alignment ./minimap2 -x ava-pb reads.fa reads.fa > overlaps.paf # PacBio read overlap ./minimap2 -x ava-ont reads.fa reads.fa > overlaps.paf # Nanopore read overlap # man page for detailed command line options man ./minimap2.1

Address of the bookmark: https://github.com/lh3/minimap2

Special Nucleotide Characters / Symbols !

Abhi — Thu, 16 Dec 2021 23:37:33 -0600

Nucleotide symbols

Nucleotide symbol	Full Name
A	Adenine
C	Cytosine
G	Guanine
T	Thymine
U	Uracil
R	Guanine / Adenine (purine)
Y	Cytosine / Thymine (pyrimidine)
K	Guanine / Thymine
M	Adenine / Cytosine
S	Guanine / Cytosine
W	Adenine / Thymine
B	Guanine / Thymine / Cytosine
D	Guanine / Adenine / Thymine
H	Adenine / Cytosine / Thymine
V	Guanine / Cytosine / Adenine
N	Adenine / Guanine / Cytosine / Thymine