Á¤º¸°úÇÐȸ ³í¹®Áö B : ¼ÒÇÁÆ®¿þ¾î ¹× ÀÀ¿ë
ÇѱÛÁ¦¸ñ(Korean Title) |
´Ü¹éÁúÀÇ ¼¼Æ÷³» À§Ä¡ ¿¹ÃøÀ» À§ÇÑ °ÈµÈ Á¢¹Ì»ç ¹è¿ ±â¹ÝÀÇ °í¼Ó ¼¿Å½»ö |
¿µ¹®Á¦¸ñ(English Title) |
Fast Sequence Search Based on Enhanced Suffix Arrays for Prediction of Protein Subcellular Localization |
ÀúÀÚ(Author) |
Áö»ó¹®
Sang-Mun Chi
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 40 NO. 09 PP. 0483 ~ 0490 (2013. 09) |
Çѱ۳»¿ë (Korean Abstract) |
´Ü¹éÁúÀÇ ¼¼Æ÷³» À§Ä¡¸¦ ¿¹ÃøÇÏ´Â ¸¹Àº ¹æ¹ýµéÀº ÁúÀÇ ´Ü¹éÁú°ú ¼¿ À¯»ç¼ºÀÌ ³ôÀº ´Ü¹éÁúÀÇ Á¤º¸¸¦ ÀÌ¿ëÇÑ´Ù. º» ³í¹®Àº ÀÌ·¯ÇÑ ¼¿ À¯»ç¼ºÀÌ Å« ´Ü¹éÁúµéÀ» °í¼ÓÀ¸·Î ã´Â ¹æ¹ýÀ» Á¦¾ÈÇÑ´Ù. À̸¦ À§ÇØ, À¯Àüü µ¥ÀÌÅͺ£À̽º¿¡¼ ÁúÀÇ DNA ¼¿ÀÇ À§Ä¡¸¦ ã´Âµ¥ ÀÌ¿ëµÇ´Â °ÈµÈ Á¢¹Ì»ç ¹è¿À» ´Ü¹éÁú µ¥ÀÌÅͺ£À̽º Ž»ö¿¡ ÀûÇÕÇÏ°Ô ¼öÁ¤ÇÑ´Ù. °ÈµÈ Á¢¹Ì»ç¹è¿ÀÇ ÇÏÇâ½Ä ¼øȸ Ž»ö°ú ÀÌÀü Ž»ö°á°úÀÇ Àç»ç¿ëÀ» ÀÌ¿ëÇÏ¿© µ¥ÀÌÅͺ£À̽º³»ÀÇ ´Ü¹éÁú Áß¿¡¼ ÁúÀÇ ¼¿ÀÇ ºÎºÐ ¼¿µé°ú ÀÚÁÖ ÀÏÄ¡ÇÏ´Â ¼¿µéÀ» µ¥ÀÌÅͺ£À̽º Å©±â¿Í ¹«°üÇÏ°Ô ÁúÀǼ¿ ±æÀÌÀÇ ¼±Çü ½Ã°£ º¹Àâµµ·Î ã´Â´Ù. ã¾ÆÁø ¼¿µé¿¡ ´ëÇؼ ½º¹Ì½º-¿öÅ͸¸ ¾Ë°í¸®ÁòÀ» »ç¿ëÇÏ¿© ÃÖÁ¾ À¯»ç ´Ü¹éÁúÀ» ã´Â´Ù. Á¦¾È ¹æ¹ýÀº ¼¿Å½»ö¿¡ °¡Àå ³Î¸® ¾²ÀÌ´Â BLAST¿¡ ºñÇؼ ¾à 300¹èÀÇ ºü¸¥ Ž»ö ¼Óµµ¸¦ º¸¿´°í, ´Ü¹éÁúÀÇ ¼¼Æ÷³» À§Ä¡¿¹Ãø¿¡ Àû¿ëÇÒ °æ¿ì BLAST¸¦ »ç¿ëÇÏ´Â ¹æ¹ý¿¡ ºñÇÏ¿© Á¤È®¼ºÀÌ Çâ»óµÇ¾ú´Ù. |
¿µ¹®³»¿ë (English Abstract) |
For predicting subcellular localization of proteins, many methods exploit information of proteins having high sequence similarity to a query sequence. This paper proposes a fast sequence search method to find these highly similar proteins in database. For protein database search, we adopt enhanced suffix arrays which are used for finding the position of query DNA sequences in genome database. We use top-down traversal and reuse of previously searched results of enhanced suffix arrays for fast search. The time complexity for searching candidate proteins having many exact matches to the sub-sequences of a query protein is proportional only to the length of the query sequence, not dependent on database size. Smith-Waterman algorithm is applied to find the most similar protein in these candidate proteins. Comparing with most widely used search method BLAST, the proposed method shows 300 times faster search speed and gives higher prediction accuracies in protein subcellular localization prediction. |
Å°¿öµå(Keyword) |
´Ü¹éÁúÀÇ ¼¼Æ÷³» À§Ä¡ ¿¹Ãø
¼¿ Ž»ö
°ÈµÈ Á¢¹Ì»ç ¹è¿
½º¹Ì½º-¿öÅ͸¸ ¾Ë°í¸®Áò
BLAST
protein subcellular localization prediction
sequence search
enhanced suffix arrays
smith-waterman algorithm
BLAST
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|