BOL: Related items

Unlocking Evolutionary Secrets: A Dive into Comparative Genomics Methods

LEGE — Tue, 20 May 2025 00:25:09 -0500

Comparative genomics is the art and science of comparing genomes—across species, within species, or even among individuals—to unravel evolutionary relationships, functional elements, and genetic adaptations. As sequencing technologies have advanced and genome databases have expanded, comparative genomics has become a cornerstone of modern biology, shedding light on everything from antibiotic resistance in bacteria to human disease genetics.

In this post, we’ll explore the core methods used in comparative genomics, the questions they help answer, and how they’re shaping our understanding of life.

1. Whole-Genome Alignment
Whole-genome alignment involves mapping the entire genome of one species to another. Tools like MUMmer, MAUVE, and LASTZ perform large-scale sequence alignments to detect conserved regions, rearrangements, insertions, and deletions.

Use Case:
Comparing human and chimpanzee genomes to identify evolutionary conserved sequences (ECS) and regions of divergence.

Key Challenges:
Handling repetitive sequences and genome rearrangements.

Computational complexity in large genomes.

2. Synteny and Collinearity Analysis
Synteny refers to conserved blocks of gene order across species. Tools like MCScanX, SynMap, or CHITRA (for visualizing synteny interactively) detect these blocks to understand chromosomal evolution.

Use Case:
Studying ancient genome duplications in plants.

Investigating chromosomal rearrangements in cancer genomes.

3. Ortholog and Paralog Detection
Orthologs are genes in different species that evolved from a common ancestor, while paralogs are genes duplicated within a genome. Identifying them is crucial for functional annotation and evolutionary studies.

Popular Tools:
OrthoFinder, Orthologous MAtrix (OMA), InParanoid, and EggNOG.

Use Case:
Functional prediction of uncharacterized genes based on orthologs in model organisms.

Tracing gene family evolution.

4. Phylogenomic Analysis
Phylogenomic methods combine phylogenetics and genomics to infer evolutionary trees based on genome-wide data. These methods can handle dozens to hundreds of genomes, using concatenated alignments or gene trees.

Tools:
RAxML, IQ-TREE, ASTRAL, Phylip, BEAST.

Use Case:
Resolving the evolutionary relationships between microbial species.

Studying speciation events.

5. Pan-Genome Analysis
The pan-genome consists of the core genome (shared by all strains) and the accessory genome (strain-specific genes). This is especially popular in microbial genomics.

Tools:
Roary, Panaroo, BPGA, PGAP.

Use Case:
Understanding virulence factor diversity in E. coli.

Designing broad-spectrum vaccines.

6. Comparative Transcriptomics
Comparing transcriptomes across species or conditions reveals conserved and unique expression patterns. RNA-seq data can be mapped to reference genomes to identify orthologous expression profiles.

Use Case:
Comparing stress response in extremophiles and model species.

Studying conserved regulatory networks.

7. Functional Element Comparison
Beyond genes, comparative genomics also targets non-coding regions—enhancers, promoters, miRNAs. Conservation across species often implies functional importance.

Tools:
PhastCons, GERP, phyloP (based on multiple alignments).

Use Case:
Detecting conserved non-coding elements in vertebrates.

Studying regulatory divergence in human evolution.

8. Horizontal Gene Transfer (HGT) Detection
In microbes, genes often jump across species boundaries. Comparative genomics can detect HGT by identifying genes that defy the expected phylogenetic pattern.

Tools:
HGTector, DarkHorse, AlienHunter, SIGI-HMM.

Use Case:
Tracing antibiotic resistance genes.

Exploring microbial adaptability in extreme environments.

Final Thoughts
Comparative genomics is a powerful lens to observe the diversity and unity of life. With a broad toolkit—from aligners to orthology pipelines, phylogenetic engines to visualization tools—it allows scientists to ask big questions: How did genomes evolve? What makes species unique? Where do new genes come from?

Whether you're studying extremophiles, building better crops, or exploring human ancestry, comparative genomics offers the methods to connect the dots across the tree of life.

GrapheR !!!

John Parker — Thu, 14 Aug 2014 14:02:17 -0500

What a wonderful gem GrapheR is.... Oh yes it is. GrapheR is a GUI for base graphics in R by http://www.maximeherve.com/. The package provides a graphical user interface for creating base charts in R. It is ideal for beginners in R, as the user interface is very clear and the code is written along side into a text file, allowing users to recreate the charts directly in the console.

Adding and changing legends? Messing around with the plotting window settings? It is much easier/quicker with this GUI than reading the help file and trying to understand the various parameters.
Here is a little example using the iris data set.

library(GrapheR)
data(iris)
run.GrapheR()

This will bring up a window that helps me to create the chart and tweak the various parameters.

Finally, I find the underlying R code in a file created by GrapheR. For more details read also the package vignette, which is available in English, French and German!

Next generation sequencing(NGS) books

Abhimanyu Singh — Fri, 30 May 2014 04:48:04 -0500

Employing different technologies, the purpose of NGS platform is to decode the identity or modification on the nucleotides. NGS platforms evolve quickly and capture the main stream.

This bookmark is created to provide NGS online books links.

Address of the bookmark: http://en.wikibooks.org/wiki/Next_Generation_Sequencing_%28NGS%29/Print_version

pybedtools

Shruti Paniwala — Wed, 20 Aug 2014 01:03:41 -0500

pybedtools is a Python wrapper for Aaron Quinlan's BEDtools programs (https://github.com/arq5x/bedtools), which are widely used for genomic interval manipulation or "genome algebra". pybedtools extends BEDTools by offering feature-level manipulations from with Python. See full online documentation, including installation instructions, at http://pythonhosted.org/pybedtools/.

More at http://pythonhosted.org/pybedtools/

A powerful toolset for genome arithmetic.http://code.google.com/p/bedtools/

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/

Bioinformatics JRF/SRF position at IARI

Thu, 04 Sep 2014 04:14:01 -0500

DIVISION OF NEMATOLOGY
INDIAN AGRICULTURAL RESEARCH INSTITUTE
NEW DELHI 110012
Applications are invited for the posts of one Junior
Research Fellow and one RA in the DBT funded project entitled “ Plant parasitic nematode genome informatics - insilico resource development”. The project is for a period of three years.

Essential qualifications for JRF
: M. Sc. in Bioinformatics with experience in Proteomics, genomics and structural biology. Knowledge of programming language, pearl and database – HTML, CSS,php and Java script.
Essential qualifications for Research Associate:
MSc/MTech in Bioinformatics with three years experience or Ph.D in Bioinformatics with experience in proteomics, genomics and structural biology. Knowledge of programming language, perl and database
– HTML, CSS, Java script. NGS sequence assembly and analysis and algorithm designing.
Age limit : 35 years maximum (5 year relaxation for SC/ST and women candidates)
Emoluments:
JRF: 16,000 + 30% HRA
.
Res Assoc: Rs22,000 + 30% HRA
The post is purely temporary in nature and is co-terminus with the project. The appointment would be initially for one year and may be extended further upon satisfactory performance.
Interested candidates
should send the duly filled application forms (format in the following page ) so as to reach on or before 20.9.2014 along with all the relevant documents.

More at http://www.iari.res.in/files/JRF_RA-03092014-20140903-135319.pdf

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

URDIP Pune Bioinformatics SRF/PA Openings

Sat, 20 Sep 2014 20:48:50 -0500

CSIR UNIT FOR RESEARCH AND DEVELOPMENT OF INFORMATION PRODUCTS
NCL Campus, S.No.113,114, Pashan, Pune 411 008

ADVERTISEMENT NO. - URDIP/ 5/2014

Learning opportunity for young Science and Engineering professionals to make a career in Information Science Industry CSIR has set up a Unit for Research and Development of Information Products (CSIR-URDIP) at Pune to work in the area of Scientific Informatics (ChemBioinformatics/Patent Informatics/Phytoinformatics/Toxinformatics) and related
software development projects.

Applications are invited from CSIR - UGC NET Qualified Candidates for consideration as Project Fellow (PF) and/or Senior Project Fellow (SPF) based on the experience to work on existing and new projects at CSIRURDIP.

Project Fellow

Remuneration - (Rs. 16,000.00 + 20% HRA)

M. Sc. In Biochemistry/Microbiology/Bioinformatics [Post-code A02] only with minimum of 55% marks

Senior Project Fellow

Remuneration - (Rs. 18,000.00 + 20% HRA)

M. Sc. in Biochemistry/Microbiology/Bioinformatics [Post-code A05] only with minimum of 55% marks plus two years research or relevant informatics experience

Please visit www.urdip.res.in/career.htm to apply online by 30th September, 2014.

Successful candidates who have appeared for NET exam in 2012 and 2013 are only eligible to apply.

Advertisement: http://115.112.95.114/urhr/download/Advt5_2014.pdf

HALC: High throughput algorithm for long read error correction

Jit — Fri, 08 Jun 2018 10:47:41 -0500

HALC, a high throughput algorithm for long read error correction. HALC aligns the long reads to short read contigs from the same species with a relatively low identity requirement so that a long read region can be aligned to at least one contig region, including its true genome region’s repeats in the contigs sufficiently similar to it (similar repeat based alignment approach) HALC was able to obtain 6.7-41.1% higher throughput than the existing algorithms while maintaining comparable accuracy. The HALC corrected long reads can thus result in 11.4-60.7% longer assembled contigs than the existing algorithms.

Address of the bookmark: https://github.com/lanl001/halc