The longest commonly positioned increasing subsequences problem

DOI10.1007/S10878-017-0170-9MaRDI QIDQ1702817zbMATH OpenOpenAlexFDO

Authors Xiaozhou He, Yinfeng 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)

Recommendations

• Algorithms and Computation
• A diagonal-based algorithm for the longest common increasing subsequence problem
• A fast algorithm for computing a longest common increasing subsequence
• Efficient algorithms for finding a longest common increasing subsequence
• Faster algorithms for computing longest common increasing subsequences

Cites work

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

Cited in

(5)

• The Longest Almost-Increasing Subsequence
• Enumerating longest increasing subsequences and patience sorting
• The longest filled common subsequence problem
• Computing longest (common) Lyndon subsequences
• Computing longest Lyndon subsequences and longest common Lyndon subsequences

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

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