Faster algorithms for computing longest common increasing subsequences
type: Item
instance of: scholarly article
title: Faster algorithms for computing longest common increasing subsequences
zbMATH Open document ID: 1230.68225
author: Gerth Stølting Brodal
author: Kanela Kaligosi
author: Irit Katriel
author: Martin Kuetz
published in: Journal of Discrete Algorithms
publication date: 2012-01-04T00:00:00Z
Mathematics Subject Classification ID: 68W32
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 5994303
zbMATH Keywords: common subsequences
zbMATH Keywords: increasing subsequences
zbMATH Keywords: small alphabets
zbMATH Keywords: Van Emde Boas trees
MaRDI profile type: Publication
full work available at URL: j.jda.2011.03.013
OpenAlex ID: W2131441444
cites work: Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem
cites work: Enumerating longest increasing subsequences and patience sorting
cites work: Efficient algorithms for finding a longest common increasing subsequence
cites work: On computing the length of longest increasing subsequences
cites work: A linear space algorithm for computing maximal common subsequences
cites work: A fast algorithm for computing longest common subsequences
cites work: A faster algorithm computing string edit distances
cites work: Priority Search Trees
cites work: A linear space algorithm for computing a longest common increasing subsequence
cites work: Design and implementation of an efficient priority queue
cites work: The String-to-String Correction Problem
cites work: Log-logarithmic worst-case range queries are possible in space theta(N)
cites work: A fast algorithm for computing a longest common increasing subsequence
DOI: 10.1016/J.JDA.2011.03.013
description: scientific article; zbMATH DE number 5994303