BOL: Related items

Bioinformatics tools for genome assembly !

BioStar — Mon, 24 Jul 2023 07:04:26 -0500

There are numerous genome assembly tools available, each with its strengths and weaknesses. Here is a list of some widely used genome assembly tools as of my last update in September 2021:

SPAdes: An assembler specifically designed for single-cell and multi-cell bacterial genomes, as well as small eukaryotic genomes.
ABySS: A parallelized assembler for large genomes that uses de Bruijn graphs.
Velvet: Another de Bruijn graph-based assembler optimized for short-read sequencing data.
SOAPdenovo: A de Bruijn graph-based assembler designed for short reads, widely used for assembling large and complex genomes.
MaSuRCA: A hybrid assembler that combines data from multiple sequencing technologies, such as Illumina and PacBio.
Canu: A long-read assembler optimized for PacBio and Oxford Nanopore sequencing data.
Flye: A long-read assembler suitable for bacterial and small eukaryotic genomes.
SMARTdenovo: An assembler designed for long reads, particularly suited for PacBio data.
SPAdes Long Read (SPAdesLR): An extension of SPAdes for long-read data, such as those from PacBio or Nanopore.
Minia: An assembler optimized for low memory consumption, suitable for small and medium-sized genomes.
Unicycler: A hybrid assembler that combines short and long reads for circular bacterial genome assembly.
wtdbg2: A de Bruijn graph assembler for long reads, efficient for very large genomes.
Shasta: A long-read assembler that uses the Overlap-Layout-Consensus approach, suitable for PacBio and Nanopore data.
Sparc: An assembler designed to handle noisy long reads from Nanopore sequencing.
CANA: An assembler for metagenomic data, particularly for complex and diverse microbial communities.
Ra Assembler: A metagenome assembler for long reads, designed for highly complex metagenomic samples.

Please note that the field of bioinformatics is constantly evolving, and new assembly tools may have emerged since my last update. Additionally, the performance of these tools can vary depending on the characteristics of the sequencing data and the genome being assembled. When selecting an assembly tool, consider the specific requirements of your project, the available data types, and the computational resources at your disposal. Always refer to the respective tool's documentation and publications for the most up-to-date information and recommendations.

BioKit: a set of tools dedicated to bioinformatics, data visualisation

Neel — Tue, 18 Jun 2024 02:04:39 -0500

BioKit is a set of tools dedicated to bioinformatics, data visualisation (biokit.viz), access to online biological data (e.g. UniProt, NCBI thanks to bioservices). It also contains more advanced tools related to data analysis (e.g., biokit.stats). Since R is quite common in bioinformatics, we also provide a convenient module to run R inside your Python scripts or shell (:mod:biokit.rtools module).

Address of the bookmark: https://biokit.readthedocs.io/en/latest/index.html

Bioinformatics Codes Search

Jitendra Narayan — Thu, 15 Aug 2013 11:08:52 -0500

I bet, this website will be your best friend in near future. This helps us to explore the existing open source codes and learn from it.

You can find some useful open source bioinformatics codes for your analysis work. You can use the left bar options to filtere out or narrow down your search result. This webpage can be an useful resource for a beginners bioinformatician as it contain several bioinformatics basics script that are commonly used by biological programmers and biologist.

Stand on the slumped, dandruff-covered shoulders of millions of computer nerds. _/\_

Enjoy the code and research work.

http://code.ohloh.net/search?s=bioinformatics

Address of the bookmark: http://code.ohloh.net/search?s=bioinformatics

Programming language to build synthetic DNA

Jit — Mon, 30 Sep 2013 16:37:24 -0500

A team led by Georg Seelig (http://homes.cs.washington.edu/~seelig/index.html) at University of Washington has developed a programming language for chemistry that it hopes will streamline efforts to design a network that can guide the behavior of chemical-reaction mixtures in the same way that embedded electronic controllers guide cars, robots and other devices. In medicine, such networks could serve as “smart” drug deliverers or disease detectors at the cellular level.

Reference & More @

http://www.nature.com/nnano/journal/vaop/ncurrent/full/nnano.2013.189.html

http://www.washington.edu/news/2013/09/30/uw-engineers-invent-programming-language-to-build-synthetic-dna/

Image source: washington.edu

Research assistant in computational biology

Wed, 24 Jun 2015 07:55:16 -0500

http://www.au.dk/en/about/vacant-positions/scientific-positions/stillinger/Vacancy/show/743161/5283/

Qualifications:
MSc degree in computer science, engineering, genetics or similar field with a strong emphasis on computational methods.

Deadline
01.08.2015

Molecular Genetics Lecture

Rahul Agarwal — Fri, 27 Sep 2013 04:24:45 -0500

"Robert Sapolsky makes interdisciplinary connections between behavioral biology and molecular genetic influences. He relates protein synthesis and point mutations to microevolutionary change, and discusses conflicting theories of gradualism and punctuated equilibrium and the influence of epigenetics on development theories."

"Robert Sapolsky is an American neuroendocrinologist, professor of biology, neuroscience, and neurosurgery at Stanford University, researcher and author" ----Wikipedia

Address of the bookmark: http://www.youtube.com/watch?v=_dRXA1_e30o

%MinMax: A versatile tool for calculating and comparing synonymous codon usage and its impact on protein folding.

Surabhi Chaudhary — Thu, 24 May 2018 02:53:31 -0500

%MM calculates whether a given gene sequence encodes amino acids using the most common codons possible, the least common codons possible, or (most typically) some combination of these extremes. See our PLoS ONE paper for more details on how the %MinMax algorithm works. %MinMax results are averaged over an 18-codon sliding window; hence the result for "codon window = 1" is the average codon usage for codons 1-18, codon window 2 = codons 2-19, etc.

Address of the bookmark: http://www.codons.org/

KOBAS: a web server for gene/protein functional annotation and functional gene set enrichment

Jit — Fri, 19 Oct 2018 09:36:11 -0500

KOBAS 3.0 is a web server for gene/protein functional annotation (Annotate module) and functional gene set enrichment(Enrichment module). For Annotate module, it accepts gene list as input, including IDs or sequences, and generates annotations for each gene based on multiple databases about pathways, diseases, and Gene Ontology. For Enrichment module, it can accept either gene list or gene expression data as input, and generates enriched gene sets, corresponding name, p-value or a probability of enrichment and enrichment score based on results of multiple methods.

Address of the bookmark: http://kobas.cbi.pku.edu.cn/

Caretta – A multiple protein structure alignment and feature extraction suite

Rahul Nayak — Fri, 18 Dec 2020 02:09:44 -0600

Caretta – a multiple protein structure alignment and feature extraction suite

Caretta, a multiple structure alignment suite meant for homologous but sequentially divergent protein families which consistently returns accurate alignments with a higher coverage than current state-of-the-art tools. Caretta is available as a GUI and command-line application and additionally outputs an aligned structure feature matrix for a given set of input structures, which can readily be used in downstream steps for supervised or unsupervised machine learning.

Address of the bookmark: http://www.bioinformatics.nl/caretta/

SOWDHAMINI Lab

Sun, 15 Sep 2013 09:19:12 -0500

Genome sequencing projects have enormous potential for benefiting human endeavors. However, just as acquiring a language's vocabulary does not enable one to speak it, databases that list the amino acid composition of proteins do not directly tell us much about these proteins' higher-level structure and function. The most productive way to indirectly exploit these databases has been to start with the small number of proteins that are fully-characterised and to assume that other "similar" proteins will have a related structure and function. Proteins with very similar amino acid sequence are "no-brainers", but the real test, which our group largely focuses on, is to detect the "essential" similarity in proteins whose non-critical sections have experienced random rearrangements during evolution. In such cases functionally similar proteins may have less than 25% sequence overlap.

More @ http://www.ncbs.res.in/sowdhamini/groups_sowdhamini.htm