BOL: Related items

Elastic BLAST !

Abhi — Tue, 06 Sep 2022 18:14:57 -0500

ElasticBLAST is a new way to BLAST large numbers of queries, faster and on the cloud. Here are the top three reasons you should use ElasticBLAST:

1. ElasticBLAST can handle much LARGER queries!

ElasticBLAST can search query sets that have hundreds to millions of sequences and against BLAST databases of all sizes.

2. ElasticBLAST is FASTER

ElasticBLAST distributes your searches across multiple cloud instances to process them simultaneously. The ability to scale resources in this way allows you to process large numbers of queries in a shorter time than you could with BLAST+.

3. ElasticBLAST is EASY to run on the cloud

ElasticBLAST is easy to set up using our step-by-step instructions (Amazon Web Services (AWS), Google Cloud Platform (GCP)) and allows you to leverage the power of the cloud. Once configured, it manages the software and database installation, handles partitioning of the BLAST workload among the various instances, and deallocates cloud resources when the searches are done.

ElasticBLAST also selects the instance (i.e., machine) type for you based on database size. Of course, you can also choose the instance type manually if you prefer.

Address of the bookmark: https://blast.ncbi.nlm.nih.gov/doc/elastic-blast/

kSNP3.0: SNP detection and phylogenetic analysis of genomes without genome alignment or reference genome

Jit — Fri, 08 Dec 2017 16:48:40 -0600

Sept. 20, 2017 Version 3.1 released. Major upgrade. Version 3.1 fixes the problems with SNP annotation that arose when NCBI discontinued use of GI numbers. Please read carefully the Preface (page 3) and the File of annotated genomes section (pages 9-10) in the version 3.1 User Guide. Thanks to Tom Slezak for revsing the get_genbank_file3 script and to Tod Stuber (USDA) for testing version 3.1 even though he doesn't need the annotation feature. All users are encouraged to upgrade to version 3.1.

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

MUMmer4: A fast and versatile genome alignment system

Jit — Sat, 03 Feb 2018 04:59:17 -0600

MUMmer4, a substantially improved version of MUMmer that addresses genome size constraints by changing the 32-bit suffix tree data structure at the core of MUMmer to a 48-bit suffix array, and that offers improved speed through parallel processing of input query sequences. With a theoretical limit on the input size of 141Tbp, MUMmer4 can now work with input sequences of any biologically realistic length. We show that as a result of these enhancements, the nucmer program in MUMmer4 is easily able to handle alignments of large genomes;

Address of the bookmark: https://mummer4.github.io/

Mulan: Multiple-sequence local alignment and visualization for studying function and evolution

Jit — Fri, 24 Aug 2018 09:50:01 -0500

Mulan: Multiple-sequence local alignment and visualization for studying function and evolution

Mulan (http://mulan.dcode.org/), a novel method and a network server for comparing multiple draft and finished-quality sequences to identify functional elements conserved over evolutionary time. Mulan brings together several novel algorithms: the TBA multi-aligner program for rapid identification of local sequence conservation, and the multiTF program for detecting evolutionarily conserved transcription factor binding sites in multiple alignments. In addition, Mulan supports two-way communication with the GALA database; alignments of multiple species dynamically generated in GALA can be viewed in Mulan, and conserved transcription factor binding sites identified with Mulan/multiTF can be integrated and overlaid with extensive genome annotation data using GALA.

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

Cactus: a reference-free whole-genome multiple alignment program

Jit — Mon, 12 Aug 2019 07:52:33 -0500

Cactus is a reference-free whole-genome multiple alignment program. The principal algorithms are described here: https://doi.org/10.1101/gr.123356.111

Cactus uses substantial resources. For primate-sized genomes (3 gigabases each), you should expect Cactus to use approximately 120 CPU-days of compute per genome, with about 120 GB of RAM used at peak. The requirements scale roughly quadratically, so aligning two 1-megabase bacterial genomes takes only 1.5 CPU-hours and 14 GB RAM.

Address of the bookmark: https://github.com/ComparativeGenomicsToolkit/cactus

The wavefront alignment (WFA) algorithm

BioStar — Sun, 28 Jun 2020 10:17:50 -0500

The wavefront alignment (WFA) algorithm is an exact gap-affine algorithm that takes advantage of
homologous regions between the sequences to accelerate the alignment process. As opposed to traditional dynamic programming algorithms that run in quadratic time, the WFA runs in time O(ns), proportional to the read length n and the alignment score s, using O(s^2) memory. Moreover, the WFA exhibits simple data dependencies that can be easily vectorized, even by the automatic features of modern compilers, for different architectures, without the need to adapt the code.

Address of the bookmark: https://github.com/smarco/WFA

Want to Know which genome assembler rule the world ?

Rahul Agarwal — Sun, 11 Aug 2013 11:42:32 -0500

Assemblathon 2: evaluating de novo methods of genome assembly

http://www.gigasciencejournal.com/content/2/1/10/abstract

http://blogs.nature.com/news/2013/07/genome-assembly-contest-prompts-soul-searching.html

http://assemblathon.org/post/44431915644/feedback-and-analysis-of-the-assemblathon-2-p

The Story of You: ENCODE and the human genome

Sat, 24 Aug 2013 18:49:03 -0500

Ever since a monk called Mendel started breeding pea plants we've been learning about our genomes. In 1953, Watson, Crick and Franklin described the structure of the molecule that makes up our genomes: the DNA double helix. Then, in 2001, scientists wrote down the entire 3-billion letter code contained in the average human genome. Now they're trying to interpret that code; to work out how it's used to make different types of cells and different people. The ENCODE project, as it's called, is the latest chapter in the story of you. To read the ENCODE research papers and more, visit http://www.nature.com/ENCODE

DNA is packaged in a chromosome experiment

Mon, 23 Sep 2013 18:01:12 -0500

For more information, log on to- http://shomusbiology.weebly.com/ Download the study materials here- http://shomusbiology.weebly.com/bio-materials.html A nucleosome is the basic unit of DNA packaging in eukaryotes, consisting of a segment of DNA wound in sequence around four histone protein cores.[1] This structure is often compared to thread wrapped around a spool.[2] Nucleosomes form the fundamental repeating units of eukaryotic chromatin,[3] which is used to pack the large eukaryotic genomes into the nucleus while still ensuring appropriate access to it (in mammalian cells approximately 2 m of linear DNA have to be packed into a nucleus of roughly 10 µm diameter). Nucleosomes are folded through a series of successively higher order structures to eventually form a chromosome; this both compacts DNA and creates an added layer of regulatory control, which ensures correct gene expression. Nucleosomes are thought to carry epigenetically inherited information in the form of covalent modifications of their core histones. Nucleosomes were observed as particles in the electron microscope by Don and Ada Olins [4] and their existence and structure (as histone octamers surrounded by approximately 200 base pairs of DNA) were proposed by Roger Kornberg.[5][6] The role of the nucleosome as a general gene repressor was demonstrated by Lorch et al. in vitro [7] and by Han and Grunstein in vivo.

How I discovered DNA - James Watson

Fri, 18 Oct 2013 11:30:26 -0500

View full lesson: http://ed.ted.com/lessons/james-watson-on-how-he-discovered-dna Nobel laureate James Watson opens TED2005 with the frank and funny story of how he and his research partner, Francis Crick, discovered the structure of DNA. Talk by James Watson.