Skip Navigation

This Article
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow FREE Full Text (Screen PDF)
Right arrow Comments: Submit a response
Right arrow Alert me when this article is cited
Right arrow Alert me when Comments are posted
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by L.Oliver, J.
Right arrow Articles by Bernaola-Galván, P.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by L.Oliver, J.
Right arrow Articles by Bernaola-Galván, P.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Bioinformatics Vol. 15 no. 12 1999
Pages 974-979
© 1999 Oxford University Press

SEGMENT: identifying compositional domains in DNA sequences

José L.Oliver 1, Ramón Román-Roldán 2, Javier Pérez 3 and Pedro Bernaola-Galván 4

1 Department of Genetics and Institute of Biotechnology, Faculty of Sciences, University of Granada, E-18071-Granada, Spain
2 Department of Applied Physics, University of Granada, Spain
3 Institute of Biotechnology, University of Granada, E-18071-Granada, Spain
4 Department of Applied Physics II, University of Málaga, Spain

To whom correspondence should be addressed.

Present address: Center for Polymer Studies and Department of Physics, Boston University, Massachusetts, USA.

Motivation: 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.

Availability: SEGMENT is available on the Web at http://www.ugr.es/local/oliver/segment/

Contact: oliver{at}ugr.es

Received on March 30, 1999 ; revised on June 18, 1999 ; accepted on August 4, 1999

Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
Nucleic Acids ResHome page
P. Nicolas, L. Bize, F. Muri, M. Hoebeke, F. Rodolphe, S. D. Ehrlich, B. Prum, and P. Bessieres
Mining Bacillus subtilis chromosome heterogeneities using hidden Markov models
Nucleic Acids Res., March 15, 2002; 30(6): 1418 - 1426.
[Abstract] [Full Text] [PDF]


Home page
Genome ResHome page
E. Pizzi and C. Frontali
Low-Complexity Regions in Plasmodium falciparum Proteins
Genome Res., February 1, 2001; 11(2): 218 - 229.
[Abstract] [Full Text]



Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.