Longest Increasing Subsequence under Persistent Comparison Errors
Sign Up to like & getrecommendations! Published in 2020 at "Theory of Computing Systems"
DOI: 10.1007/s00224-020-09966-9
Abstract: We study the problem of computing a longest increasing subsequence in a sequence S of n distinct elements in the presence of persistent comparison errors. In this model, Braverman and Mossel ( Noisy sorting without… read more here.
Keywords: persistent comparison; log; subsequence; longest increasing ... See more keywords
Tight Conditional Lower Bounds for Longest Common Increasing Subsequence
Sign Up to like & getrecommendations! Published in 2018 at "Algorithmica"
DOI: 10.1007/s00453-018-0485-7
Abstract: We consider the canonical generalization of the well-studied Longest Increasing Subsequence problem to multiple sequences, called k-LCIS: Given k integer sequences $$X_1,\dots ,X_k$$X1,⋯,Xk of length at most n, the task is to determine the length… read more here.
Keywords: longest common; time; subsequence; lower bounds ... See more keywords