Cover Image

Incorporating indel channels into average-case analysis of seed-chain-extend

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Gibson, Spencer, Yu, Yun William
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms Quantitative Methods
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Variações do Problema de Distância de Rearranjos
by: Alexandrino, Alexsandro Oliveira
Published: (2024)

Genome-on-Diet: Taming Large-Scale Genomic Analyses via Sparsified Genomics
by: Alser, Mohammed, et al.
Published: (2022)

Identifying all snarls and superbubbles in linear-time, via a unified SPQR-tree framework
by: Sena, Francisco, et al.
Published: (2025)

LinearAlifold: Linear-Time Consensus Structure Prediction for RNA Alignments
by: Malik, Apoorv, et al.
Published: (2022)

LinearPartition: Linear-Time Approximation of RNA Folding Partition Function and Base Pairing Probabilities
by: Zhang, He, et al.
Published: (2019)

Practical colinear chaining on sequences revisited
by: Rizzo, Nicola, et al.
Published: (2025)

Embedding Probability Distributions into Low Dimensional $\ell_1$: Tree Ising Models via Truncated Metrics
by: Charikar, Moses, et al.
Published: (2023)

Local Computation Algorithms for Knapsack: impossibility results, and how to avoid them
by: Canonne, Clément L., et al.
Published: (2025)

Algorithmic strategies for finding the best TSP 2-OPT move in average sub-quadratic time
by: Lancia, Giuseppe, et al.
Published: (2024)

Recursive lattice reduction -- A framework for finding short lattice vectors
by: Aggarwal, Divesh, et al.
Published: (2023)

Efficient $\varepsilon$-approximate minimum-entropy couplings
by: Compton, Spencer
Published: (2025)

On the average-case complexity landscape for Tensor-Isomorphism-complete problems over finite fields
by: Li, Tiange, et al.
Published: (2026)

Parallel Small Vertex Connectivity in Near-Linear Work and Polylogarithmic Depth
by: Jiang, Yonggang, et al.
Published: (2025)

Mixing of general biased adjacent transposition chains
by: Gheissari, Reza, et al.
Published: (2025)

Error Correction for Message Streams
by: Gupta, Meghal, et al.
Published: (2023)

Dynamic O(arboricity) coloring in polylogarithmic worst-case time
by: Ghaffari, Mohsen, et al.
Published: (2024)

A Simple Average-case Analysis of Recursive Randomized Greedy MIS
by: Dalirrooyfard, Mina, et al.
Published: (2026)

Static Retrieval Revisited: To Optimality and Beyond
by: Hu, Yang, et al.
Published: (2025)

Cache Management for Mixture-of-Experts LLMs -- extended version
by: Angelopoulos, Spyros, et al.
Published: (2025)

An average case efficient algorithm for solving two-variable linear Diophantine equations
by: Deora, Mayank, et al.
Published: (2024)

Brief announcement: A special case of maximum flow over time with network changes
by: Chawla, Shuchi, et al.
Published: (2026)

A more versatile model for enumerative kernelization: a case study for Vertex Cover
by: Bougeret, Marin, et al.
Published: (2026)

Tight Analyses of Ordered and Unordered Linear Probing
by: Braverman, Mark, et al.
Published: (2025)

The trace reconstruction problem for spider graphs
by: Sun, Alec, et al.
Published: (2022)

Scheduling Jobs with Work-Inefficient Parallel Solutions
by: Kuszmaul, William, et al.
Published: (2024)

The Multiplicative Version of Azuma's Inequality, with an Application to Contention Analysis
by: Kuszmaul, William, et al.
Published: (2021)

Optimal Learning-Augmented Algorithm for Online Bidding
by: Lee, Changyeol, et al.
Published: (2026)

Fast Sampling Based Sketches for Tensors
by: Swartworth, William, et al.
Published: (2024)

Tight Sampling Bounds for Eigenvalue Approximation
by: Swartworth, William, et al.
Published: (2024)

Query-optimal estimation of unitary channels in diamond distance
by: Haah, Jeongwan, et al.
Published: (2023)

Job Scheduling under Base and Additional Fees, with Applications to Mixed-Criticality Scheduling
by: Hsieh, Yi-Ting, et al.
Published: (2025)

Fingerprint Filters Are Optimal
by: Kuszmaul, William, et al.
Published: (2025)

Succinct Dynamic Rank/Select: Bypassing the Tree-Structure Bottleneck
by: Kuszmaul, William, et al.
Published: (2025)

Probabilistic analysis of arithmetic coding showing its robustness
by: Mahmoud, Hosam M., et al.
Published: (2025)

Optimal Non-Oblivious Open Addressing
by: Bender, Michael A., et al.
Published: (2025)

Tight Bounds for Heavy-Hitters and Moment Estimation in the Sliding Window Model
by: Feng, Shiyuan, et al.
Published: (2025)

Perfect $L_p$ Sampling with Polylogarithmic Update Time
by: Swartworth, William, et al.
Published: (2025)

Learning-Augmented Online Algorithms for Nonclairvoyant Joint Replenishment Problem with Deadlines
by: Dinitz, Michael, et al.
Published: (2025)

Tight Bounds for Classical Open Addressing
by: Bender, Michael A., et al.
Published: (2024)

Improved Online Algorithms for Inventory Management Problems with Holding and Delay Costs: Riding the Wave Makes Things Simpler, Stronger, & More General
by: Shmoys, David, et al.
Published: (2026)