Image de couverture de livre

Variações do Problema de Distância de Rearranjos

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Alexandrino, Alexsandro Oliveira
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms Quantitative Methods
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Incorporating indel channels into average-case analysis of seed-chain-extend
par: Gibson, Spencer, et autres
Publié: (2025)

Genome-on-Diet: Taming Large-Scale Genomic Analyses via Sparsified Genomics
par: Alser, Mohammed, et autres
Publié: (2022)

Identifying all snarls and superbubbles in linear-time, via a unified SPQR-tree framework
par: Sena, Francisco, et autres
Publié: (2025)

LinearAlifold: Linear-Time Consensus Structure Prediction for RNA Alignments
par: Malik, Apoorv, et autres
Publié: (2022)

LinearPartition: Linear-Time Approximation of RNA Folding Partition Function and Base Pairing Probabilities
par: Zhang, He, et autres
Publié: (2019)

Approximations for the Weighted Reversal, Transposition, and Indel Distance Problem with Intergenic Region Information
par: Siqueira, Gabriel, et autres
Publié: (2025)

Heuristics based on Adjacency Graph Packing for DCJ Distance Considering Intergenic Regions
par: Siqueira, Gabriel, et autres
Publié: (2025)

Optimal Extended Formulations from Optimal Dynamic Programming Algorithms
par: Oliveira, Mateus de Oliveira, et autres
Publié: (2026)

A more efficient algorithm to compute the Rand Index for change-point problems
par: Prates, Lucas de Oliveira
Publié: (2021)

Self-referential instances of the dominating set problem are irreducible
par: Zhou, Guangyan
Publié: (2026)

Comparative genomics with succinct colored de Bruijn graphs
par: Ramos, Lucas P., et autres
Publié: (2024)

When is String Reconstruction using de Bruijn Graphs Hard?
par: Bals, Ben, et autres
Publié: (2025)

ViQUF: de novo Viral Quasispecies reconstruction using Unitig-based Flow networks
par: Freire, Borja, et autres
Publié: (2021)

Edge-Minimum Walk of Modular Length in Polynomial Time
par: Amarilli, Antoine, et autres
Publié: (2024)

Concurrent Composition for Differentially Private Continual Mechanisms
par: Henzinger, Monika, et autres
Publié: (2024)

Weighted Reservoir Sampling With Replacement from Data Streams
par: Meligrana, Adriano, et autres
Publié: (2024)

A Comprehensive Survey of Data Reduction Rules for the Maximum Weighted Independent Set Problem
par: Großmann, Ernestine, et autres
Publié: (2024)

Single-Source Regular Path Querying in Terms of Linear Algebra
par: Belyanin, Georgiy, et autres
Publié: (2024)

Faster Weighted and Unweighted Tree Edit Distance and APSP Equivalence
par: Nogler, Jakob, et autres
Publié: (2024)

Compressed Game Solving
par: Considine, Jeffrey
Publié: (2024)

Fair Set Cover
par: Dehghankar, Mohsen, et autres
Publié: (2024)

Fair and Efficient Ridesharing: A Dynamic Programming-based Relocation Approach
par: Makhdomi, Aqsa Ashraf, et autres
Publié: (2024)

Correlation Clustering Beyond the Pivot Algorithm
par: Behnezhad, Soheil, et autres
Publié: (2024)

A Lock-free Binary Trie
par: Ko, Jeremy
Publié: (2024)

Grandchildren-weight-balanced binary search trees
par: Jugé, Vincent
Publié: (2024)

Suffixient Arrays: a New Efficient Suffix Array Compression Technique
par: Cenzato, Davide, et autres
Publié: (2024)

New Algorithm for Combinatorial $n$-folds and Applications
par: Jansen, Klaus, et autres
Publié: (2024)

Vizing's Theorem in Near-Linear Time
par: Assadi, Sepehr, et autres
Publié: (2024)

Maximum Flow by Augmenting Paths in $n^{2+o(1)}$ Time
par: Bernstein, Aaron, et autres
Publié: (2024)

Simpler Optimal Sorting from a Directed Acyclic Graph
par: van der Hoog, Ivor, et autres
Publié: (2024)

Deterministic Dynamic Edge Colouring
par: Christiansen, Aleksander B. G.
Publié: (2024)

Range Longest Increasing Subsequence and its Relatives
par: S., Karthik C., et autres
Publié: (2024)

Directed Token Sliding
par: Banerjee, Niranka, et autres
Publié: (2024)

Are We Still Missing an Item?
par: Magen, Roey
Publié: (2024)

Parallel Approximate Maximum Flows in Near-Linear Work and Polylogarithmic Depth
par: Agarwal, Arpit, et autres
Publié: (2024)

Almost Tight Bounds for Online Hypergraph Matching
par: Tröbst, Thorben, et autres
Publié: (2024)

Technical Report: Modeling Average False Positive Rates of Recycling Bloom Filters
par: Dozier, Kahlil, et autres
Publié: (2024)

Approximating Traveling Salesman Problems Using a Bridge Lemma
par: Böhm, Martin, et autres
Publié: (2024)

Sampling with a Black Box: Faster Parameterized Approximation Algorithms for Vertex Deletion Problems
par: Esmer, Barış Can, et autres
Publié: (2024)

A Note on Rounding Matchings in General Graphs
par: Dudeja, Aditi
Publié: (2024)