相关参考文献
注意：仅列出部分参考文献，下载原文获取全部文献信息。Computing a longest common subsequence that is almost increasing on sequences having no repeated elements
Johra Muhammad Moosa et al.
JOURNAL OF DISCRETE ALGORITHMS (2013)
The longest almost-increasing subsequence
Amr Elmasry
INFORMATION PROCESSING LETTERS (2010)
A fast algorithm for computing a longest common increasing subsequence
IH Yang et al.
INFORMATION PROCESSING LETTERS (2005)
Fast algorithms for large-scale genome alignment and comparison
AL Delcher et al.
NUCLEIC ACIDS RESEARCH (2002)
分享论文
