演講摘要：
The longest common subsequence (LCS) problem with gap constraints (or the gapped LCS), which has applications to genetics and molecular biology, is an interesting and useful variant to the LCS problem. In this talk, efficient algorithms based on incremental suffix maximum query (ISMQ) for finding gapped LCS will be introduced. In addition, the speaker would like to show that ISMQ can be used to improve time complexities in previous papers.