Àüü
ÀüÀÚ/Àü±â
Åë½Å
ÄÄÇ»ÅÍ
·Î±×ÀÎ
ȸ¿ø°¡ÀÔ
About Us
ÀÌ¿ë¾È³»
¿¬±¸¹®Çå
±¹³» ³í¹®Áö
¿µ¹® ³í¹®Áö
±¹³» ÇÐȸÁö
Çмú´ëȸ ÇÁ·Î½Ãµù
±¹³» ÇÐÀ§ ³í¹®
³í¹®Á¤º¸
¹é¼
±³À°Á¤º¸
¿¬±¸ ù°ÉÀ½
ÇаúÁ¤º¸
°ÀÇÁ¤º¸
µ¿¿µ»óÁ¤º¸
E-Learning
¿Â¶óÀÎ Àú³Î
½ÉÈÁ¤º¸
¿¬±¸ ¹× ±â¼úµ¿Çâ
Áֿ俬±¸ÅäÇÈ
ÁÖ¿ä°úÁ¦ ¹× ±â°ü
Çؿܱâ°ü °ü·ÃÀÚ·á
¹ÙÀÌ¿À Á¤º¸±â¼ú
ÁÖ¿ä Archive Site
Æ÷Ä¿½ºiN
¿¬±¸ÀÚ Á¤º¸
¶óÀÌ¡½ºÅ¸
ÆÄ¿öiNÅͺä
¼¼ÁßÇÑ
¿¬±¸ÀÚ·á
¹®ÀÚ DB
¿ë¾î»çÀü
¾Ë¸²¸¶´ç
ºÎ½Ç ÇмúÈ°µ¿ ¿¹¹æ
³í¹®¸ðÁý
´ëȸ¾È³»
What's New
¿¬±¸ºñÁ¤º¸
±¸ÀÎÁ¤º¸
°øÁö»çÇ×
CSERIC ±¤Àå
Post-Conference
¿¬±¸ÀÚ Ä«Æä
ÀÚÀ¯°Ô½ÃÆÇ
Q&A
´Ý±â
»çÀÌÆ®¸Ê
¿¬±¸¹®Çå
±¹³» ³í¹®Áö
¿µ¹® ³í¹®Áö
±¹³» ÇÐȸÁö
Çмú´ëȸ ÇÁ·Î½Ãµù
±¹³» ÇÐÀ§ ³í¹®
³í¹®Á¤º¸
¹é¼
±³À°Á¤º¸
¿¬±¸ ù°ÉÀ½
ÇаúÁ¤º¸
°ÀÇÁ¤º¸
µ¿¿µ»óÁ¤º¸
E-Learning
¿Â¶óÀÎ Àú³Î
½ÉÈÁ¤º¸
¿¬±¸ ¹× ±â¼úµ¿Çâ
Áֿ俬±¸ÅäÇÈ
ÁÖ¿ä°úÁ¦ ¹× ±â°ü
Çؿܱâ°ü °ü·ÃÀÚ·á
¹ÙÀÌ¿À Á¤º¸±â¼ú
ÁÖ¿ä Archive Site
ÄÄÇ»ÅÍiN
¿¬±¸ÀÚ Á¤º¸
¿¬±¸ÀÚ·á
¹®ÀÚ DB
Ȧ·Î±×·¥ DB
¿ë¾î»çÀü
¾Ë¸²¸¶´ç
ºÎ½Ç ÇмúÈ°µ¿ ¿¹¹æ
³í¹®¸ðÁý
´ëȸ¾È³»
What's New
¿¬±¸ºñ Á¤º¸
±¸ÀÎÁ¤º¸
°øÁö»çÇ×
IT Daily
CSERIC ±¤Àå
Post-Conference
¿¬±¸ÀÚ Ä«Æä
ÀÚÀ¯°Ô½ÃÆÇ
Q&A
¼ºñ½º ¹Ù·Î°¡±â
¼³¹®Á¶»ç
¿¬±¸À±¸®
°ü·Ã±â°ü
Please wait....
¿¬±¸¹®Çå
±¹³» ³í¹®Áö
¿µ¹® ³í¹®Áö
±¹³» ÇÐȸÁö
Çмú´ëȸ ÇÁ·Î½Ãµù
±¹³» ÇÐÀ§ ³í¹®
³í¹®Á¤º¸
¹é¼
±¹³» ³í¹®Áö
Ȩ > ¿¬±¸¹®Çå > ±¹³» ³í¹®Áö >
Çѱ¹Á¤º¸°úÇÐȸ ³í¹®Áö
>
Á¤º¸°úÇÐȸ ³í¹®Áö A : ½Ã½ºÅÛ ¹× ÀÌ·Ð
Á¤º¸°úÇÐȸ ³í¹®Áö A : ½Ã½ºÅÛ ¹× ÀÌ·Ð
Current Result Document :
1
/ 10
´ÙÀ½°Ç
ÇѱÛÁ¦¸ñ(Korean Title)
DNA ¼¿À» À§ÇÑ ºü¸¥ ¸ÅĪ ±â¹ý
¿µ¹®Á¦¸ñ(English Title)
Fast Matching Method for DNA Sequences
ÀúÀÚ(Author)
±èÁø¿í
±èÀº»ó
¾ÈÀ¶±â
¹Ú±Ù¼ö
Jin Wook Kim
Eunsang Kim
Yoongki Ahn
Kunsoo Park
¿ø¹®¼ö·Ïó(Citation)
VOL 36 NO. 04 PP. 0231 ~ 0238 (2009. 08)
Çѱ۳»¿ë
(Korean Abstract)
DNA ¼¿Àº °¢ Á¾À» ³ªÅ¸³»´Â ±Ùº»ÀûÀÎ Á¤º¸À̸ç, ´Ù¸¥ Á¾ °£ÀÇ DNA ¼¿ ºñ±³´Â Áß¿äÇÑ ÀÛ¾÷ÀÌ´Ù. DNA ¼¿Àº ±æÀÌ°¡ ¸Å¿ì ±æ¸ç ¶Ç Á¾ÀÇ Á¾·ùµµ ´Ù¾çÇϱ⠶§¹®¿¡, DNA ¼¿ ºñ±³¿¡¼´Â ºü¸¥ ¸ÅĪ »Ó¸¸ ¾Æ´Ï¶ó È¿À²ÀûÀÎ ÀúÀåµµ Áß¿äÇÑ ¿ä¼ÒÀÌ´Ù. Áï, ÀÎÄÚµù µÈ DNA ¼¿¿¡ ÀûÇÕÇÑ ºü¸¥ ¹®ÀÚ¿ ¸ÅĪ ¹æ¹ýÀÌ ÇÊ¿äÇÏ´Ù. º» ³í¹®¿¡¼´Â ¸ÅĪ ½Ã µðÄÚµùÀÌ ÇÊ¿äÇÏÁö ¾ÊÀº ÀÎÄÚµù µÈ DNA ¼¿À» À§ÇÑ ºü¸¥ ¸ÅĪ ¾Ë°í¸®ÁòÀ» Á¦½ÃÇÑ´Ù. Á¦½ÃÇÏ´Â ¾Ë°í¸®ÁòÀº ³× ¹®ÀÚ ÇÑ ¹ÙÀÌÆ® ÀÎÄÚµùÀ» ÀÌ¿ëÇÏ¸ç ¼ÇȽº ±â¹ý°ú ´ÙÁß ÆÐÅÏ ¸ÅĪ ±â¹ýÀ» Á¢¸ñÇÏ°í ÀÖ´Ù. ½ÇÇè °á°ú·Î´Â º» ³í¹®¿¡¼ Á¦½ÃÇÏ´Â ¹æ¹ýÀÌ AGREPº¸´Ù ¾à ´Ù¼¸¹è ºü¸§À» º¸À̴µ¥, ÀÌ´Â ¾Ë·ÁÁø ¾Ë°í¸®Áòµé Áß¿¡¼ °¡Àå ºü¸¥ °á°úÀÌ´Ù.
¿µ¹®³»¿ë
(English Abstract)
DNA sequences are the fundamental information for each species and a comparison between DNA sequences of different species is an important task. Since DNA sequences are very long and there exist many species, not only fast matching but also efficient storage is an important factor for DNA sequences. Thus, a fast string matching method suitable for encoded DNA sequences is needed. In this paper, we present a fast string matching method for encoded DNA sequences which does not decode DNA sequences while matching. We use four-characters-to-one-byte encoding and combine a suffix approach and a multi-pattern matching approach. Experimental results show that our method is about 5 times faster than AGREP and the fastest among known algorithms.
Å°¿öµå(Keyword)
¹®ÀÚ¿ ¸ÅĪ
ÀÎÄÚµùµÈ DNA ¼¿
´ÙÁß ÆÐÅÏ ¸ÅĪ
string matching
encoded DNA sequences
multi-pattern matching
ÆÄÀÏ÷ºÎ
PDF ´Ù¿î·Îµå
¸ñ·Ï
Copyright(c)
Computer Science Engineering Research Information Center
. All rights reserved.