The longest commonly positioned increasing subsequences problem

DOI10.1007/s10878-017-0170-9zbMath1394.90483OpenAlexW2755277056MaRDI QIDQ1702817

Xiaozhou He, Yin-Feng Xu

Publication date: 1 March 2018

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-017-0170-9

zbMATH Keywords

algorithmslongest increasing subsequencedual relationshipcommon positionslongest common increasing subsequence

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (2)

Computing longest (common) Lyndon subsequences ⋮ Computing longest Lyndon subsequences and longest common Lyndon subsequences

Cites Work

• Faster algorithms for computing longest common increasing subsequences
• A fast algorithm for computing a longest common increasing subsequence
• Efficient algorithms for finding a longest common increasing subsequence
• A faster algorithm computing string edit distances
• On computing the length of longest increasing subsequences
• Preserving order in a forest in less than logarithmic time and linear space
• Fast computation of a longest increasing subsequence and application

This page was built for publication: The longest commonly positioned increasing subsequences problem