A fast algorithm for computing a longest common increasing subsequence
type: Item
instance of: scholarly article
title: A fast algorithm for computing a longest common increasing subsequence
zbMATH Open document ID: 1173.68839
author: I-Hsuan Yang
author: Chien-Pin Huang
author: Kun-Mao Chao
published in: Information Processing Letters
publication date: 2009-08-27T00:00:00Z
full work available at URL: http://ntur.lib.ntu.edu.tw//handle/246246/154520
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 5599214
zbMATH Keywords: algorithms
zbMATH Keywords: computational biology
zbMATH Keywords: longest common subsequence
zbMATH Keywords: longest increasing subsequence
describes a project that uses: MUMMER
MaRDI profile type: Publication
OpenAlex ID: W2152064395
cites work: Enumerating longest increasing subsequences and patience sorting
cites work: On computing the length of longest increasing subsequences
cites work: A fast algorithm for computing longest common subsequences
cites work: Q4057549
cites work: Q3992671
cites work: A faster algorithm computing string edit distances
cites work: Good splitters for counting points in triangles
cites work: Longest Increasing and Decreasing Subsequences
DOI: 10.1016/J.IPL.2004.10.014
description: scientific article; zbMATH DE number 5599214