Subsequences in bounded ranges: matching and analysis problems
From MaRDI portal
Publication:6173109
DOI10.1007/978-3-031-19135-0_10arXiv2207.09201OpenAlexW4313130618MaRDI QIDQ6173109
Viktoriya Pak, Florin Manea, Maria Kosche, Tore Koß
Publication date: 21 July 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2207.09201
Related Items (3)
Longest Common Subsequence with Gap Constraints ⋮ On Arch Factorization and Subword Universality for Words and Compressed Words ⋮ Subsequences in bounded ranges: matching and analysis problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Enumerating longest increasing subsequences and patience sorting
- Generalized Pascal triangle for binomial coefficients of words
- Another generalization of abelian equivalence: binomial complexity of infinite words
- An algorithm for distinguishing efficiently bit-strings by their subsequences
- Absoluteness of subword inequality is undecidable
- On periodic properties of circular words
- On computing the length of longest increasing subsequences
- Which problems have strongly exponential complexity?
- Tribute: The influence of Imre Simon's work in the theory of automata, languages and semigroups
- Directed acyclic subsequence graph -- overview
- Subword histories and Parikh matrices
- The hardness of counting full words compatible with partial words
- Fast computation of a longest increasing subsequence and application
- Nearly \(k\)-universal words -- investigating a part of Simon's congruence
- Fast and longest rollercoasters
- Languages ordered by the subword order
- Connections between subwords and certain matrix mappings
- On the index of Simon's congruence for piecewise testability
- Unshuffling a square is NP-hard
- Searching subsequences
- A decomposition theorem for partially ordered sets
- Absent subsequences in words
- Alphabet-Dependent String Searching with Wexponential Search Trees
- Longest Gapped Repeats and Palindromes
- Linear work suffix array construction
- A fast algorithm for computing longest common subsequences
- The Complexity of Some Problems on Subsequences and Supersequences
- Software Descriptions with Flow Expressions
- An approach to software system modelling and analysis
- The Complexity of Downward Closure Comparisons
- Querying Regular Languages over Sliding Windows
- Scattered Factor-Universality of Words
- The Subtrace Order and Counting First-Order Logic
- Fine-Grained Complexity Theory (Tutorial)
- Consequences of Faster Alignment of Sequences
- Rollercoasters: Long Sequences without Short Runs
- The Height of Piecewise-Testable Languages with Applications in Logical Complexity
- Hardness of Easy Problems: Basing Hardness on Popular Conjectures such as the Strong Exponential Time Hypothesis (Invited Talk)
- Algorithms on Strings
- Computing the \(k\)-binomial complexity of the Thue-Morse word
- On the complexity of \(k\)-SAT
- Subsequences in bounded ranges: matching and analysis problems
This page was built for publication: Subsequences in bounded ranges: matching and analysis problems
