Longest Increasing Subsequence Example This example demonstrates how to use the Competitive Programming Runner (comper) to create and solve the Longest Increasing Subsequence (LIS) problem in C++.

LeetCode problem description Given an integer array nums, return the length of the longest strictly increasing subsequence.

The longest common subsequence (LCS) problem, a long‐standing challenge in computer science and bioinformatics, seeks to identify the maximum sequence of characters shared by multiple strings ...

Dynamic Time Warping (DTW) is effective for subsequence matching but is limited by its high computational cost. To address this challenge, we propose a method that adaptively segments data streams and ...

In this paper we propose a fast and memory efficient Dynamic Time Warping (MES-DTW) algorithm for the task of Query-by-Example Spoken Term Detection (QbE-STD). The proposed algorithm is based on the ...