BOL: Related items

Bioinformatician stuck in wet-lab

Rahul Agarwal — Tue, 06 May 2014 12:46:56 -0500

This guide is aimed at pet bioinformaticians, and is meant to guide them towards better career development.

1. Make friends with local bioinformatics groups
2. Talk to your computing group
3. Obtain clear expectations
4. Rewrite your job description
5. Papers
6. Attend bioinformatics meetings
7. Try first, ask later

Address of the bookmark: http://biomickwatson.wordpress.com/2013/04/23/a-guide-for-the-lonely-bioinformatician/

Bioinformatics: The Bridge Between Curiosity and Discovery

BioStar — Mon, 24 Nov 2025 05:16:49 -0600

In the sprawling universe of modern science, bioinformatics stands as one of the most transformative and empowering fields of our time. It is where biology meets computation, where data becomes meaning, and where curiosity becomes discovery. If you’ve stepped into this world—or are considering it—here’s your reminder: you’re part of a revolution.

Why Bioinformatics Matters More Than Ever

Every day, our world generates massive amounts of biological data—from genome sequences to microbiome profiles to real-time pathogen surveillance. Hidden within these datasets are the answers to some of the greatest challenges humanity faces: emerging diseases, antimicrobial resistance, environmental stress, genetic disorders, sustainable agriculture, and more.

Bioinformatics isn’t just a skill.
It’s the language of the future of biology.

By mastering it, you give yourself the power to:

Decode genomes and understand life at its most fundamental level

Identify patterns no microscope could ever reveal

Predict disease outbreaks before they occur

Accelerate drug discovery with computational precision

Contribute to open-source tools that empower scientists worldwide

You don’t just follow science—you drive it.

Every Expert Was Once a Beginner

Many newcomers feel intimidated. Command-line interfaces. R scripts. Python packages. Next-generation sequencing data. Complex machine learning models.

But here’s the truth: every bioinformatician started exactly where you are now—curious, unsure, but excited.

No one writes perfect code on day one.

No one understands genomics pipelines immediately.

What makes you a bioinformatician is not perfection, but perseverance.

When your script throws a cryptic error…
When your data refuses to format…
When your pipeline runs for 6 hours only to crash…

Remember: this is part of the journey.
Every error teaches you. Every retry strengthens you. Every breakthrough energizes you.

Bioinformatics Is Not Just a Career—It’s a Mindset

It’s the mindset of:

Problem-solving.

Continuous learning.

Turning chaos into clarity.

Seeing what others can’t.

Bioinformaticians are detectives of biological complexity. You sit at the intersection of innovation, using tools that can shape public health, medicine, agriculture, and ecology. Few fields give you such direct impact on the world.

Your Contribution Matters

As you work on your script, pipeline, genome, or model, remember:

Somewhere, your analysis might contribute to:

A new therapy

A faster diagnostic test

A better understanding of a pathogen

A more resilient crop

An open-source dataset that helps thousands

A discovery that rewrites textbooks

Your code may be small, but its ripple effect is powerful.

The Future Is Bioinformatics—And You Are Part of It

The world is shifting. Wet labs are integrating AI. Hospitals rely on genomic insights. Farmers use gene-level predictions. Governments monitor disease in real time. Students launch pipelines that become global tools.

This is a golden era—and you are not late.
You are exactly where you need to be.

Keep Pushing. Keep Learning. Keep Discovering.

Bioinformatics is a journey filled with challenges, but also with unmatched rewards.

So the next time you feel stuck, frustrated, or overwhelmed, remember:
You’re building the science of tomorrow.

Be proud. Stay curious. Keep going.
Your work matters more than you think.

Automatic Filtering, Trimming, Error Removing and Quality Control for fastq data

Rahul Nayak — Mon, 13 Nov 2017 05:10:23 -0600

Automatic Filtering, Trimming, Error Removing and Quality Control for fastq data
AfterQC can simply go through all fastq files in a folder and then output three folders: good, bad and QC folders, which contains good reads, bad reads and the QC results of each fastq file/pair.
Currently it supports processing data from HiSeq 2000/2500/3000/4000, Nextseq 500/550, MiniSeq...and other Illumina 1.8 or newer formats

Address of the bookmark: https://github.com/OpenGene/AfterQC

A powerful, yet simple, gene set analysis tool for interpreting RNA-seq and NGS results.

Shani — Thu, 30 Oct 2014 09:19:29 -0500

LifeMap Sciences is introducing GeneAnalytics, our new gene set analysis tool, which is applicable for NGS results and differentially expressed gene lists from variable sources. GeneAnalytics provides gene associations with tissues & cells, diseases, pathways, GO terms and compounds.

Our main advantages over other similar tools are:

GeneAnalytics is very simple and intuitive to use.
GeneAnalytics is based on our proprietary databases – GeneCards, MalaCards, PathCards and LifeMap Discovery, each of them integrates information from a very large number of resources.
GeneAnalytics supplies links for extensive background information on each of the matched results.

I invite you to try it out for free at geneanalytics.genecards.org, and would be happy to hear your comments and thoughts on how we can improve.

Yours,

Shani Ben-Ari Fuchs

LifeMap Sciences Team

Professor/Associate Professor/ Assistant Professor at Chettinad Academy of Research and Education

Sat, 24 May 2014 00:00:15 -0500

OPEN FACULTY POSITION

Chettinad Academy of Research and Education (CARE) invites applications from eligible and translational research-oriented candidates to the posts of Professor/Associate Professor/ Assistant Professor Computational Biology, Bioinformatics, and Pharmaceutical Chemistry.

Emoluments: As per UGC norms (Adequate Compensation for Postdoctoral/Teaching experience)

Candidates fulfilling the eligibility criteria as per the UGC norms can send their full CV with copies of certificates and reference letters to the following address by post or by e-mail on or before 31st May 2014

The Registrar,
Chettinad Academy of Research and Education,
Chettinad Health City
Kelambakkam, Chennai 603 103
Tamil Nadu
T +91 (0)44 4741 1000
F +91 (0)44 4741 1011
Email: jobs @chettinadhealthcity.com

Advertisement: http://182.73.176.163/chc/ads2014.pdf

Alignment of closely related whole genomes/scaffolds

Rahul Nayak — Fri, 29 Jan 2016 10:37:27 -0600

With the relative ease and low cost of current generation sequencing technologies has led to a dramatic increase in the number of sequenced genomes for species across the tree of life. This increasing volume of data requires tools that can quickly compare multiple whole-genome sequences, millions of base pairs in length, to aid in the study of populations, pan-genomes, and genome evolution.This bookmaks have been created to report new tools for whole genome alignments.

Please report new whole genome alignment tools under comment sections.

Address of the bookmark: http://www.cs.utoronto.ca/~brudno/721.full.pdf

Finishing !!

Jit — Sat, 20 May 2017 15:50:20 -0500

The process of finishing a genome and moving it from a draft stage (the result of sequencing and initial assembly) to a complete genome is typically a time and resource intensive task. The advent of new sequencing technologies has come with its own set of opportunities and pitfalls in the finishing process. While genomes can now be sequenced to high redundancy in a cost-effective manner, the process of assembling the genomes is more challenging and often draft genomes are fragmented into hundreds of contigs. Correspondingly, the task of producing the complete genome can involve months of lab work and thousands of finishing experiments and is usually done in large genome centers.

The work in our lab has focussed on computational approaches to speed-up the finishing process. Specifically, we have explored the use of optical mapping and mate-pair data to augment assemblies and direct finishing experiments. The tools developed in our lab have been used in several finishing projects, producing complete genomes (and near-complete ones) with surprisingly little computational and experimental effort (Nagarajan et al., in submission). The executables (as well as source code) for these tools are freely available here:

Scaffolding using Optical Restriction Mapping
Optical Maps are global, ordered maps of restriction site locations in a genome. This information can be quite useful in scaffolding contigs from a shotgun assembly to guide the finishing process. A set of programs to exploit optical maps for assembly can be found here: SOMA v2.0 (63 MB tar.gz file). This version of SOMA contains several improvements to programs in v1.0 as well as new scripts for working with multiple maps, contig graphs and scaffolds.
Augmenting assemblies with mate-pair data
Mate-pair information can be valuable in augmenting short-read assemblies and reconstructing the genome as larger scaffolds. AMOS-Hybrid is a pipeline written in the AMOS framework (open-source assembly tools) to merge arbitrary mated reads into an existing assembly and merge contigs and create scaffolds where possible. Source code and executables for AMOS-Hybrid are available here: AMOS-Hybrid v1.0 (142 MB tar.gz file).
Assembly and sequence-composition guided finishing
Contigs from a shotgun assembly are typically linked together in a graph structure that can serve to guide finishing and in some case close gaps in-silico. Also, in many cases, sequence composition of contigs can provide clues to fill gaps in scaffolds. A set of scripts to automate some of these tasks can be found here: Finishing Scripts v1.0 (63 MB tar.gz file).

http://www.cbcb.umd.edu/finishing/

Address of the bookmark: http://www.cbcb.umd.edu/finishing/

Monitor running jobs on Linux server

Jitendra Narayan — Fri, 06 Jun 2014 16:18:43 -0500

You as a bioinformatican run lots of program on your servers. Sometime the shared server is also used by your colleague. If server is busy you sometime need to check the running programs and want to monitor the running programs as well. The "top" command will come in handy when you need to find out if things are still running, how long they’ve been running, or how much memory is being used.

‘top’ is very simple to run: type

%% top

You’ll get a screen that looks like this, and is updated regularly:

Simple, right? Heh.

First! Note that you can use ‘q’ or ‘CTRL-C’ to exit from ‘top’.

Now let’s read and understand at each line independently.

The first line:

top - 23:00:48 up 39 days, 2 user, load average: 0.00, 0.00, 0.00

The first line tells you the current time, how long the machine has been up, how many users are logged in, and the short/medium/long-term compute load on the machine. If you run something for a long time, you’ll see these numbers go up. Right now, the machine is basically just sitting there, so these are all close to 0.

The second line:

Tasks: 239 total,   1 running, 238 sleeping,   0 stopped,   0 zombie

This line tells you how many processes are running. If you are using laptops machines it’s not so interesting because you really are the only one using this machine.

Cpu(s): 0.0%us, 0.0%sy, 0.0%ni,100.0%id, 0.0%wa, 0.0%hi, 0.0%si, 0.0%st

This line contains the CPU load. The first two numbers are how busy the system is doing computation (“us” stands for “user”) and how busy the system is doing system-y things like accessing disks or network (“sy” stands for “system”). We’ll talk more about this later.

Mem:   49457320k total,    3492174k used, 14535596k free,    1435148k buffers

This should be easy to understand – how much memory you’re using!

Swap:   539356k total,   28332k used,   836562k free,    29862014k cached

Swap is just on-disk memory that can be used to “swap” out programs from main memory. Again, we’ll talk about this later.:

PID USER      PR NI VIRT RES SHR S %CPU %MEM    TIME+ COMMAND
1 root      39 19 0 0 0 S 0.0 0.0   246:57.22 kipmi0
2 root      RT   0     0    0    0 S 0.0 0.0   0:00.00 migration/0

And... finally! What’s actually running! The two most important numbers are the %CPU and %MEM towards the right, as well as the COMMAND. This tells you how compute- and memory-intensive your program is. Right now, nothing’s running so the numbers aren’t very interesting, but just wait until we run something...

PLAST: A fast, accurate and NGS scalable bank-to-bank sequence similarity search tool

Jit — Fri, 01 Dec 2017 04:10:54 -0600

PLAST is a fast, accurate and NGS scalable bank-to-bank sequence similarity search tool providing significant accelerations of seeds-based heuristic comparison methods, such as the Blast suite of algorithms.

Relying on unique software architecture, PLAST takes full advantage of recent multi-core personal computers without requiring any additional hardware devices.

PLAST stands for Parallel Local Sequence Alignment Search Tool and is was published in BMC Bioinformatics.

PLAST is a general purpose sequence comparison tool providing the following benefits:

PLAST is a high-performance sequence comparison tool designed to compare two sets of sequences (query vs. reference),
Reduces the processing time of sequences comparisons while providing highest quality results,
Contains a fully integrated data filtering engine capable of selecting relevant hits with user-defined criteria (E-Value, identity, coverage, alignment length, etc.),
Does not require any additional hardware, since it is a software solution. It is easy to install, cost-effective, takes full advantage of multi-core processors and uses a small RAM footprint,
Ready to be used on desktop computer, cluster, cloud as well as within distributed system running Hadoop.

https://plast.inria.fr/

Address of the bookmark: https://plast.inria.fr/

MIX: Combining multiple assemblies from NGS data

Rahul Nayak — Tue, 08 May 2018 04:58:05 -0500

Mix is a tool that combines two or more draft assemblies, without relying on a reference genome and has the goal to reduce contig fragmentation and thus speed-up genome finishing. The proposed algorithm builds an extension graph where vertices represent extremities of contigs and edges represent existing alignments between these extremities. These alignment edges are used for contig extension. The resulting output assembly corresponds to a path in the extension graph that maximizes the cumulative contig length.

The Mix algorithm, approach and results were published in BMC bioinformatics : http://www.biomedcentral.com/1471-2105/14/S15/S16.

Address of the bookmark: https://github.com/cbib/MIX