BOL: Related items

ASplice: a scalable and memory-efficient algorithm for de novo transcriptome assembly

Rahul Nayak — Tue, 03 Jul 2018 04:09:46 -0500

With increased availability of de novo assembly algorithms, it is feasible to study entire transcriptomes of non-model organisms. While algorithms are available that are specifically designed for performing transcriptome assembly from high-throughput sequencing data, they are very memory-intensive, limiting their applications to small data sets with few libraries. Texas A&M University researchers develop a transcriptome assembly algorithm that recovers alternatively spliced isoforms and expression levels while utilizing as many RNA-Seq libraries as possible that contain hundreds of gigabases of data. New techniques are developed so that computations can be performed on a computing cluster with moderate amount of physical memory. Availability – A software program that implements the algorithm is available at: http://faculty.cse.tamu.edu/shsze/asplice. Sze SH, Pimsler ML, Tomberlin JK, Jones CD, Tarone AM. (2017) A scalable and memory-efficient algorithm for de novo transcriptome assembly of non-model organisms. BMC Genomics 18(Suppl 4):387.

Address of the bookmark: http://faculty.cse.tamu.edu/shsze/asplice/

Efficient genome searching with Biostrings and the BSgenome data package

Aasha — Mon, 07 Mar 2016 05:18:06 -0600

Address of the bookmark: https://www.bioconductor.org/packages/3.3/bioc/vignettes/BSgenome/inst/doc/GenomeSearching.pdf

gget

BioStar — Sat, 01 Apr 2023 09:42:07 -0500

gget is a free, open-source command-line tool and Python package that enables efficient querying of genomic databases. gget consists of a collection of separate but interoperable modules, each designed to facilitate one type of database querying in a single line of code.

Address of the bookmark: https://github.com/pachterlab/gget

seqloc 0.6

Gudiya Pal — Sun, 28 Dec 2014 12:51:29 -0600

The Bio.SeqLoc modules in seqloc are designed to represent positions and locations (ranges of positions) on sequences, particularly nucleotide sequences. My original motivation for writing these packages was handing the locations of genes in eukaryotic genomes.

Handle sequence locations for bioinformatics http://www.ingolia-lab.org/seqloc-tutorial.html

Address of the bookmark: http://www.stackage.org/snapshot/nightly-2014-12-28/package/seqloc-0.6

NovelSeq: Novel Sequence Insertion Detection

Neel — Fri, 09 Jun 2017 04:31:30 -0500

The NovelSeq framework is designed to detect novel sequence insertions using high throughput paired-end whole genome sequencing data.

http://novelseq.sourceforge.net/Home

Paper at https://www.ncbi.nlm.nih.gov/pubmed/20385726

Address of the bookmark: http://novelseq.sourceforge.net/Home

BEAP: Blast Extension and Assembly Program

Shruti Paniwala — Mon, 11 Jun 2018 04:52:56 -0500

The Blast Extension and Assembly Program (BEAP) is a computer program that uses a short starting DNA fragment, often a EST or partial gene segment, as "primer", to recursively blast nucleotide databases in an attempt to obtain all sequences that overlaps, directly or indirectly, with the "primer" therefore help to "extend" the length of the original sequence for constructing a "full length" sequence for functional analysis, or at least to obtain neighboring regions of the segment for SNP discovery and linkage disequilibrium analysis. The confidence of assembling the resulting sequences is achieved by using a known genome, such as human genome, as a reference. https://www.animalgenome.org/tools/beap/

Address of the bookmark: https://www.animalgenome.org/tools/beap/

ULTRA (ULTRA Locates Tandemly Repetitive Areas) : Effective Labeling of Repetitive Genomic Sequence

Abhi — Sat, 08 Jun 2024 16:03:39 -0500

ULTRA is a tool to find and annotate tandem repeats inside genomic sequence. It is able to find repeats of any length and of any period (up to a maximum period of 4000). It can find highly decayed repeats missed by other software, and it will also be able to find very large repeats in highly repetitive sequence, regardless of the size of sequence or length of repeats. ULTRA offers meaningful annotation scores and can produce annotation P-values at user request.

More at https://www.biorxiv.org/content/10.1101/2024.06.03.597269v1

Address of the bookmark: https://github.com/TravisWheelerLab/ULTRA

Taxoblast : Taxoblast is a pipeline to identify contamination in genomic sequence

Jit — Thu, 23 Nov 2017 08:37:15 -0600

Modern genome sequencing strategies are highly sensitive to contamination making the detection of foreign DNA sequences an important part of analysis pipelines. Here we use Taxoblast, a simple pipeline with a graphical user interface, for the post-assembly detection of contaminating sequences in the published genome of the kelp Saccharina japonica. Analyses were based on multiple blastn searches with short sequence fragments. They revealed a number of probable bacterial contaminations as well as hybrid scaffolds that contain both bacterial and algal sequences. This or similar types of analysis, in combination with manual curation, may thus constitute a useful complement to standard bioinformatics analyses prior to submission of genomic data to public repositories. Our analysis pipeline is open-source and freely available at http://sdittami.altervista.org/taxoblast and via SourceForge (https://sourceforge.net/projects/taxoblast).

Address of the bookmark: https://sourceforge.net/projects/taxoblast/files/

Many-to-many pairwise alignments of two sequence sets

Poonam Mahapatra — Tue, 19 Jun 2018 08:34:15 -0500

needleall reads a set of input sequences and compares them all to one or more sequences, writing their optimal global sequence alignments to file. It uses the Needleman-Wunsch alignment algorithm to find the optimum alignment (including gaps) of two sequences along their entire length. The algorithm uses a dynamic programming method to ensure the alignment is optimum, by exploring all possible alignments and choosing the best. A scoring matrix is read that contains values for every possible residue or nucleotide match. Needleall finds the alignment with the maximum possible score where the score of an alignment is equal to the sum of the matches taken from the scoring matrix, minus penalties arising from opening and extending gaps in the aligned sequences. The substitution matrix and gap opening and extension penalties are user-specified.

Address of the bookmark: http://emboss.sourceforge.net/apps/release/6.6/emboss/apps/needleall.html

RePS: Repeat-masked Phrap with scaffolding, a WGS sequence assembler

Jit — Sat, 04 Jan 2020 01:08:09 -0600

RePS (Repeat-masked Phrap with scaffolding), a WGS sequence assembler, that explicitly identifies exact kmer repeats from the shotgun data and removes them prior to the assembly. The established software Phrap is used to compute meaningful error probabilities for each base. Clone-end-pairing information is used to construct scaffolds that order and orient the contigs. The updated version of RePS incorporates some of the ideas introduced by Phusion on clustering

More at

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC186573/

Address of the bookmark: ftp://ftp.genomics.org.cn/pub/ricedb/Tools/RePS/RePS-IBM-AIX.tar.gz