Á¤º¸°úÇÐȸ ÄÄÇ»ÆÃÀÇ ½ÇÁ¦ ³í¹®Áö (KIISE Transactions on Computing Practices)
ÇѱÛÁ¦¸ñ(Korean Title) |
¼øÀ§´ÙÁßÆÐÅϸÅĪ¹®Á¦¿¡ ´ëÇÑ °ø°£È¿À²ÀûÀÎ Çؽ̱â¹Ý ¾Ë°í¸®Áò |
¿µ¹®Á¦¸ñ(English Title) |
A Space-Efficient Hashing-Based Algorithm for Order-Preserving Multiple Pattern Matching Problem |
ÀúÀÚ(Author) |
¹ÚÁ¤ÈÆ
±è¿µÈ£
½ÉÁ¤¼·
Jeonghoon Park
Youngho Kim
Jeong Seop Sim
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 24 NO. 08 PP. 0399 ~ 0404 (2018. 08) |
Çѱ۳»¿ë (Korean Abstract) |
±æÀÌ°¡ °°Àº µÎ ¹®ÀÚ¿ x,y °¡ ÁÖ¾îÁ³À» ¶§, x¿Í y ÀÇ ¹®ÀÚµéÀÇ ¼øÀ§°¡ ¸ðµÎ ÀÏÄ¡Çϸé x ¿Í y´Â ¼øÀ§µ¿ÇüÀ̶ó ÇÑ´Ù. ¼øÀ§´ÙÁßÆÐÅϸÅĪ¹®Á¦´Â ÅؽºÆ® T¿Í k°³ÀÇ ÆÐÅϵé·Î ±¸¼ºµÈ ÆÐÅÏÁýÇÕ PÀÌ ÁÖ¾îÁú ¶§, P¿¡ ¼ÓÇÑ ÆÐÅÏ°ú ¼øÀ§µ¿ÇüÀ» ÀÌ·ç´Â TÀÇ ¸ðµç ºÎºÐ¹®ÀÚ¿À» ã´Â ¹®Á¦ÀÌ´Ù. º» ³í¹®¿¡¼´Â q-±×·¥ÀÇ Å©±â¸¦ q¶ó ÇÏ°í ÆÐÅϵéÀÇ ±æÀÌÀÇ ÃÑÇÕÀ» M À̶ó ÇÒ ¶§, ±âÁ¸ÀÇ ¼øÀ§´ÙÁßÆÐÅϸÅĪ¹®Á¦¸¦ ÇØ°áÇÏ´Â Çؽ̱â¹Ý ¾Ë°í¸®ÁòÀ» °³¼±ÇÏ¿© °ø°£º¹Àâµµ¸¦ O (q!+k+M)¿¡¼ O(k+M)À¸·Î ÁÙÀÎ ¾Ë°í¸®ÁòÀ» Á¦½ÃÇÑ´Ù.
|
¿µ¹®³»¿ë (English Abstract) |
Given two strings x and y of the same length, when all ranks of characters in x and y are the same, x is order-isomorphic to y . Given a text T and a pattern set P consisting of k patterns, order-preserving multiple pattern matching problem is to find all substrings in T that are order-isomorphic to any pattern in P. In this paper, when the size of a q-gram is q and the sum of lengths of patterns is M, we propose a space-efficient hashing-based algorithm for order-preserving multiple pattern matching problem to reduce space complexity from O (q! k M)to O(k M)
. |
Å°¿öµå(Keyword) |
ÆÐÅϸÅĪ
¼øÀ§µ¿Çü
¼øÀ§´ÙÁßÆÐÅϸÅĪ
ÇΰÅÇÁ¸°Æ® Å×À̺í
pattern matching
order-isomorphism
order-preserving multiple pattern matching
fingerprint table
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|