发明名称 METHOD FOR EXTRACTING LONGEST COMMON SUB-SEQUENCE IN SEQUENCE WITHOUT APPEARANCE OF DUPLICATED TOKEN
摘要 <p>A method for extracting a longest common sub-sequence (LCS) from two sequences is applied to the extraction of partial data which is commonly included from data in bulk such as the analysis of protein sequence. The method for extracting an LCS has to trace cases for a pair of possible tokens since the token, which is the smallest unit configuring a sequence, appears several times on the sequence, generally. In case the token does not appear on the sequence two or more times, however, the LCS is able to be extracted more rapidly than an existing method. The present invention is able to extract the LCS in the sequence, in which the token is not duplicated, more rapidly than the existing method.</p>
申请公布号 KR20140140677(A) 申请公布日期 2014.12.10
申请号 KR20130061174 申请日期 2013.05.29
申请人 IUCF-HYU (INDUSTRY-UNIVERSITY COOPERATION FOUNDATION HANYANG UNIVERSITY) 发明人 LEE, YEO REUM;LM, EUL GYU;KANG, BOO JOONG
分类号 G06F17/00 主分类号 G06F17/00
代理机构 代理人
主权项
地址