BOL: Related items

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

LEGE — Sun, 31 Aug 2025 06:24:58 -0500

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. It has been thoroughly tested using the g++ and clang compilers on both Linux and MacOS platforms.

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

FastANI: fast alignment-free computation of whole-genome Average Nucleotide Identity (ANI)

Jit — Fri, 13 Jul 2018 17:27:01 -0500

FastANI is developed for fast alignment-free computation of whole-genome Average Nucleotide Identity (ANI). ANI is defined as mean nucleotide identity of orthologous gene pairs shared between two microbial genomes. FastANI supports pairwise comparison of both complete and draft genome assemblies. Its underlying procedure follows a similar workflow as described by Goris et al. 2007. However, it avoids expensive sequence alignments and uses Mashmap as its MinHash based sequence mapping engine to compute the orthologous mappings and alignment identity estimates. Based on our experiments with complete and draft genomes, its accuracy is on par with BLAST-based ANI solver and it achieves two to three orders of magnitude speedup. Therefore, it is useful for pairwise ANI computation of large number of genome pairs. More details about its speed, accuracy and potential applications are described here: "High-throughput ANI Analysis of 90K Prokaryotic Genomes Reveals Clear Species Boundaries".

Address of the bookmark: https://github.com/ParBLiSS/FastANI

OrthoANI: An improved algorithm and software for calculating average nucleotide identity

Abhimanyu Singh — Wed, 12 Dec 2018 08:36:08 -0600

OAT uses OrthoANI to measure the overall similarity between two genome sequences. ANI and OrthoANI are comparable algorithms: they share the same species demarcation cut-off at 95~96% and large comparison studies have demonstrated both algorithms to produce near identical reciprocal similarities. Details of the OrthoANI algorithm is given in (Lee et al. 2015). OAT employs an easy-to-follow Graphical User Interface that allow researchers to calculate OrthoANI values between genomes of interest without unfamiliar Command Line Environments. Moreover, the OAT_cmd command-line software can be integrated into preexisting bioinformatics pipelines.

Address of the bookmark: https://www.ezbiocloud.net/tools/orthoani

PSPairwise Sequentially Markovian Coalescent (PSMC) model

Jit — Thu, 19 Apr 2018 05:29:23 -0500

Implementation of the Pairwise Sequentially Markovian Coalescent (PSMC) model

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

Katju Lab

Fri, 26 Feb 2016 03:25:32 -0600

TheLab seek to understand the genetic factors contributing to genomic variation and phenotypic diversity. To this end, we employ molecular and bioinformatic tools to study evolutionary processes at the level of populations, both experimental and natural, and genomes. Our research interests encompass a wide range of topics, including the evolution of organellar and nuclear genomes, gene duplication and the origin of novel function, and the fitness and phenotypic consequences of mutation in evolution. For details regards ongoing projects, please see the Research page.

http://katjulab.com/research.html

SISRS: Site Identification from Short Read Sequences

Abhimanyu Singh — Wed, 28 Nov 2018 08:56:03 -0600

Next-gen sequence data such as Illumina HiSeq reads. Data must be sorted into folders by taxon (e.g. species or genus). Paired reads in fastq format must be specified by _R1 and _R2 in the (otherwise identical) filenames. Paired and unpaired reads must have a fastq file extension.

Address of the bookmark: https://github.com/rachelss/SISRS

KAST

Neel — Wed, 23 Feb 2022 08:28:36 -0600

Perform Alignment-free k-tuple frequency comparisons from sequences. This can be in the form of two input files (e.g. a reference and a query) or a single file for pairwise comparisons to be made.

Address of the bookmark: https://github.com/martinjvickers/KAST

SMASH: An alignment-free tool to find and visualise rearrangements between pairs of DNA sequences

Jit — Thu, 21 Dec 2017 08:26:57 -0600

SMASH is a completely alignment-free method to find and visualise rearrangements between pairs of DNA sequences. The detection is based on relative compression, namely using a FCM, also known as Markov model, of high context order (typically 20). The method has been approached with a tool (also called SMASH). For visualization, SMASH outputs a SVG image, with an ideogram output architecture, where the patterns are represented with several HSV values (only value varies). The following image, illustrating the information maps between human and chimpanzee for the several chromosomes, depicts an example:

Address of the bookmark: https://github.com/pratas/smash

RopeBWT2: Incremental construction of FM-index for DNA sequences

Rahul Nayak — Thu, 25 Oct 2018 04:48:54 -0500

RopeBWT2 is an tool for constructing the FM-index for a collection of DNA sequences. It works by incrementally inserting one or multiple sequences into an existing pseudo-BWT position by position, starting from the end of the sequences. This algorithm can be largely considered a mixture of BCR and dynamic FM-index. Nonetheless, ropeBWT2 is unique in that it may implicitlysort the input into reverse lexicographical order (RLO) or reverse-complement lexicographical order (RCLO) while building the index.

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

LTR_Finder: an efficient program for finding full-length LTR retrotranspsons in genome sequences.

Neel — Sun, 13 Jan 2019 07:05:53 -0600

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 Smith-Waterman algorithm is used to adjust the ends of LTR pair candidates to get alignment boundaries. These boundaries are subject to re-adjustment using supporting information of TG..CA box and TSRs and reliable LTRs are selected. Next, LTR_FINDER tries to identify PBS, PPT and RT inside LTR pairs by build-in aligning and counting modules. RT identification includes a dynamic programming to process frame shift. For other protein domains, LTR_FINDER calls ps_scan (from PROSITE, http://www.expasy.org/prosite/) to locate cores of important enzymes if they occur.

Address of the bookmark: https://github.com/xzhub/LTR_Finder