scientific article; zbMATH DE number 7765364

DOI10.4230/lipics.isaac.2020.6MaRDI QIDQ6065395

Yoshifumi Sakai, Shunsuke Inenaga

Publication date: 14 November 2023

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

algorithmslongest increasing subsequencedynamic time warping distancesemi-local sequence comparison

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (2)

A faster reduction of the dynamic time warping distance to the longest increasing subsequence length ⋮ A data structure for substring-substring LCS length queries

Cites Work

• A fast algorithm for multiplying min-sum permutations
• Semi-local string comparison: algorithmic techniques and applications
• A substring-substring LCS data structure
• Fast distance multiplication of unit-Monge matrices
• A linear space algorithm for computing maximal common subsequences
• Dynamic programming algorithm optimization for spoken word recognition
• Dynamic Time Warping and Geometric Edit Distance
• Dynamic Time Warping in Strongly Subquadratic Time: Algorithms for the Low-Distance Regime and Approximate Evaluation

This page was built for publication: