Á¤º¸Ã³¸®ÇÐȸ ³í¹®Áö A
Current Result Document : 1 / 1
ÇѱÛÁ¦¸ñ(Korean Title) |
½ºÆ®¸µÀÇ ÃÖ´ë ¼ÇȽº¸¦ °è»êÇÏ´Â È¿À²ÀûÀÎ ¿ÜºÎ ¸Þ¸ð¸® ¾Ë°í¸®Áò |
¿µ¹®Á¦¸ñ(English Title) |
Efficient External Memory Algorithm for Finding the Maximum Suffix of a String |
ÀúÀÚ(Author) |
±è¼º±Ç
±è¼öö
Á¶Á¤½Ä
Sung Kwon Kim
Soocheol Kim
Jungsik Cho
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 15-A NO. 04 PP. 0239 ~ 0242 (2008. 08) |
Çѱ۳»¿ë (Korean Abstract) |
¿ÜºÎ ¸Þ¸ð¸® °è»ê ¸ðµ¨¿¡¼ ½ºÆ®¸µÀÇ ÃÖ´ë¼ÇȽº¸¦ ã´Â ¹®Á¦¸¦ °í·ÁÇÑ´Ù. ¿ÜºÎ¸Þ¸ð¸® ¸ðµ¨¿¡¼´Â µð½ºÅ©¿Í ³»ºÎ¸Þ¸ð¸® »çÀÌÀÇ µð½ºÅ© ÀÔÃâ·Â Ƚ¼ö¸¦ ÁÙÀÌ´Â ¾Ë°í¸®ÁòÀ» ¼³°èÇÏ´Â °ÍÀÌ Áß¿ä »çÇ×ÀÌ´Ù. ±æÀÌ°¡ NÀÎ ½ºÆ®¸µÀº N°³ÀÇ ¼ÇȽº¸¦ °¡Áö´Âµ¥, ÀÌÁß¿¡¼ »çÀü ¼ø¼¿¡ µû¶ó °¡Àå Å« °ÍÀ» ÃÖ´ë ¼ÇȽº¶ó ºÎ¸¥´Ù. ÃÖ´ë¼ÇȽº¸¦ ±¸ÇÏ´Â °ÍÀº ¿©·¯ ½ºÆ®¸µ ¹®Á¦¸¦ ÇØ°áÇÏ´Â µ¥ Áß¿äÇÑ ¿ªÇÒÀ» ÇÑ´Ù. º» ³í¹®¿¡¼´Â ±æÀÌ°¡ NÀÎ ½ºÆ®¸µÀÇ ÃÖ´ë ¼ÇȽº¸¦ ±¸ÇÏ´Â ¿ÜºÎ¸Þ¸ð¸® ¾Ë°í¸®ÁòÀ» Á¦½ÃÇÑ´Ù. ÀÌ ¾Ë°í¸®ÁòÀº ³× °³ÀÇ ³»ºÎ ¸Þ¸ð¸® ºí·ÏÀ» »ç¿ëÇÏ°í ÃÖ´ë 4(N/L)¹øÀÇ µð½ºÅ© ÀÔÃâ·ÂÀ» ÇÑ´Ù. ¿©±â¼ LÀº ºí·ÏÀÇ Å©±âÀÌ´Ù. |
¿µ¹®³»¿ë (English Abstract) |
We study the problem of finding the maximum suffix of a string on the external memory model of computation with one disk. In this model, we are primarily interested in designing algorithms that reduce the number of I/Os between the disk and the internal memory. A string of length has suffixes and among these, the lexicographically largest one is called the maximum suffix of the string. Finding the maximum suffix of a string plays a crucial role in solving some string problems. In this paper, we present an external memory algorithm for computing the maximum suffix of a string of length. The algorithm uses four blocks in the internal memory and performs at most 4 disk I/Os, where is the size of a block. |
Å°¿öµå(Keyword) |
½ºÆ®¸µ
ÃÖ´ë ¼ÇȽº
¿ÜºÎ¸Þ¸ð¸® ¾Ë°í¸®Áò
External Memory Algorithms
Maximum Suffix
String
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|