The longest commonly positioned increasing subsequences problem

Xiaozhou He () and Yinfeng Xu ()
Additional contact information
Xiaozhou He: Sichuan University
Yinfeng Xu: Sichuan University

Journal of Combinatorial Optimization, 2018, vol. 35, issue 2, No 1, 340 pages

Abstract: Abstract Based on the well-known longest increasing subsequence problem and longest common increasing subsequence (LCIS) problem, we propose the longest commonly positioned increasing subsequences (LCPIS) problem. Let $$A=\langle a_1,a_2,\ldots ,a_n\rangle $$ A = ⟨ a 1 , a 2 , … , a n ⟩ and $$B{=}\left\langle b_1,b_2,\ldots ,b_n\right\rangle $$ B = b 1 , b 2 , … , b n be two input sequences. Let $${ Asub}=\left\langle a_{i_1},a_{i_2},\ldots ,a_{i_l}\right\rangle $$ A s u b = a i 1 , a i 2 , … , a i l be a subsequence of A and $${ Bsub}=\left\langle b_{j_1},b_{j_2},\ldots ,b_{j_l}\right\rangle $$ B s u b = b j 1 , b j 2 , … , b j l be a subsequence of B such that $$a_{i_k}\le a_{i_{k+1}}, b_{j_k}\le b_{j_{k+1}}(1\le k

Keywords: Longest increasing subsequence; Common positions; Algorithms; Dual relationship; Longest common increasing subsequence (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-017-0170-9 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:35:y:2018:i:2:d:10.1007_s10878-017-0170-9

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-017-0170-9

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().