A linear space algorithm for computing a longest common increasing subsequence
type: Item
instance of: scholarly article
title: A linear space algorithm for computing a longest common increasing subsequence
zbMATH Open document ID: 1186.68589
author: Yoshifumi Sakai
published in: Information Processing Letters
publication date: 2010-01-29T00:00:00Z
Mathematics Subject Classification ID: 68W32
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 5664486
zbMATH Keywords: algorithms
zbMATH Keywords: longest common subsequence
zbMATH Keywords: longest increasing subsequence
describes a project that uses: MUMMER
MaRDI profile type: Publication
full work available at URL: j.ipl.2006.05.005
OpenAlex ID: W1983269319
cites work: Faster algorithms for computing longest common increasing subsequences
cites work: Enumerating longest increasing subsequences and patience sorting
cites work: Algorithms and Computation
cites work: An almost-linear time and linear space algorithm for the longest common subsequence problem
cites work: A linear space algorithm for computing maximal common subsequences
cites work: A faster algorithm computing string edit distances
cites work: Longest Increasing and Decreasing Subsequences
cites work: A fast algorithm for computing a longest common increasing subsequence
DOI: 10.1016/J.IPL.2006.05.005
description: scientific article; zbMATH DE number 5664486