A linear algorithm for 3-letter longest common weakly increasing subsequence
type: Item
instance of: scholarly article
title: A linear algorithm for 3-letter longest common weakly increasing subsequence
zbMATH Open document ID: 1259.68251
author: Lech Duraj
published in: Information Processing Letters
publication date: 2013-03-20T00:00:00Z
Mathematics Subject Classification ID: 68W32
Mathematics Subject Classification ID: 68R15
zbMATH DE Number: 6147218
zbMATH Keywords: longest common weakly increasing subsequence
MaRDI profile type: Publication
full work available at URL: j.ipl.2012.11.007
OpenAlex ID: W2072324986
DOI: 10.1016/J.IPL.2012.11.007
description: scientific article; zbMATH DE number 6147218