Application of a new probabilistic model for recognizing complex patterns in glycans

被引:9
作者
Aoki, Kiyoko F. [1 ]
Ueda, Nobuhisa [1 ]
Yamaguchi, Atsuko [1 ]
Kanehisa, Minoru [1 ]
Akutsu, Tatsuya [1 ]
Mamitsuka, Hiroshi [1 ]
机构
[1] Kyoto Univ, Inst Chem Res, Bioinformat Ctr, Uji, Kyoto 6110011, Japan
关键词
D O I
10.1093/bioinformatics/bth916
中图分类号
Q5 [生物化学];
学科分类号
071010 ; 081704 ;
摘要
Motivation: The study of carbohydrate sugar chains, or glycans, has been one of slow progress mainly due to the difficulty in establishing standard methods for analyzing their structures and biosynthesis. Glycans are generally tree structures that are more complex than linear DNA or protein sequences, and evidence shows that patterns in glycans may be present that spread across siblings and into further regions that are not limited by the edges in the actual tree structure itself. Current models were not able to capture such patterns. Results: We have applied a new probabilistic model, called probabilistic sibling-dependent tree Markov model (PSTMM), which is able to inherently capture such complex patterns of glycans. Not only is the ability to capture such patterns important in itself, but this also implies that PSTMM is capable of performing multiple tree structure alignments efficiently. We prove through experimentation on actual glycan data that this new model is extremely useful for gaining insight into the hidden, complex patterns of glycans, which are so crucial for the development and functioning of higher level organisms. Furthermore, we also show that this model can be additionally utilized as an innovative approach to multiple tree alignment, which has not been applied to glycan chains before. This extension on the usage of PSTMM may be a major step forward for not only the structural analysis of glycans, but it may consequently prove useful for discovering clues into their function.
引用
收藏
页码:6 / 14
页数:9
相关论文
共 22 条
[11]  
Jansson J., 2001, Combinatorial Pattern Matching. 12th Annual Symposium, CPM 2001. Proceedings (Lecture Notes in Computer Science Vol. 2089), P232
[12]   ALIGNMENT OF TREES - AN ALTERNATIVE TO TREE EDIT [J].
JIANG, T ;
WANG, LS ;
ZHANG, KZ .
THEORETICAL COMPUTER SCIENCE, 1995, 143 (01) :137-148
[13]   The KEGG resource for deciphering the genome [J].
Kanehisa, M ;
Goto, S ;
Kawashima, S ;
Okuno, Y ;
Hattori, M .
NUCLEIC ACIDS RESEARCH, 2004, 32 :D277-D280
[14]   RNA secondary structure prediction using stochastic context-free grammars and evolutionary history [J].
Knudsen, B ;
Hein, J .
BIOINFORMATICS, 1999, 15 (06) :446-454
[15]   HIDDEN MARKOV-MODELS IN COMPUTATIONAL BIOLOGY - APPLICATIONS TO PROTEIN MODELING [J].
KROGH, A ;
BROWN, M ;
MIAN, IS ;
SJOLANDER, K ;
HAUSSLER, D .
JOURNAL OF MOLECULAR BIOLOGY, 1994, 235 (05) :1501-1531
[16]  
MCLACHLAN G., 2000, WILEY SER PROB STAT, DOI 10.1002/0471721182
[17]   STOCHASTIC CONTEXT-FREE GRAMMARS FOR TRANSFER-RNA MODELING [J].
SAKAKIBARA, Y ;
BROWN, M ;
HUGHEY, R ;
MIAN, IS ;
SJOLANDER, K ;
UNDERWOOD, RC ;
HAUSSLER, D .
NUCLEIC ACIDS RESEARCH, 1994, 22 (23) :5112-5120
[18]   Pair hidden Markov models on tree structures [J].
Sakakibara, Yasubumi .
BIOINFORMATICS, 2003, 19 :i232-i240
[19]  
Sjolander K, 1998, Proc Int Conf Intell Syst Mol Biol, V6, P165
[20]  
Ueda N, 2004, SIAM PROC S, P357