Patents
- ÀÌÁøÀÎÄÚµùÀ» ÀÌ¿ëÇÑ È£½ºÇ® ¾Ë°í¸®Áò ±â¹Ý ¼øÀ§ÆÐÅϸÅĪ ¹æ¹ý ¹× ÀåÄ¡(Method and Apparatus for An Order-Preserving Pattern Matching based on the Horspool Algorithm using Binary Encoding), 2021
- ºÐÇÒ¼øÀ§ÆÐÅϸÅĪ ¾Ë°í¸®Áò(An algorithm for order-preserving pattern matching with partition), 2021
- °ø°£È¿À²ÀûÀÎ ¼øÀ§´ÙÁßÆÐÅϸÅĪ ¾Ë°í¸®Áò(A SPACE-EFFICIENT ORDER-PRESERVING MULTIPLE PATTERN MATCHING ALGORITHM), 2020
- 2Â÷ q-±×·¥¿¡ ´ëÇÑ ÇΰÅÇÁ¸°Æ®¸¦ ÀÌ¿ëÇÑ ¼øÀ§ÆÐÅϸÅĪ ¾Ë°í¸®Áò(AN ORDER-PRESERVING PATTERN MATCHING ALGORITHM USING FINGERPRINT OF SECONDARY Q-GRAMS), 2020
- »ç°¢¸Á ¼ø¿ÆÐÅϸÅĪÀ» À§ÇÑ º´·Ä ¾Ë°í¸®Áò(PARALLEL ALGORITHM FOR BOXED-MESH PERMUTATION PATTERN MATCHING), 2019
- £Ú£ÇÔ¼ö¸¦ ÀÌ¿ëÇÑ ¼øÀ§ÆÐÅϸÅĪ°ú ¼øÀ§´ÙÁßÆÐÅϸÅĪ º´·Ä °è»ê ¹æ¹ý(PARALLEL COMPUTATION METHOD OF Z-FUNCTION FOR ORDER-PRESERVING PATTERN MATCHING AND ORDER-PRESERVING MULTIPLE PATTERN MATCHING), 2019
- ÀúÀü·Â ½ºÆ®¸®¹ÖÀ» À§ÇÑ ¹æ¹ý ¹× ½Ã½ºÅÛ(METHOD AND SYSTEM FOR LOW POWER STREAMING), 2019
- Á¤¼ö¹®ÀÚÁýÇÕ¿¡ ´ëÇÑ ¹®ÀÚ¿ÀÇ ¥ä-±Ù»çÁÖ±â¿Í ¥ã-±Ù»çÁֱ⠰è»ê ¹æ¹ý(A METHOD OF COMPUTING ¥ä-APPROXIMATE PERIODS AND ¥ã-APPROXIMATE PERIODS OF STRINGS OVER INTEGER ALPHABETS), 2018
- Çؽ̱â¹ÝÀÇ ¼øÀ§´ÙÁßÆÐÅϸÅĪ ¹æ¹ý(A METHOD FOR ORDER-PRESERVING MULTIPLE PATTERN MATCHING BASED ON HASHING), 2016
- »ç°¢¸Á ¼ø¿ÆÐÅϸÅĪÀ» À§ÇÑ È¿À²ÀûÀÎ ¾Ë°í¸®Áò(AN EFFICIENT ALGORITHM FOR BOXED MESH PERMUTATION PATTERN MATCHING), 2016
- ¾ÐÃàµÈ ¹®ÀÚ¿¿¡ ´ëÇÑ Boyer-Moore-Horspool ¾Ë°í¸®Áò ±â¹Ý ÆÐÅϸÅĪ ¹æ¹ý(A METHOD OF PATTERN MATCHING ON COMPRESSED TEXTS BASED ON BOYER-MOORE-HORSPOOL ALGORITHM), 2016
- 4-·¯½Ã¾È ¾Ë°í¸®Áò ±â¹Ý ÆíÁý°Å¸®°è»êÀÇ Àüó¸® ´Ü°è °³¼± ¹æ¹ý ¹× ½Ã½ºÅÛ(Method and System for Improvement of the Preprocessing Step of the Four-Russians'' Algorithm for Computing Edit Distances), 2015
- ´ÙÇ×½Ä °ö¼ÀÀ» ÀÌ¿ëÇÑ ±Ù»ç ÆÐÅϸÅĪ ¹æ¹ý ¹× ÀåÄ¡(Method and Apparatus for Approximate Pattern Matching Using Polynomial Multiplication), 2015
- DNA ¼¿ ºÐ¼®À» À§ÇÑ °Å¸®ÇÕ ±â¹Ý ¹®ÀÚ¿ÀÇ ±Ù»çÁֱ⠰è»ê ¹æ¹ý(ALGORITHM FOR FINDING APPROXIMATE PERIOD OF STRING BASED ON DISTANCE SUM), 2014
- Á¢¹Ì»ç Æ®¸®ÀÇ º´·Ä »ý¼ºÀ» À§ÇÑ Æ®¶óÀÌ ÀڷᱸÁ¶ ±â¹Ý Á¢¹Ì»ç º´·Ä ºÐÇÒ ¹æ¹ý(PARALLEL SUFFIX PARTITIONING METHOD FOR PARALLEL SUFFIX TREE CONSTRUCTION USING TRIE), 2014
- ±³È¯ ¿¬»êÀ» Æ÷ÇÔÇÑ È®ÀåÆíÁý°Å¸®ÀÇ °è»êÀ» º´·ÄÀûÀ¸·Î ¼öÇàÇϱâ À§ÇÑ ¹æ¹ý(METHOD FOR PARALLEL COMPUTATION OF EXTENDED EDIT DISTANCE INCLUDING SWAP OPERATION), 2013
- À¯Çâ±×·¡ÇÁ¸¦ ÀÌ¿ëÇÑ ºñ¸ð¼ø »óÀ§ ¹®ÀÚ¿ °Ë»ö ¹æ¹ý(A METHOD FOR FINDING CONSISTENT SUPERSTRINGS USING DIRECTED GRAPHS), 2013
- CUDA¸¦ ÀÌ¿ëÇÑ ÃÖÀå°øÅëºñ»óÀ§¹®ÀÚ¿ ±×·¡ÇÁ ¸ðµ¨ÀÇ º´·Ä »ý¼º ¹æ¹ý(PARALLEL CONSTRUCTION FOR GRAPH MODEL OF LONGEST COMMON NON-SUPERSTRING USING COMPUTE UNIFIED DEVICE ARCHITECTURE), 2012
- µ¿¿µ»ó Àç»ý ½Ã µð½ºÅ© ¼Ò¸ð ¿¡³ÊÁö °¨¼Ò¸¦ À§ÇÑ µ¥ÀÌÅÍ ¼±¹ÝÀÔ ¹æ¹ý(PREFETCHING METHOD FOR REDUCING DISK ENERGY CONSUMPTION IN VI), 2012
- ±ÝÁö¹®ÀÚ¿ ºÒÆ÷ÇÔ °áÁ¤À» À§ÇÑ ¹æÇâ ±×·¡ÇÁ »ý¼º ¹æ¹ý(METHOD OF CREATING DIRECTIVITY GRAPH FOR SEARCH NONSUPERSTRING NON-IN), 2012
- ÆÐÅÏ °Ë»öÀ» ÅëÇÑ Ä§ÀÔ Å½Áö ¹æ¹ý(A METHOD FOR INTRUSION DETECTION BY PATTERN SEARCH), 2011
- Á¢µÎ»ç ±×·¡ÇÁ ¸ðµ¨¿¡ ±â¹ÝÇÑ µ¿Àû ÃÖÀå°øÅëºñ»óÀ§¹®ÀÚ¿ °Ë»ö ¹æ¹ý(METHOD FOR FINDING DYNAMIC LONGEST COMMON NONSUPERSTRING BASED), 2011
- Á¢¹Ì»ç ¹è¿À» ÀÌ¿ëÇÑ ÃÖÀå°øÅëºñ»óÀ§¹®ÀÚ¿ °Ë»ö ¹æ¹ý(METHOD FOR FINDING LONGEST COMMON NON-SUPERSTRINGS USING SUFFIX ARRAYS), 2011
- Æ®·£½ºÄÚµù ¼¹ö¿¡¼ ºÐ±âÇÑÁ¤ ±â¹ýÀ» ÀÌ¿ëÇÑ ÀúÀå°ø°£ °ü¸® ¹æ¹ý (A METHOD FOR MANAGING STORAGE OF A TRANSCODING SERVER USING A BR), 2009
- Æ®·£½ºÄÚµù ¼¹ö¿¡¼ ºÐ±âÇÑÁ¤ ±â¹ýÀ» ÀÌ¿ëÇÑ ÀúÀå°ø°£ °ü¸® ¹æ¹ý, 2008
- Æ®·£½ºÄÚµù ¼¹öÀÇ ±â¾ï °ø°£À» °ü¸®ÇÏ´Â ¹æ¹ý (A METHOD FOR MANAGING STORAGE OF A TRANSCODING SERVER), 2008
- À¯»ç¼¿ ÃßÃâÀ» ÅëÇÑ Àü»çÀÎÀÚ °áÇÕºÎÀ§ ¿¹Ãø ÀåÄ¡ ¹× ±×¹æ¹ý (Apparatus for predicting transcription factor bindingsites based), 2005
- Áøµ¿ ³×Æ®¿öÅ©¸¦ ÀÌ¿ëÇÑ ¼¼Æ÷ºÐ¿ ³×Æ®¿öÅ© ±¸¼º¹æ¹ý (Method for network of cell division regulation usingOscillation Network), 2005