Copertina

Polynomial-Time Solutions for Longest Common Subsequence Related Problems Between a Sequence and a Pangenome Graph

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Li, Xingfu, Wang, Yongping
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Data Structures and Algorithms Computational Complexity 05C85, 68Q17, 68R10, 92D20, 92-08
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Complexity of Sequence-to-Graph Alignment with Co-Linear Chaining
di: Li, Xingfu
Pubblicazione: (2026)

Algorithms for Minimum Membership Dominating Set Problem
di: Reddy, Sangam Balchandar, et al.
Pubblicazione: (2024)

Pairwise Rearrangement is Fixed-Parameter Tractable in the Single Cut-and-Join Model
di: Bailey, Lora, et al.
Pubblicazione: (2024)

Complexity and Enumeration in Models of Genome Rearrangement
di: Bailey, Lora, et al.
Pubblicazione: (2023)

A Study of NP-Completeness and Undecidable Word Problems in Semigroups
di: Abdullah, Duaa, et al.
Pubblicazione: (2025)

Coordinatewise Balanced Covering for Linear Gain Graphs, with an Application to Coset-List Min-2-Lin over Powers of Two
di: Alpay, Faruk, et al.
Pubblicazione: (2026)

Hamiltonicity Parameterized by Mim-Width is (Indeed) Para-NP-Hard
di: Bergougnoux, Benjamin, et al.
Pubblicazione: (2025)

RotorMap and Quantum Fingerprints of DNA Sequences via Rotary Position Embeddings
di: Yakymenko, Danylo, et al.
Pubblicazione: (2026)

Ineffectiveness for Search and Undecidability of PCSP Meta-Problems
di: Larrauri, Alberto
Pubblicazione: (2025)

A Polynomial-time Algorithm to Solve the Airplane Refueling Problem: the Sequential Search Algorithm
di: Cui, Jinchuan, et al.
Pubblicazione: (2022)

A Space-Efficient Algorithm for Longest Common Almost Increasing Subsequence of Two Sequences
di: Rahat, Md Tanzeem, et al.
Pubblicazione: (2025)

Odd Cycle Transversal on $P_5$-free Graphs in Polynomial Time
di: Agrawal, Akanksha, et al.
Pubblicazione: (2024)

Resident fitness computation in linear time and other algorithmic aspects of interacting trajectories
di: Friedl, Katalin, et al.
Pubblicazione: (2025)

Unifying Weak Independence and Signal Hierarchy Theory: Extended Biological Petri Net Formalism with Application to Vibrio fischeri Quorum Sensing
di: Simao, Eugenio
Pubblicazione: (2025)

Parallel Algorithms for Group Isomorphism via Code Equivalence
di: Levet, Michael
Pubblicazione: (2026)

Differentially private federated learning for localized control of infectious disease dynamics
di: Kerkouche, Raouf, et al.
Pubblicazione: (2025)

The Minimum Eternal Vertex Cover Problem on a Subclass of Series-Parallel Graphs
di: Calamoneri, Tiziana, et al.
Pubblicazione: (2025)

Polynomial Identity Testing via Evaluation of Rational Functions
di: Hu, Ivan, et al.
Pubblicazione: (2022)

Directed Temporal Tree Realization for Periodic Public Transport: Easy and Hard Cases
di: Meusel, Julia, et al.
Pubblicazione: (2025)

On the Complexity of Distance-$d$ Independent Set Reconfiguration
di: Hoang, Duc A.
Pubblicazione: (2022)

Genomic Language Models: Opportunities and Challenges
di: Benegas, Gonzalo, et al.
Pubblicazione: (2024)

Polynomial-size encoding of all cuts of small value in integer-valued symmetric submodular functions
di: Oum, Sang-il, et al.
Pubblicazione: (2026)

Red-Blue Pebbling with Multiple Processors: Time, Communication and Memory Trade-offs
di: Böhnlein, Toni, et al.
Pubblicazione: (2024)

Empirically Exploring the Space of Monostationarity in Dual Phosphorylation
di: Cai, May, et al.
Pubblicazione: (2024)

Computational Complexity of Finding Subgroups of a Given Order
di: Lakshmanan, K.
Pubblicazione: (2025)

How Hard is it to be a Star? Convex Geometry and the Real Hierarchy
di: Schaefer, Marcus, et al.
Pubblicazione: (2025)

A Randomized Algorithm for Preconditioner Selection
di: DiPaolo, Conner, et al.
Pubblicazione: (2019)

On weighted graph separation problems and flow-augmentation
di: Kim, Eun Jung, et al.
Pubblicazione: (2022)

SMB algebras II: On the Constraint Satisfaction Problem over Semilattices of Mal'cev Blocks
di: Marković, Petar, et al.
Pubblicazione: (2026)

Cluster Vertex Deletion Problems on Cubic Graphs
di: Rusu, Irena
Pubblicazione: (2025)

Traction force microscopy for linear and nonlinear elastic materials as a parameter identification inverse problem
di: Sarnighausen, Gesa, et al.
Pubblicazione: (2024)

The Upper Clique Transversal Problem
di: Milanič, Martin, et al.
Pubblicazione: (2023)

Fully Dynamic Breadth First Search and Spanning Trees in Directed Graphs
di: Morse, Gregory, et al.
Pubblicazione: (2026)

Improved Computational Lower Bound of Estimation for Multi-Frequency Group Synchronization
di: Li, Zhangsong
Pubblicazione: (2026)

m-Eternal Domination and Variants on Some Classes of Finite and Infinite Graphs
di: Calamoneri, Tiziana, et al.
Pubblicazione: (2025)

A Polynomial-Time Deterministic Algorithm for an NP-Complete Problem
di: Jiang, Xinwen, et al.
Pubblicazione: (2021)

Computational Lower Bounds for Correlated Random Graphs via Algorithmic Contiguity
di: Li, Zhangsong
Pubblicazione: (2025)

Recognizing Level-k-Based Phylogenetic Networks is NP-Complete
di: Suzuki, Takatora
Pubblicazione: (2026)

Dual-Model Framework for CHIKV Transmission Modeling: ODE and Petri Net Analysis of the 2025 Foshan Outbreak
di: Liu, Hong, et al.
Pubblicazione: (2025)

Visualizing Geophylogenies -- Internal and External Labeling with Phylogenetic Tree Constraints
di: Klawitter, Jonathan, et al.
Pubblicazione: (2023)