Imagen de Portada

Complexity of Sequence-to-Graph Alignment with Co-Linear Chaining

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Li, Xingfu
Formato:	Preprint
Publicado:	2026
Materias:	Computational Complexity 05C85, 68Q17, 68R10, 92D20, 92-08
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Polynomial-Time Solutions for Longest Common Subsequence Related Problems Between a Sequence and a Pangenome Graph
por: Li, Xingfu, et al.
Publicado: (2026)

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

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

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

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

DAG Scheduling in the BSP Model
por: Papp, Pál András, et al.
Publicado: (2023)

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

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

A Linear Kernel for Independent Set Reconfiguration in Planar Graphs
por: Bousquet, Nicolas, et al.
Publicado: (2025)

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

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

Algorithmic Pot Generation: Algorithms for the Flexible-Tile Model of DNA Self-Assembly
por: Ashworth, Jacob, et al.
Publicado: (2024)

Tight complexity bounds for diagram commutativity verification
por: Malko, Artem, et al.
Publicado: (2025)

Ultrafast topological data analysis reveals pandemic-scale dynamics of convergent evolution
por: Bleher, Michael, et al.
Publicado: (2021)

Complexity of chess domination problems
por: Langlois-Rémillard, Alexis, et al.
Publicado: (2022)

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

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

A Note on Graph Burning of Path Forests
por: Tan, Ta Sheng, et al.
Publicado: (2023)

Autocatalytic Cores in Reaction Networks with Explicit Catalysis
por: Golnik, Richard, et al.
Publicado: (2026)

Computation of Minimum Numbers of Tile and Bond-Edge Types for DNA Self-Assembly of Select Archimedean Graphs
por: Merrithew, Tabitha, et al.
Publicado: (2025)

A polynomial-time algorithm for deciding the Hilbert Nullstellensatz over $\mathbb{Z}_2$. A proof of $\mathbf{P}=\mathbf{NP}$ hypothesis
por: Petrov, Petar P.
Publicado: (2022)

Mathematical and numerical methods for understanding immune cell motion during wound healing
por: Lupi, Giulia, et al.
Publicado: (2025)

Refutation of Spectral Graph Theory Conjectures with Search Algorithms)
por: Roucairol, Milo, et al.
Publicado: (2024)

Perfect Edge Domination in $P_6$-free Graphs and in Graphs Without Efficient Edge Dominating Sets
por: Grippo, Luciano N., et al.
Publicado: (2025)

Chemical Systems as Ternary $Γ$-Semirings:Theory, Case Studies, and Operational Tests
por: Gokavarapu, Chandrasekhar, et al.
Publicado: (2025)

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

On the Complexity of Bipartite Degree Realizability
por: Miklós, István
Publicado: (2025)

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

Browsing Large Graphs with Tile Pyramids and Sleeve Routing in the Browser
por: Nachmanson, Lev, et al.
Publicado: (2026)

Vector encoding of phylogenetic trees by ordered leaf attachment
por: Richman, Harry, et al.
Publicado: (2025)

The Complexity of Resilience for Digraph Queries
por: Bodirsky, Manuel, et al.
Publicado: (2026)

Generalisations of Matrix Partitions : Complexity and Obstructions
por: Barsukov, Alexey, et al.
Publicado: (2021)

On the Complexity of the Minimum-($k,ρ$)-Shortcut Problem
por: Avila, Tatiana Rocha, et al.
Publicado: (2026)

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

Decorrelation, Diversity, and Emergent Intelligence: The Isomorphism Between Social Insect Colonies and Ensemble Machine Learning
por: Fokoué, Ernest, et al.
Publicado: (2026)

Perfecting the Line Graph
por: Bal, Hartosh Singh
Publicado: (2025)

Cluster Vertex Deletion Problems on Cubic Graphs
por: Rusu, Irena
Publicado: (2025)

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

A Fast and Adaptive Algorithm to Compute the X-ray Transform
por: Chen, Chong, et al.
Publicado: (2020)

Scalable approximation and solvers for ionic electrodiffusion in cellular geometries
por: Benedusi, Pietro, et al.
Publicado: (2024)