Skip Navigation

Nucleic Acids Research 2006 34(10):3150-3160; doi:10.1093/nar/gkl396
This Article
Right arrow Full Text Freely available
Right arrow Print PDF (3675K) Freely available
Right arrow Screen PDF (674K) Freely available
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 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 (4)
Right arrow Commercial Re-use Guidelines
for Open Access NAR Content
Google Scholar
Right arrow Articles by Xing, Y.
Right arrow Articles by Lee, C.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Xing, Y.
Right arrow Articles by Lee, C.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Published online 6 June 2006

© 2006 The Author(s)
This is an Open Access article distributed under the terms of the Creative Commons Attribution Non-Commercial License (
http://creativecommons.org/licenses/by-nc/2.0/uk/) which permits unrestricted non-commerical use, distribution, and reproduction in any medium, provided the original work is properly cited.


Article

An expectation-maximization algorithm for probabilistic reconstructions of full-length isoforms from splice graphs

Yi Xing1,*, Tianwei Yu2,3, Ying Nian Wu2, Meenakshi Roy1, Joseph Kim1 and Christopher Lee1,*

1 Molecular Biology Institute, Center for Computational Biology, Department of Chemistry and Biochemistry, University of California Los Angeles, USA 2 Department of Statistics, University of California Los Angeles, USA 3 Dental Research Institute, School of Dentistry, University of California Los Angeles, USA

*To whom correspondence should be addressed. Tel: +1 310 825 7374; Fax: +1 310 206 7286. Email: leec{at}mbi.ucla.edu

*Correspondence may also be addressed to Yi Xing. Email: yxing{at}ucla.edu

Received January 29, 2006. Revised April 13, 2006. Accepted May 10, 2006.

Reconstructing full-length transcript isoforms from sequence fragments (such as ESTs) is a major interest and challenge for bioinformatic analysis of pre-mRNA alternative splicing. This problem has been formulated as finding traversals across the splice graph, which is a directed acyclic graph (DAG) representation of gene structure and alternative splicing. In this manuscript we introduce a probabilistic formulation of the isoform reconstruction problem, and provide an expectation-maximization (EM) algorithm for its maximum likelihood solution. Using a series of simulated data and expressed sequences from real human genes, we demonstrate that our EM algorithm can correctly handle various situations of fragmentation and coupling in the input data. Our work establishes a general probabilistic framework for splice graph-based reconstructions of full-length isoforms.


The authors wish it to be known that, in their opinion, the first two authors should be regarded as joint First Authors


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
S. Zheng and L. Chen
A hierarchical Bayesian model for comparing transcriptomes at the individual transcript isoform level
Nucleic Acids Res., June 1, 2009; 37(10): e75 - e75.
[Abstract] [Full Text] [PDF]


Home page
Nucleic Acids ResHome page
Y. Lee, Y. Lee, B. Kim, Y. Shin, S. Nam, P. Kim, N. Kim, W.-H. Chung, J. Kim, and S. Lee
ECgene: an alternative splicing database update
Nucleic Acids Res., January 12, 2007; 35(suppl_1): D99 - D103.
[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.