%0 Journal Article
%T O(nloglogn) Algorithm for LCWIS over 3 Letters<br>3字符最长公共弱递增子串的O（nloglogn）算法
%A GUI Yong-Kun
%A <br>归泳昆
%J 计算机科学
%D 2008
%I 
%X Longest common subsequence(LCS) and longest increasing subsequence(LIS) are two classic algorithm problems. Both of them have important applications in bioinformatics. In 2006,Brodal et al. proposed another string problem called longest common weakly increasing substring(LCWIS) problem,and they gave a linear time algorithm on 2-letter LCWIS problem,and a O(nlogn) time algorithm on 3-letter LCWIS problem. In our paper,we present a new algorithm on 3-letter LCWIS problem. This algorithm relies on existing sop...
%K Bounded heap
%K van Emde Boer Tree
%K LCWIS
%K Bioinformatics<br>约束堆
%K vailEmdeBoas树
%K 最长弱递增公共子串
%K 生物信息学
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=FC2CA8D4A2B54767150F3E41142A4D46&yid=67289AFF6305E306&vid=6209D9E8050195F5&iid=38B194292C032A66&sid=7ABC4505E3960D2B&eid=4FE459D71E3BF8EB&journal_id=1002-137X&journal_name=计算机科学&referenced_num=0&reference_num=9