Copertina

Computable Bounds and Monte Carlo Estimates of the Expected Edit Distance

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Bilardi, Gianfranco, Schimd, Michele
Natura:	Preprint
Pubblicazione:	2022
Soggetti:	Formal Languages and Automata Theory Data Structures and Algorithms Probability 68R05 (Primary) 41A25, 68W32 (Secondary) G.3; F.2.2
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Computing Maximal Repeating Subsequences in a String
di: Gong, Mingyang, et al.
Pubblicazione: (2026)

Checking and producing word attractors
di: Béal, Marie-Pierre, et al.
Pubblicazione: (2025)

Dorst-Smeulders Coding for Arbitrary Binary Words
di: De Luca, Alessandro, et al.
Pubblicazione: (2025)

Templated Assembly Theory: An Extension of the Canonical Assembly Index with Block-Compressed Template
di: Masierak, Piotr
Pubblicazione: (2026)

Hairpin Completion Distance Lower Bound
di: Boneh, Itai, et al.
Pubblicazione: (2024)

Improved Randomized Approximation of Hard Universality and Emptiness Problems
di: Andreou, Pantelis, et al.
Pubblicazione: (2024)

Computing and Enumerating Minimal Common Supersequences Between Two Strings
di: Sopp, Braeden, et al.
Pubblicazione: (2026)

Stringological sequence prediction I: efficient algorithms for predicting highly repetitive sequences
di: Kosoy, Vanessa
Pubblicazione: (2026)

Grammar-Constrained (CFL) Reachability: Subcubic Preprocessing, Indexing Trade-offs, and Structured Decoding Semantics
di: Alpay, Faruk, et al.
Pubblicazione: (2026)

Handling LP-Rounding for Hierarchical Clustering and Fitting Distances by Ultrametrics
di: An, Hyung-Chan, et al.
Pubblicazione: (2025)

Searching in trees with monotonic query times
di: Dereniowski, Dariusz, et al.
Pubblicazione: (2024)

String 2-Covers with No Length Restrictions
di: Boneh, Itai, et al.
Pubblicazione: (2024)

Maximizing Diversity in (near-)Median String Selection
di: Chakraborty, Diptarka, et al.
Pubblicazione: (2026)

25 Additional Problems -- Extension to the Book "125 Problems in Text Algorithms"
di: Crochemore, Maxime, et al.
Pubblicazione: (2025)

On Identifying Critical Network Edges via Analyzing Changes in Shapes (Curvatures)
di: DasGupta, Bhaskar, et al.
Pubblicazione: (2026)

On the near-tightness of $χ\leq 2r$: a general $σ$-ary construction and a binary case via LFSRs
di: Date, Vinicius T. V., et al.
Pubblicazione: (2025)

Separating Coverage and Submodular: Maximization Subject to a Cardinality Constraint
di: Filmus, Yuval, et al.
Pubblicazione: (2024)

A 13/6-Approximation for Strip Packing via the Bottom-Left Algorithm
di: Hougardy, Stefan, et al.
Pubblicazione: (2025)

Extending Exact Integrality Gap Computations for the Metric TSP
di: Cook, William, et al.
Pubblicazione: (2026)

A Constant Factor Approximation for Directed Feedback Vertex Set in Graphs of Bounded Genus
di: Sun, Hao
Pubblicazione: (2023)

How to Compute a Moving Sum
di: Maslen, David K., et al.
Pubblicazione: (2025)

Fast sampling of satisfying assignments from random $k$-SAT with applications to connectivity
di: Chen, Zongchen, et al.
Pubblicazione: (2022)

Subsequence Matching and Analysis Problems for Formal Languages
di: Fazekas, Szilárd Zsolt, et al.
Pubblicazione: (2024)

Improved Approximation Algorithms for Path and Forest Augmentation via a Novel Relaxation
di: Hommelsheim, Felix
Pubblicazione: (2025)

A $4/3$ Approximation for $2$-Vertex-Connectivity
di: Bosch-Calvo, Miguel, et al.
Pubblicazione: (2023)

On the PLS-Completeness of $k$-Opt Local Search for the Traveling Salesman Problem
di: Heimann, Sophia, et al.
Pubblicazione: (2026)

Pliability and Approximating Max-CSPs
di: Romero, Miguel, et al.
Pubblicazione: (2019)

Improved Approximation Algorithms for the Expanding Search Problem
di: Griesbach, Svenja M., et al.
Pubblicazione: (2023)

A $5/4$-Approximation for Two-Edge Connectivity
di: Bosch-Calvo, Miguel, et al.
Pubblicazione: (2024)

A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem
di: Heimann, Sophia, et al.
Pubblicazione: (2025)

Strongly Sublinear Algorithms for Testing Pattern Freeness
di: Newman, Ilan, et al.
Pubblicazione: (2021)

On the Approximation Ratio of the $k$-Opt and Lin-Kernighan Algorithm
di: Zhong, Xianghui
Pubblicazione: (2019)

The $k$-Opt algorithm for the Traveling Salesman Problem has exponential running time for $k \ge 5$
di: Heimann, Sophia, et al.
Pubblicazione: (2024)

The Bottom-Left Algorithm for the Strip Packing Problem
di: Hougardy, Stefan, et al.
Pubblicazione: (2024)

Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-Means
di: Friggstad, Zachary, et al.
Pubblicazione: (2018)

On the Average-Case Performance of Greedy for Maximum Coverage
di: Balkanski, Eric, et al.
Pubblicazione: (2026)

Exact Set Packing in Multimodal Transportation with Ridesharing System for First/Last Mile
di: Gu, Qian-Ping, et al.
Pubblicazione: (2025)

On (In)approximability of MaxMin Independent Set Reconfiguration
di: Hoang, Hung P., et al.
Pubblicazione: (2026)

From Historical Puzzles to Grammatical Constraints: Circular Partitions, Generalized Run-Length Encodings, and Polynomial-Time Decidability
di: Khormali, Omid, et al.
Pubblicazione: (2026)

A Constant-factor Approximation for Weighted Bond Cover
di: Kim, Eun Jung, et al.
Pubblicazione: (2021)