title: SEGMENT: identifying compositional domains in DNA sequences.
abstract: BACKGROUND
  DNA sequences are formed by patches or domains of different nucleotide composition. In a few simple sequences, domains can simply be identified by eye; however, most DNA sequences show a complex compositional heterogeneity (fractal structure), which cannot be properly detected by current methods. Recently, a computationally efficient segmentation method to analyse such nonstationary sequence structures, based on the Jensen-Shannon entropic divergence, has been described. Specific algorithms implementing this method are now needed.
  
  
  RESULTS
  Here we describe a heuristic segmentation algorithm for DNA sequences, which was implemented on a Windows program (SEGMENT). The program divides a DNA sequence into compositionally homogeneous domains by iterating a local optimization procedure at a given statistical significance. Once a sequence is partitioned into domains, a global measure of sequence compositional complexity (SCC), accounting for both the sizes and compositional biases of all the domains in the sequence, is derived. SEGMENT computes SCC as a function of the significance level, which provides a multiscale view of sequence complexity.
authors.affiliation: Department of Genetics, Faculty of Sciences, University of Granada, Spain. oliver@ugr.es
authors.forename: J L
authors.initials: JL
authors.lastname: Oliver
authors.forename: R
authors.initials: R
authors.lastname: Román-Roldán
authors.forename: J
authors.initials: J
authors.lastname: Pérez
authors.forename: P
authors.initials: P
authors.lastname: Bernaola-Galván
mesh_terms: D000465:Algorithms; D003626:Data Display; D004926:Escherichia coli / Q000235:genetics; D008432:Mathematical Computing; D008957:Models, Genetic; D015394:Molecular Structure; D017434:Protein Structure, Tertiary / Q000235:genetics; D017422:Sequence Analysis, DNA / Q000379:methods*; D012984:Software; D014584:User-Computer Interface