BOL: Related items

YAHA

Jit — Fri, 20 Jan 2017 05:38:05 -0600

YAHA, a fast and flexible hash-based aligner. YAHA is as fast and accurate as BWA-SW at finding the single best alignment per query and is dramatically faster and more sensitive than both SSAHA2 and MegaBLAST at finding all possible alignments. Unlike other aligners that report all, or one, alignment per query, or that use simple heuristics to select alignments, YAHA uses a directed acyclic graph to find the optimal set of alignments that cover a query using a biologically relevant breakpoint penalty. YAHA can also report multiple mappings per defined segment of the query. We show that YAHA detects more breakpoints in less time than BWA-SW across all SV classes, and especially excels at complex SVs comprising multiple breakpoints.

Availability: YAHA is currently supported on 64-bit Linux systems. Binaries and sample data are freely available for download from http://faculty.virginia.edu/irahall/YAHA.

Contact:

http://genome.wustl.edu/people/groups/detail/hall-lab/

Address of the bookmark: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3463118/

GenomeComp

Jit — Fri, 17 Feb 2017 08:38:32 -0600

GenomeComp is a tool for summarizing, parsing and visualizing the genome wide sequence comparison results derived from voluminous BLAST textual output, so as to locate the rearrangements, insertions or deletions of genome segments between species or strains.

It can be easily used to compare, parsing and visualize large genomic sequences, especially closely related genomes such as inter-species or inter-strains. In addition, it can also show other sequence features like repeat sequence distributions in one whole-genome DNA sequence by comparing the genome to itself.

It is a stand-alone graphical user interface (GUI) program which runs on Linux, Unix, Mac OS X (tested on version 10.2.4 only) and Microsoft Windows platforms and is written in Perl/Tk.

Address of the bookmark: http://www.mgc.ac.cn/GenomeComp/

Cgaln

Jit — Wed, 22 Feb 2017 05:14:15 -0600

Cgaln (Coarse grained alignment) is a program designed to align a pair of whole genomic sequences of not only bacteria but also entire chromosomes of vertebrates on a nominal desktop computer. Cgaln performs an alignment job in two steps, at the block level and then at the nucleotide level. The former "coarse-grained" alignment can explore genomic rearrangements and reduce the regions to be analyzed in the next step. The latter is devoted to detailed alignment within the limited regions found in the first stage. The output of Cgaln is 'glocal' in the sense that rearrangements are taken into consideration while each alignable region is extended as long as possible. Thus, Cgaln is not only fast and memory-efficient, but also can filter noisy outputs without missing the most important homologous segment pairs.

http://www.iam.u-tokyo.ac.jp/chromosomeinformatics/rnakato/cgaln/

Address of the bookmark: http://www.iam.u-tokyo.ac.jp/chromosomeinformatics/rnakato/cgaln/

A Post-assembly genome-improvement toolkit (PAGIT) to obtain annotated genomes from contigs

Abhimanyu Singh — Fri, 12 May 2017 10:50:29 -0500

PAGIT addresses the need for software to generate high quality draft genomes. It is based on a series of programs that we developed:

ABACAS, that is able to contiguate contigs from a de novo assembly against a closely related reference.

IMAGE, an iterative approach for closing gaps in assembled genomes using mate pair information. It is able to close gaps left open by the assembler in a draft genome, even when using the same data sets as used by the original assembler.

iCORN, that enables errors in the consensus sequence to be corrected by iteratively mapping reads to the current assembly. An improved version, especially correction Pacfic Bioscience assemblies (PacBio) can be found here.

RATT, a tool to transfer the annotation from a reference genome, or an earlier assembly, onto the latest assembly.

PAGIT bundles these software and makes them more accessible for users.

Address of the bookmark: http://www.sanger.ac.uk/science/tools/pagit

AVID: A Global Alignment Program

Archana Malhotra — Wed, 24 May 2017 05:19:28 -0500

A new global alignment method called AVID. The method is designed to be fast, memory efficient, and practical for sequence alignments of large genomic regions up to megabases long. We present numerous applications of the method, ranging from the comparison of assemblies to alignment of large syntenic genomic regions and whole genome human/mouse alignments. We have also performed a quantitative comparison of AVID with other popular alignment tools. To this end, we have established a format for the representation of alignments and methods for their comparison. These formats and methods should be useful for future studies. The tools we have developed for the alignment comparisons, as well as the AVID program, are publicly available. See Web Site References section for AVID Web address and Web addresses for other programs discussed in this paper.

Address of the bookmark: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC430967/

CrusView

Jit — Thu, 12 Apr 2018 09:22:03 -0500

CrusView is a java based tool for karyotype/genome visualization and comparison of crucifer Species. It also integrates an binary version of KGBassembler and a post-modification step for its assembling result.

Address of the bookmark: http://www.cmbb.arizona.edu/?page_id=250

MACSE: Multiple Alignment of Coding SEquences Accounting for Frameshifts and Stop Codons

Jit — Mon, 18 Feb 2019 04:21:50 -0600

MACSE aligns coding NT sequences with respect to their AA translation while allowing NT sequences to contain multiple frameshifts and/or stop codons. MACSE is hence the first automatic solution to align protein-coding gene datasets containing non-functional sequences (pseudogenes) without disrupting the underlying codon structure. It has also proved useful in detecting undocumented frameshifts in public database sequences and in aligning next-generation sequencing reads/contigs against a reference coding sequence.

For further details about the underlying algorithm see the original publication:
MACSE: Multiple Alignment of Coding SEquences accounting for frameshifts and stop codons.
Vincent Ranwez, Sébastien Harispe, Frédéric Delsuc, Emmanuel JP Douzery
PLoS One 2011, 6(9): e22594.

Address of the bookmark: https://bioweb.supagro.inra.fr/macse/index.php?menu=releases

Nucl2Vec: Local alignment of DNA sequences using Distributed Vector Representation

Jit — Tue, 16 Mar 2021 05:45:44 -0500

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 reduced computation cost forlocal alignment , while achieving accuracy comparable to existingdefacto standard BWA-MEM tool.

https://prakharg24.github.io/papers/401851.full.pdf

Address of the bookmark: https://prakharg24.github.io/papers/401851.full.pdf

Harvest: a suite of core-genome alignment and visualization tools

Jit — Fri, 08 Dec 2017 07:16:03 -0600

Harvest is a suite of core-genome alignment and visualization tools for quickly analyzing thousands of intraspecific microbial genomes, including variant calls, recombination detection, and phylogenetic trees.

Tools

Parsnp - Core-genome alignment and analysis
Gingr - Interactive visualization of alignments, trees and variants
HarvestTools - Archiving and postprocessing

Address of the bookmark: https://harvest.readthedocs.io/en/latest/

xmatchview: smith-waterman alignment visualization

Rahul Nayak — Thu, 28 Dec 2017 09:00:58 -0600

xmatchview and xmatchview-conifer are imaging tools for comparing the synteny between DNA sequences. It allows users to align 2 DNA sequences in fasta format using cross_match and displays the alignment in a variety of image formats. xmatchview and xmatchview-conifer are written in python and run on linux and windows. They serve as visual tools for analyzing cross_match alignments. Cross_match (Green, P. (1994) http://www.phrap.org) uses an implementation of the Smith-Waterman algorithm for comparing DNA sequences that is sensitive.

http://www.bcgsc.ca/platform/bioinfo/software/xmatchview

Address of the bookmark: https://github.com/warrenlr/xmatchview