BOL: Related items

LSC: Improving PacBio Long Read Accuracy by Short Read Alignment

Abhimanyu Singh — Thu, 06 Sep 2018 16:27:35 -0500

Added Command line argument support.
Multi-stage execution modes.
Support for parallelization. Now execution proceeds in batches of long reads the size of which can be set by --long_read_batch_size N.
Better compressed intermediate files.
Added utilities folder.
Added support for multiple short read files.
Removed use of configuration file.

Address of the bookmark: https://www.healthcare.uiowa.edu/labs/au/LSC/

Encode sequencing data freely available to download and use for academic means

Rahul Agarwal — Thu, 13 Mar 2014 18:18:08 -0500

In Encode, regulatory elements investigated via DNA hypersensitivity assays, assays of DNA methylation, and chromatin immunoprecipitation (ChIP) of proteins that interact with DNA, including modified histones and transcription factors, followed by sequencing (ChIP-Seq).

More information:

https://genome.ucsc.edu/ENCODE/pilot.html

Address of the bookmark: https://genome.ucsc.edu/ENCODE/

Calling narrow and broad peaks from ChIP-Seq data

Strand — Tue, 04 Aug 2015 05:06:03 -0500

Know about the state-of-the-art algorithms implemented in Strand NGS for detecting the binding sites of transcription factor (narrow peaks) and enriched regions of histone modification (broad peaks) from ChIP-Seq data.
Read the benchmarking study on Calling narrow and broad peaks from ChIP-Seq data in Strand NGS by Rohit Gupta and Anita Sathyanarayanan. For more information, please contact us

MetaGraph: Ultra Scalable Framework for DNA Search, Alignment, Assembly

Abhi — Sat, 08 Jun 2024 16:15:25 -0500

The MetaGraph framework is designed to work with a wide range of input data sets, indexing from a few samples up to the contents of entire archives with hundreds of thousands of records. The indexing workflow always follows the same principle, transforming single input samples into error-removed, refined sample graphs, which are then merged into a joint metagraph index. Each input sample is annotated in the joint index as a subgraph. This graph index enriched with metadata can then be used for downstream applications such as sequence search or differential assembly.

Searcg link https://metagraph.ethz.ch/search

Pre-print https://www.biorxiv.org/content/10.1101/2020.10.01.322164v4

Address of the bookmark: https://metagraph.ethz.ch/

repeat-aware: Repeat aware scaffolding evaluation framework by Igor Mandric

Jit — Wed, 21 Mar 2018 18:10:00 -0500

Genome scaffolding is a classical challenging problem in bioinformatics. It refers to joining assembly contigs into chains (called scaffolds). The join between two contigs A and B is considered correct if:

Their relative orientation is correct
Their relative order is correct
The gap estimate is similar to the true distance on the reference

The problem of scaffolding validation is also a challenging one. One of the main issues which hinders from an adequate scaffolding evaluation are genome repeats. The previous standard for evaluation (Hunt et al., Genome Biology, 2014) did not take into account repeats. In this evaluation framework, repeats are taken into account.

The new evaluation framework considers the optimal assignment of contigs in the output scaffolding to contigs in the reference scaffolding in the sense of the number of correct links.

https://github.com/mandricigor/repeat-aware

Address of the bookmark: https://github.com/mandricigor/repeat-aware

nQuire: A statistical framework for ploidy estimation using NGS short-read data

Jit — Thu, 31 Jan 2019 05:12:19 -0600

nQuire implements a set of commands to estimate ploidy level of individuals from species, where recent polyploidization occurred and intraspecific ploidy variation is observed. Specifically, nQuire uses next-generation sequencing data to distinguish between diploids, triploids and tetraploids, on the basis of frequency distributions at variant sites where only two bases are segregating.

For more background see also the publication at BMC Bioinformatics.

https://github.com/clwgg/nQuire

Address of the bookmark: https://github.com/clwgg/nQuire

UniAligner: a parameter-free framework for fast sequence alignment

Abhi — Fri, 08 Mar 2024 23:36:12 -0600

UniAligner (formerly, TandemAligner) is the first parameter-free algorithm for sequence alignment that introduces a sequence-dependent alignment scoring that automatically changes for any pair of compared sequences. Classical alignment approaches, such as the Smith-Waterman algorithm, that work well for most sequences, fail to construct biologically adequate alignments of extra-long tandem repeats (ETRs), such as human centromeres and immunoglobulin loci. This limitation was overlooked in the previous studies since the sequences of the centromeres and other ETRs across multiple genomes only became available recently.

More at https://www.nature.com/articles/s41592-023-01970-4

Address of the bookmark: https://github.com/seryrzu/unialigner

Grinder / Biogrinder - A versatile omics shotgun and amplicon sequencing read simulator

Jit — Wed, 24 May 2017 08:41:41 -0500

Grinder is a versatile program to create random shotgun and amplicon sequence libraries based on DNA, RNA or proteic reference sequences provided in a FASTA file.

Grinder can produce genomic, metagenomic, transcriptomic, metatranscriptomic, proteomic, metaproteomic shotgun and amplicon datasets from current sequencing technologies such as Sanger, 454, Illumina. These simulated datasets can be used to test the accuracy of bioinformatic tools under specific hypothesis, e.g. with or without sequencing errors, or with low or high community diversity. Grinder may also be used to help decide between alternative sequencing methods for a sequence-based project, e.g. should the library be paired-end or not, how many reads should be sequenced.

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

LRCstats: Long Read Correction Statistics

Jit — Fri, 05 Jan 2018 04:04:20 -0600

LRCstats is an open-source pipeline for benchmarking DNA long read correction algorithms for long reads outputted by third generation sequencing technology such as machines produced by Pacific Biosciences. The reads produced by third generation sequencing technology, as the name suggests, are longer in length than reads produced by next generation sequencing technologies, such as those produced by Illumina. However, long reads are plagued by high error rates, which can cause issues in downstream analysis. Long read correction algorithms reduce the error rate of long reads either through self-correcting methods or using accurate, short reads outputted by next generation sequencing technologies to correct long reads.

Of course, some long read correction algorithms are better than others, and developers of long read correction algorithms will wish to compare their algorithm with others currently available. LRCstats benchmarks long read correction algorithms using long reads produced by simulators (such as SimLoRD or PBSim) where the two-way alignments between the uncorrected long reads (uLR) and the corresponding sequences in the reference genome (Ref) are given in some sort of alignment file and then aligning the corrected long reads (cLR) to the Ref-uLR two-way alignments to create three-way alignments using a dynamic programming algorithm. Statistics on these three-way alignments are then collected, such as the overall error rates of the corrected long reads.

https://www.healthcare.uiowa.edu/labs/au/LSC/

Address of the bookmark: https://github.com/cchauve/lrcstats

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