Information entropy based methods for genome comparison

  • Authors:
  • Mehul Jani;Rajeev K. Azad

  • Affiliations:
  • University of North Texas, Denton, Texas;University of North Texas, Denton, Texas

  • Venue:
  • ACM SIGBioinformatics Record
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

A plethora of biologically useful information lies obscured in the genomes of organisms. Encoded within the genome of an organism is the information about its evolutionary history. Evolutionary signals are scattered throughout the genome. Bioinformatics approaches are frequently invoked to deconstruct the evolutionary patterns underlying genomes, which are difficult to decipher using traditional laboratory experiments. However, interpreting constantly evolving genomes is a non-trivial task for bioinformaticians. Processes such as mutations, recombinations, insertions and deletions make genomes not only heterogeneous and difficult to decipher but also renders direct sequence comparison less effective. Here we present a brief overview of the sequence comparison methods with a focus on recently proposed alignment-free sequence comparison methods based on Shannon information entropy. Many of these sequence comparison methods have been adapted to construct phylogenetic trees to infer relationships among organisms.