Address of the bookmark: http://www.gigasciencejournal.com/content/2/1/15?utm_content=buffer25ee0&utm_medium=social&utm_source=twitter.com&utm_campaign=buffer

A new study in Science offers a different and surprisingly sweet perspective. Researchers Jennie Brand-Miller, Karen Hardy, David Raubenheimer, and Les Copeland suggest that sugars from fruits and honey, and later starch from cooked plants, may have been key in helping the human brain evolve.

The brain’s carbohydrate problem

The human brain uses a lot of energy. Even though it is only about 2% of an adult’s body weight, it takes up a large share of the body’s resting energy, mainly using glucose as fuel. Over millions of years, as our ancestors’ brains grew from about 300 grams in Australopithecus afarensis to around 1,500 grams in modern humans, the need for easy-to-access glucose would have gone up a lot.

The researchers, therefore, asked a simple question: where did all that glucose come from?

Their analysis suggests that early hominins may have gotten much of their glucose from naturally sweet foods. Fruit and honey could give them easy access to sugars before they learned to digest cooked starch well. The study’s models show that sugars may have made up a big part of their diet.

From fruit and honey to cooked starch

The story did not end with fruit.

The researchers suggest that humans shifted from eating sweet foods to eating cooked starchy foods. Once people learned to control fire and process food, cooking made starchy plants much easier to digest and turned them into a key source of glucose.

From this perspective, new ways of preparing food, like pounding, processing, and cooking, were not just about making meals softer or tastier. These changes may have given our ancestors access to much more carbohydrate energy.

This gives us a more detailed view of how the human diet evolved. Animal foods were clearly important, but carbohydrates may have been just as important for meeting the high energy needs of a growing brain.

A different way to think about the human diet

The study does not claim that our ancestors ate sugar the way we do today. There is a big difference between eating whole fruits or natural honey and eating the highly processed, refined sugars common now.

Instead, the research points to something bigger. Human evolution may have depended on our ability to find, process, and get energy from many different foods.

Seasonal fruit, honey, underground plant foods, and later cooked starches could have been important sources of glucose. The researchers think that changes in how available these foods were may have shaped how our ancestors searched for food and even affected human evolution.

What does this mean today?

The findings should not be interpreted as a license to eat more refined sugar. Instead, they challenge the simple idea that carbohydrates were less important than meat in human evolution. Our ancestors survived and evolved by exploiting different nutritional opportunities—and by developing technologies that made previously difficult foods more useful.

So perhaps the history of the human brain was not written by meat alone. ISo maybe the story of the human brain is not just about meat. It could also be about fruit, honey, roots, grains, and our unique ability to turn plants into energy. sweeter than we once imagined.

Read more about it at https://www.science.org/doi/epdf/10.1126/science.aed8437

De Bruijn Graphs for NGS Assembly
Algorithms for PacBio Reads
Software and Hardware Concepts for Bioinformatics
Finding us in Homolog.us (Search Algorithms)
NGS Genome and RNAseq Assembly - a Hands on Primer
Introduction to PERL, Python, R and C/C++ for Bioinformatics

Address of the bookmark: http://www.homolog.us/Tutorials/

A recent study published in PLOS Computational Biology introduces REvolutionH-tl 2.0 (https://pypi.org/project/revolutionhtl/), a computational tool designed to help solve this mystery. The software analyzes protein sequences and identifies evolutionary relationships between genes. It can help researchers detect important events such as gene duplication, gene loss, and speciation, allowing them to reconstruct how genes evolved across different organisms.

What makes the tool especially interesting is its focus on both speed and interpretation. The researchers compared REvolutionH-tl 2.0 with several existing computational tools and reported that it achieved competitive accuracy while requiring less computational time in their tests. The tool also includes visualization features, helping researchers turn complicated genetic data into evolutionary stories that are easier to explore.

Genes are more than simple sequences of DNA; they are records of life’s long history. Each surviving gene carries traces of the changes that shaped it. By bringing together computational analysis and visualization, REvolutionH-tl 2.0 acts like a detective, helping scientists uncover these hidden stories. Ultimately, tools like this can improve our understanding of how genomes evolved and how genes acquired the roles they perform today.

More at https://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.1013017

August1-2, 2014

Organised By

Centre of Excellence in Bioinformatics
Bioinformatics Infrastructure Facility
Department of Biochemistry
University of Lucknow
Lucknow-226007

Course Contents

Molecular Modeling
Homology Modeling
Molecular Docking
Post-structural Analyses

Molecular Dynamics (MD)
Simulation
Linux Introduction
Gromacs Installation

MD Simulation of Protein ligand complex
Analyses of MD
Trajectories
Visualization of Dynamic
complexes

Important Dates

Registration Begins June 25, 2014
Registration Closes July 25, 2014

Brochure : www.lkouniv.ac.in/conference/Brochure_August,%202014.pdf

Following are the list of Ancestral /sequence/ reconstruction (ASR) tools: 

inferCars

Reconstructs contiguous regions of an ancestral genome. Given information about adjacencies between conserved segments in each modern species, our goal is to infer segment order in the ancestral genome. To get a clean and precise statement of the problem, we formalize it using graph theory. We develop an algorithm that identifies a most parsimonious scenario for the history of each individual adjacency, although the whole-genome prediction is not guaranteed to optimize traditional measures like the number of breakpoints. We introduce weights to the graph edges to model the reliability of each adjacency.

ANGES:reconstructing ANcestral GEnomeS maps

A suite of Python programs that allows reconstructing ancestral genome maps from the comparison of the organization of extant-related genomes. ANGES can reconstruct ancestral genome maps for multichromosomal linear genomes and unichromosomal circular genomes. It implements methods inspired from techniques developed to compute physical maps of extant genomes.

Cocos

Constructs phylogenies of multi-domain proteins. With a given species tree and domain phylogenies, the procedure infers the composition of ancestral multi-domain proteins. Cocos implements and extend a suggested algorithmic approach by Behzadi and Vingron in an easy-to-use program. Such method could be applied to reconstruction of partial homologous units such as bacterial operons or protein complexes.

MySSP

Constructs an initial DNA sequence at the root of the tree and simulates evolution across the tree using a variety of common models of DNA evolution. MySSP is a program for the simulation of DNA sequence evolution across a phylogenetic tree. It is designed for large-scale studies, including simulation of multiple replicates and outputs sequences into NEXUS, MEGA, or FASTA formats. MySSP has a fairly simple graphical user interface (GUI) for basic use, but also has a specialized batch script interpreter to allow for more complicated or large-scale simulations.

PARANA: Parsimonious Ancestral Reconstruction And Network Analysis

Performs parsimony based inference of ancestral biological networks. Given multiple extant networks and phylogenetic information relating extant nodes, PARANA finds a parsimonious set of ancestral interaction events (edge gains and losses) which explain the extant networks. The framework adopted by PARANA is able to represent network evolution under models that support gene duplication and loss and independent interaction gain and loss. The method works on both directed and undirected networks and can incorporate asymmetric interaction gain and loss costs. In contrast to previous approaches, PARANA does not require knowing the relative ordering of unrelated duplication events and thus, works on phylogenetic trees even where branch lengths are not provided.

GapAdj: Gapped Adjacencies

A synteny-based method that is flexible enough to handle a model of evolution involving whole genome duplication events, in addition to rearrangements, gene insertions, and losses. Ancestral relationships between markers are defined in term of Gapped Adjacencies, i.e. pairs of markers separated by up to a given number of markers. It improves on a previous restricted to direct adjacencies, which revealed a high accuracy for adjacency prediction, but with the drawback of being overly conservative, i.e. of generating a large number of contiguous ancestral regions (CARs).

ANCESTOR

A web server allowing one to easily and quickly perform the last three steps of the ancestral genome reconstruction procedure. Ancestors implements several alignment algorithms, an indel maximum likelihood solver and a context-dependent maximum likelihood substitution inference algorithm. The results presented by the server include the posterior probabilities for the last two steps of the ancestral genome reconstruction and the expected error rate of each ancestral base prediction.

ProCARs

Reconstructs ancestral gene orders as contiguous ancestral regions (CARs) with a progressive homology-based method. ProCARs runs from a phylogeny tree (without branch lengths needed) with a marked ancestor and a block file. This homology-based method is based on iteratively detecting and assembling ancestral adjacencies, while allowing some micro-rearrangements of synteny blocks at the extremities of the progressively assembled CARs. The method starts with a set of blocks as the initial set of CARs, and detects iteratively the potential ancestral adjacencies between extremities of CARs, while building up the CARs progressively by adding, at each step, new non-conflicting adjacencies that induce the less homoplasy phenomenon. The species tree is used, in some additional internal steps, to compute a score for the remaining conflicting adjacencies, and to detect other reliable adjacencies, in order to reach completely assembled ancestral genomes.

FastML

A user-friendly tool for the reconstruction of ancestral sequences. FastML implements various novel features that differentiate it from existing tools: (i) FastML uses an indel-coding method, in which each gap, possibly spanning multiples sites, is coded as binary data. FastML then reconstructs ancestral indel states assuming a continuous time Markov process. FastML provides the most likely ancestral sequences, integrating both indels and characters; (ii) FastML accounts for uncertainty in ancestral states: it provides not only the posterior probabilities for each character and indel at each sequence position, but also a sample of ancestral sequences from this posterior distribution, and a list of the k-most likely ancestral sequences; (iii) FastML implements a large array of evolutionary models, which makes it generic and applicable for nucleotide, protein and codon sequences; and (iv) a graphical representation of the results is provided, including, for example, a graphical logo of the inferred ancestral sequences.

maxAlike

Reconstructs a genomic sequence for a specific taxon based on sequence homologs in other species. The input is a multiple sequence alignment and a phylogenetic tree that also contains the target species. For this target species, the algorithm computes nucleotide probabilities at each sequence position. Consensus sequences are then reconstructed based on a certain confidence level.

MLGO: Maximum Likelihood for Gene Order Analysis

A web tool for the reconstruction of phylogeny and/or ancestral genomes from gene-order data. MLGO was designed for analysis of large-scale genomic changes including not only rearrangements but also gene insertions, deletions and duplications. MLGO can be used to infer a phylogeny from genome rearrangement and gene order data, and can also obtain an estimation of ancestral genomes, given an input tree. MLGO takes the advantage of binary encoding on gene-order data, supports a fairly general model of genomic evolution (rearrangements plus duplications, insertions, and losses of genomic regions), and successfully accommodates itself into the framework of maximized likelihood.

Image Reference : Wiki

Reference

Cuccuru G1, Orsini M, Pinna A, Sbardellati A, Soranzo N, Travaglione A, Uva P, Zanetti G, Fotia G. (2014) Orione, a web-based framework for NGS analysis in microbiology. Bioinformatics [Epub ahead of print]. [article]

Address of the bookmark: http://orione.crs4.it/

http://www.sidowlab.org/

Most people who have a balanced translocation have the right amount of chromosome material but it has been rearranged in some way. This may happen if two chromosomes swap pieces (a reciprocal translocation). In other cases two whole chromosomes may become stuck together (a Robertsonian translocation). This page describes what happens when someone has a reciprocal translocation.

Reciprocal chromosomal translocations occur following double-strand breaks (DSBs) in DNA when a section of one chromosome is exchanged with that of another, non-homologous chromosome. These exchanges may produce a dysfunctional fusion gene that disrupts cell growth and survival pathways, such as the translocations seen in leukemia and childhood sarcomas.

Chromosomal translocations have been well studied in cancer cell lines which are associated with two types of cancer, acute myeloid leukemia and Ewing's sarcoma, but determining how they contribute to cancer development is complicated by additional mutations and altered gene expression profiles in these cultured cells. Now, Juan Carlos Ramirez, head of the Viral Vector Facility at the Fundacion Centro Nacional de Investigaciones Cardiovasculares (CNIC) and his colleagues Raul Torres at CNIC and Sandra Rodriguez-Peralez at the Spanish National Cancer Center (CNIO) in Madrid, Spain have used a new genome editing tool, CRISPR-Cas9, to induce chromosomal translocations for the first time in a human cell line and in primary cells. The study's authors conclude by stating that the use of this technology will allow for the clarification of how and why chromosomal translocation occurs, which without doubt will allow new anti-cancer therapeutic strategies to be tackled.

Using RNA-Guided Endonuclease (RGEN) technology or CRISPR/Cas9 genome engineering technology, CNIO and CNIC researchers have shown that it is possible to obtain such chromosomal translocations. The CRISPR-Cas9 system is extremely simple to introduce a cut at the desired locus, easier to design, and cheaper than many other systems. Using the CRISPR-Cas9 system, Ramirez and his colleagues reproduced the translocations observed in Ewing’s Sarcoma (ES) and Acute Myeloid Leukemia (AML) patient cell lines in HEK293 cells and also generated the ES translocation in human mesenchymal stem cells and the AML translocation in umbilical cord blood cells.

By focusing on chromosomal translocation without the confounding characteristics of established cell lines, these new cells lines should help answer the fundamental question of what causes a cell to become cancerous. Ramirez and his team now look forward to modeling other chromosome translocations in a variety of cell types.

Reference:

http://en.wikipedia.org/wiki/Chromosomal_translocation

http://www.nature.com/ncomms/2014/140603/ncomms4964/abs/ncomms4964.html

Brief description: We are looking for suitable candidates in the area o computational biology/bioinformatics/genomics or related field for next-generation sequencing (NGS) data analysis for small-RNAs, RNA-Seq and targeted resequencing of plants and associated organisms. We are an interdisciplinary group where projects equally involve bioinformatics and systems biology (specially microarrays and next-generation sequencing (NGS) data analysis and its use), along with plant molecular biology, genetic engineering, field biology, and analytical plant chemistry for understanding response of plants to biotic stresses.

Essential qualification: MSc/BTech/MTech/PhD (or other suitable qualification) in disciplines preferable to bioinformatics, computational biology, computer application (or equivalent)/ ‘Advance Post-Graduate Diploma in Bioinformatics’. Proficiency in programming languages (such as Perl, C++) and/or statistics (proficient in R for example) is compulsory.

Desirable qualification: Experience in the field of genomics e.g. microarray analysis, NGS, genome annotation, database development and management, software development, systems and network biology (or related fields) will be preferred.

Application process: Applications should contain CV along with brief description (maximum 1 page) of research conducted (highlighting skills and experience) till now. Applications should be sent by e-mail to Shree Prakash Pandey, Department of Biological Sciences, Indian Institute of Science Education and Research Kolkata, Mohanpur Campus, WB, India within 14 days of this advertisement.

E-mail: sppiiserkol@gmail.com, sppandey@iiserkol.ac.in

Advertisement:

http://www.iiserkol.ac.in/announcements/adverts/671-advt_ra_shree_prakash_july_2014