Skip Navigation

This Article
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow FREE Full Text (Screen PDF)
Right arrow Alert me when this article is cited
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 ISI Web of Science
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 arrow Search for citing articles in:
ISI Web of Science (16)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Peshkin, L.
Right arrow Articles by S.Gelfand, M.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Peshkin, L.
Right arrow Articles by S.Gelfand, M.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Bioinformatics Vol. 15 no. 12 1999
Pages 980-986
© 1999 Oxford University Press

Segmentation of yeast DNA using hidden Markov models

Leonid Peshkin 1 and Mikhail S.Gelfand 2

1 Computer Science, Brown University, Providence, RI 02912, USA
2 State Scientific Center for Biotechnology, NIIGenetika, Moscow 113545, Russia

Motivation: Compositionally homogeneous segments of genomic DNA often correspond to meaningful biological units. Simple sliding window analysis is usually insufficient for compositional segmentation of natural sequences. Hidden Markov models (HMM) with a small number of states are a natural language for description of compositional properties of chromosome-size DNA sequences.

Results: The algorithms were applied to yeast Saccharomyces cerevisiae chromosomes (YC) I, III, IV, VI and IX. The optimal number of HMM states is found to be four. The optimal four-state HMMs for all chromosomes are very similar, as well as the reconstructed segmentations. In most cases the models with k + 1 states are obtained by ‘splitting’ one of the states in the model with k states, and the corresponding increase of the level of detail in segmentation. The high AT states usually correspond to intergenic regions. We also explore the model’s likelihood landscape and analyze the dynamics of the optimization process, thus addressing the problem of reliability of the obtained optima and efficiency of the algorithms.

Availability: The system is available on request from the first author.

Contact: ldp{at}cs.brown.edu

Received on September 9, 1998 ; revised on June 9, 1999 ; accepted on June 23, 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
BioinformaticsHome page
S. Tempel, M. Giraud, D. Lavenier, I.-C. Lerman, A.-S. Valin, I. Couee, A. E. Amrani, and J. Nicolas
Domain organization within repeated DNA sequences: application to the study of a family of transposable elements
Bioinformatics, August 15, 2006; 22(16): 1948 - 1954.
[Abstract] [Full Text] [PDF]


Home page
Nucleic Acids ResHome page
F. Gao and C.-T. Zhang
GC-Profile: a web-based tool for visualizing and analyzing the variation of GC content in genomic sequences.
Nucleic Acids Res., July 1, 2006; 34(Web Server issue): W686 - W691.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
L. Gueguen
Sarment: Python modules for HMM analysis and partitioning of sequences
Bioinformatics, August 15, 2005; 21(16): 3427 - 3428.
[Abstract] [Full Text] [PDF]


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]



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.