Computer Science ›› 2008, Vol. 35 ›› Issue (3): 264-266.
Previous Articles Next Articles
GUI Yong-Kun （Shanghai Key Library of Intelligent Information Processing, Fudan University, Shanghai 200433）
Online:
Published:
Abstract: 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 inc
Key words: Bounded heap, van Erode Boer Tree, LCWIS, Bioinformatics
GUI Yong-Kun （Shanghai Key Library of Intelligent Information Processing, Fudan University, Shanghai 200433）. [J].Computer Science, 2008, 35(3): 264-266.
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: https://www.jsjkx.com/EN/
https://www.jsjkx.com/EN/Y2008/V35/I3/264
Cited
Home