A CGM Algorithm Solving the Longest Increasing Subsequence Problem

DOI10.1007/11751649_2MaRDI QIDQ3603018zbMATH OpenOpenAlexFDO

Authors David Semé

Publication date 12 February 2009

Published in Computational Science and Its Applications - ICCSA 2006 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11751649_2

zbMATH Keywords

coarse grained multicomputerslongest increasing subsequenceparallel algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10) Algorithms on strings (68W32)

Recommendations

• A Sub-Quadratic Algorithm for the Longest Common Increasing Subsequence Problem.
• A fast algorithm for computing a longest common increasing subsequence
• An efficient algorithm for enumerating longest common increasing subsequences
• An algorithm for the determination of longest increasing subsequence in a sequence
• A Faster Subquadratic Algorithm for the Longest Common Increasing Subsequence Problem
• A diagonal-based algorithm for the longest common increasing subsequence problem
• Fast computation of a longest increasing subsequence and application
• A linear space algorithm for computing a longest common increasing subsequence
• Computing the longest common almost-increasing subsequence
• An improved algorithm for the longest common subsequence problem

Cited in

(1)

• A divide and conquer approach and a work-optimal parallel algorithm for the LIS problem

This page was built for publication: A CGM Algorithm Solving the Longest Increasing Subsequence Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3603018)