Longest Common Subsequence with Gap Constraints
From MaRDI portal
Publication:6134862
DOI10.1007/978-3-031-33180-0_5arXiv2304.05270OpenAlexW4381302785MaRDI QIDQ6134862FDOQ6134862
Authors: Duncan Adamson, Maria Kosche, Tore Koß, Florin Manea, Stefan Siemer 
Publication date: 25 July 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Abstract: We consider the longest common subsequence problem in the context of subsequences with gap constraints. In particular, following Day et al. 2022, we consider the setting when the distance (i. e., the gap) between two consecutive symbols of the subsequence has to be between a lower and an upper bound (which may depend on the position of those symbols in the subsequence or on the symbols bordering the gap) as well as the case where the entire subsequence is found in a bounded range (defined by a single upper bound), considered by Kosche et al. 2022. In all these cases, we present effcient algorithms for determining the length of the longest common constrained subsequence between two given strings.
Full work available at URL: https://arxiv.org/abs/2304.05270
Cites Work
- Title not available (Why is that?)
- Subword histories and Parikh matrices
- Absoluteness of subword inequality is undecidable
- A faster algorithm computing string edit distances
- Title not available (Why is that?)
- A fast algorithm for computing longest common subsequences
- Generalized Pascal triangle for binomial coefficients of words
- The Complexity of Some Problems on Subsequences and Supersequences
- Longest common subsequences of two random sequences
- Software Descriptions with Flow Expressions
- String matching with variable length gaps
- Unshuffling a square is NP-hard
- Longest Common Subsequence with Gap Constraints
- Algorithms for Computing the Longest Parameterized Common Subsequence
- Algorithms for the Longest Common Subsequence Problem
- Directed acyclic subsequence graph -- overview
- Searching subsequences
- Another generalization of abelian equivalence: binomial complexity of infinite words
- Connections between subwords and certain matrix mappings
- On the index of Simon's congruence for piecewise testability
- Title not available (Why is that?)
- Computing the \(k\)-binomial complexity of the Thue-Morse word
- A longest common subsequence algorithm suitable for similar text strings
- Consequences of Faster Alignment of Sequences
- An algorithm for distinguishing efficiently bit-strings by their subsequences
- Multivariate fine-grained complexity of longest common subsequence
- An approach to software system modelling and analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- The height of piecewise-testable languages with applications in logical complexity
- Automata theory on sliding windows
- Querying regular languages over sliding windows
- Absent subsequences in words
- Testing Simon's congruence
- Scattered Factor-Universality of Words
- Title not available (Why is that?)
- Fast and deterministic constant factor approximation algorithms for LCS imply new circuit lower bounds
- Languages ordered by the subword order
- Title not available (Why is that?)
- The subtrace order and counting first-order logic
- The complexity of downward closure comparisons
- Title not available (Why is that?)
- Randomized sliding window algorithms for regular languages
- Subsequences in bounded ranges: matching and analysis problems
Cited In (5)
This page was built for publication: Longest Common Subsequence with Gap Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6134862)
