Imagen de Portada

String Consensus Problems with Swaps and Substitutions

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Gabory, Estéban, Bulteau, Laurent, Fici, Gabriele, Verbeek, Hilde
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms Computational Complexity
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Sequence graphs realizations and ambiguity in language models
por: Khalife, Sammy, et al.
Publicado: (2024)

Generalized De Bruijn Words, Invertible Necklaces, and the Burrows-Wheeler Transform
por: Fici, Gabriele, et al.
Publicado: (2025)

Improved Hardness-of-Approximation for Token Swapping
por: Hiken, Sam, et al.
Publicado: (2024)

Hardness Results on Characteristics for Elastic-Degenerated Strings
por: Köppl, Dominik, et al.
Publicado: (2024)

Self-referential instances of the dominating set problem are irreducible
por: Zhou, Guangyan
Publicado: (2026)

Tight Additive Sensitivity on LZ-style Compressors and String Attractors
por: Fujie, Yuto, et al.
Publicado: (2025)

Reconstructing Sets of Strings from Their k-way Projections: Algorithms & Complexity
por: Tate, Elise, et al.
Publicado: (2025)

Sorting by Strip Swaps is NP-Hard
por: Roy, Swapnoneel, et al.
Publicado: (2025)

Unclustered BWTs of any Length over Non-Binary Alphabets
por: Fici, Gabriele, et al.
Publicado: (2025)

Parameterized Restless Temporal Path
por: Cauvi, Justine, et al.
Publicado: (2025)

Scheduling Problems with Constrained Rejections
por: Davies, Sami, et al.
Publicado: (2025)

Equivalent Instances for Scheduling and Packing Problems
por: Jansen, Klaus, et al.
Publicado: (2025)

Pseudodeterministic Algorithms for Minimum Cut Problems
por: Agarwala, Aryan, et al.
Publicado: (2025)

Neighborhood-Aware Graph Labeling Problem
por: Shahverdikondori, Mohammad, et al.
Publicado: (2026)

Generalized Graph Packing Problems Parameterized by Treewidth
por: Esmer, Barış Can, et al.
Publicado: (2025)

On the (In)Approximability of the Monitoring Edge Geodetic Set Problem
por: Bilò, Davide, et al.
Publicado: (2025)

Complexity of Local Search for Euclidean Clustering Problems
por: Manthey, Bodo, et al.
Publicado: (2023)

NP-Hardness and a PTAS for the Pinwheel Problem
por: Kleinberg, Robert, et al.
Publicado: (2026)

On the Complexity of Fundamental Problems for DAG-Compressed Graphs
por: Chudigiewitsch, Florian, et al.
Publicado: (2026)

No Price Tags? No Problem: Query Strategies for Unpriced Information
por: Nadimpalli, Shivam, et al.
Publicado: (2025)

An Invitation to "Fine-grained Complexity of NP-Complete Problems"
por: Nederlof, Jesper
Publicado: (2026)

Structural Parameterizations for Two Bounded Degree Problems Revisited
por: Lampis, Michael, et al.
Publicado: (2023)

On the Approximability of Train Routing and the Min-Max Disjoint Paths Problem
por: Bhaskar, Umang, et al.
Publicado: (2025)

A Complexity Analysis of the c-Closed Vertex Deletion Problem
por: Lehner, Lisa, et al.
Publicado: (2025)

Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand Pattern
por: Focke, Jacob, et al.
Publicado: (2023)

The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand
por: Caragiannis, Ioannis, et al.
Publicado: (2026)

Fine-Grained Equivalence for Problems Related to Integer Linear Programming
por: Rohwedder, Lars, et al.
Publicado: (2024)

Space Complexity Dichotomies for Subgraph Finding Problems in the Streaming Model
por: Shih, Yu-Sheng, et al.
Publicado: (2026)

Fundamental Problems on Bounded-Treewidth Graphs: The Real Source of Hardness
por: Esmer, Barış Can, et al.
Publicado: (2024)

Timeline Problems in Temporal Graphs: Vertex Cover vs. Dominating Set
por: Herrmann, Anton, et al.
Publicado: (2025)

Finding Diverse Solutions in Combinatorial Problems with a Distributive Lattice Structure
por: de Berg, Mark, et al.
Publicado: (2025)

Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems
por: Kenig, Batya
Publicado: (2025)

Improved Hardness and Approximations for Cardinality-Based Minimum $s$-$t$ Cuts Problems in Hypergraphs
por: Adriaens, Florian, et al.
Publicado: (2024)

Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems
por: Ghosh, Mrinalkanti
Publicado: (2025)

On Inapproximability of Reconfiguration Problems: PSPACE-Hardness and some Tight NP-Hardness Results
por: Guruswami, Venkatesan, et al.
Publicado: (2023)

End Cover for Initial Value Problem: Complete Validated Algorithms with Complexity Analysis
por: Zhang, Bingwei, et al.
Publicado: (2026)

Non-Boolean OMv: One More Reason to Believe Lower Bounds for Dynamic Problems
por: Hu, Bingbing, et al.
Publicado: (2024)

Fantastic Flips and Where to Find Them: A General Framework for Parameterized Local Search on Partitioning Problems
por: Grüttemeier, Niels, et al.
Publicado: (2025)

Quantum Algorithm for Lexicographically Minimal String Rotation
por: Wang, Qisheng, et al.
Publicado: (2020)

Kernelization Complexity of Solution Discovery Problems
por: Grobler, Mario, et al.
Publicado: (2024)