Cover Image

A Space-Efficient Algorithm for Longest Common Almost Increasing Subsequence of Two Sequences

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Rahat, Md Tanzeem, Hasan, Md. Manzurul, Mondal, Debajyoti
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms 68W01, 68R01 G.2.1
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Algorithms Transcending the SAT-Symmetry Interface
by: Anders, Markus, et al.
Published: (2023)

Computing and Enumerating Minimal Common Supersequences Between Two Strings
by: Sopp, Braeden, et al.
Published: (2026)

satsuma: Structure-based Symmetry Breaking in SAT
by: Anders, Markus, et al.
Published: (2024)

The Longest Common Bitonic Subsequence: A Match-Sensitive Dynamic Programming Approach
by: Rahat, Md. Tanzeem, et al.
Published: (2025)

Computing Maximal Repeating Subsequences in a String
by: Gong, Mingyang, et al.
Published: (2026)

Adjacency Labeling Schemes for Small Classes
by: Bonnet, Édouard, et al.
Published: (2024)

Optimal Discretization is Fixed-parameter Tractable
by: Kratsch, Stefan, et al.
Published: (2020)

New Theoretical Insights and Algorithmic Solutions for Reconstructing Score Sequences from Tournament Score Sets
by: Liu, Bowen
Published: (2025)

Tight bounds on adjacency labels for monotone graph classes
by: Bonnet, Édouard, et al.
Published: (2023)

Small But Unwieldy: A Lower Bound on Adjacency Labels for Small Classes
by: Bonnet, Édouard, et al.
Published: (2023)

Shortest Paths in a Weighted Simplicial Complex
by: Chakraborty, Sukrit, et al.
Published: (2025)

Notes on Randomized Algorithms
by: Aspnes, James
Published: (2020)

Independent Set Reconfiguration Under Bounded-Hop Token
by: Hatano, Hiroki, et al.
Published: (2024)

Incremental-Decremental Maximization
by: Disser, Yann, et al.
Published: (2025)

Improved Approximation Algorithms for the Expanding Search Problem
by: Griesbach, Svenja M., et al.
Published: (2023)

Euclidean Affine Functions and Applications to Calendar Algorithms
by: Neri, Cassio, et al.
Published: (2021)

Random-Order Online Independent Set of Intervals and Hyperrectangles
by: Garg, Mohit, et al.
Published: (2024)

Extending the Extension: Deterministic Algorithm for Non-monotone Submodular Maximization
by: Buchbinder, Niv, et al.
Published: (2024)

Efficient Processing of Subsequent Densest Subgraph Query
by: Hung, Chia-Yang, et al.
Published: (2024)

An Explicit and Efficient $O(n^2)$-Time Algorithm for Sorting Sumsets
by: Mundhra, S.
Published: (2025)

Towards a Unified Theory of Time-Varying Data
by: Bumpus, Benjamin Merlin, et al.
Published: (2024)

On the Approximation Ratio of the $k$-Opt and Lin-Kernighan Algorithm
by: Zhong, Xianghui
Published: (2019)

Constructions, bounds, and algorithms for peaceable queens
by: Clinch, Katie, et al.
Published: (2024)

Separating Geometric Data with Minimum Cost: Two Disjoint Convex Hulls
by: Bigham, Bahram Sadeghi
Published: (2021)

The Selective G-Bispectrum and its Inversion: Applications to G-Invariant Networks
by: Mataigne, Simon, et al.
Published: (2024)

Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-Means
by: Friggstad, Zachary, et al.
Published: (2018)

Boltzmann sampling and optimal exact-size sampling for directed acyclic graphs
by: Gabryelski, Wojciech, et al.
Published: (2026)

Balanced Group Convolution: An Improved Group Convolution Based on Approximability Estimates
by: Lee, Youngkyu, et al.
Published: (2023)

De Bruijn Sequences with Minimum Discrepancy
by: Álvarez, Nicolás, et al.
Published: (2024)

Euclidean k-center Fair Clusterings
by: Moritaka, Ayano, et al.
Published: (2025)

Optimal Bound for PCA with Outliers using Higher-Degree Voronoi Diagrams
by: Hashemian, Sajjad, et al.
Published: (2024)

Compact enumeration for scheduling one machine
by: Vakhania, Nodari
Published: (2021)

The Bottom-Left Algorithm for the Strip Packing Problem
by: Hougardy, Stefan, et al.
Published: (2024)

Deterministic Algorithm and Faster Algorithm for Submodular Maximization subject to a Matroid Constraint
by: Buchbinder, Niv, et al.
Published: (2024)

Optimal Online Bipartite Matching in Degree-2 Graphs
by: Bhangale, Amey, et al.
Published: (2025)

Strongly Sublinear Algorithms for Testing Pattern Freeness
by: Newman, Ilan, et al.
Published: (2021)

Fast sampling of satisfying assignments from random $k$-SAT with applications to connectivity
by: Chen, Zongchen, et al.
Published: (2022)

Building a Nest by an Automaton
by: Czyzowicz, Jurek, et al.
Published: (2019)

How to Compute a Moving Sum
by: Maslen, David K., et al.
Published: (2025)

An Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications
by: Agarwal, Pankaj K., et al.
Published: (2018)