The Harmonic Indel Distance
Fuente:
arXiv
Saved in:
| Main Author: | Pepin, Bob |
|---|---|
| Format: | Preprint |
| Published: |
2020
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Asymptotic analysis and efficient random sampling of directed ordered acyclic graphs
by: Pépin, Martin, et al.
Published: (2023)
by: Pépin, Martin, et al.
Published: (2023)
Elimination Distance to Dominated Clusters
by: Schirrmacher, Nicole, et al.
Published: (2025)
by: Schirrmacher, Nicole, et al.
Published: (2025)
A Euclidean Distance Matrix Model for Convex Clustering
by: Wang, Zhaowei, et al.
Published: (2021)
by: Wang, Zhaowei, et al.
Published: (2021)
The Power of Amortization on Minimizing Total Completion Time with Explorable Uncertainty
by: Krekelberg, Bob, et al.
Published: (2025)
by: Krekelberg, Bob, et al.
Published: (2025)
Distance-based (and path-based) covering problems for graphs of given cyclomatic number
by: Chakraborty, Dibyayan, et al.
Published: (2025)
by: Chakraborty, Dibyayan, et al.
Published: (2025)
A Distance Amplification Lemma for Monotonicity
by: Minzer, Dor
Published: (2025)
by: Minzer, Dor
Published: (2025)
Distance Recoloring
by: Banerjee, Niranka, et al.
Published: (2024)
by: Banerjee, Niranka, et al.
Published: (2024)
Graph Edit Distance Formulation for the Vehicle Routing Problem: Theory and Analysis
by: Dabah, Adel
Published: (2026)
by: Dabah, Adel
Published: (2026)
A Proof of Bala's General-$m$ Representation of the Harmonic Numbers
by: Niu, Tong
Published: (2026)
by: Niu, Tong
Published: (2026)
Tight Bounds for the Maximum Distance Over a Polytope to a Given Point
by: Costandin, Marius, et al.
Published: (2023)
by: Costandin, Marius, et al.
Published: (2023)
Distance-Preserving Graph Compression Techniques
by: Madani, Amirali, et al.
Published: (2023)
by: Madani, Amirali, et al.
Published: (2023)
Designing ReLU Generative Networks to Enumerate Trees with a Given Tree Edit Distance
by: Ghafoor, Mamoona, et al.
Published: (2025)
by: Ghafoor, Mamoona, et al.
Published: (2025)
On Average Distance, Level-1 Fourier Weight, and Chang's Lemma
by: Yu, Lei
Published: (2025)
by: Yu, Lei
Published: (2025)
Distinct Distances on Pfaffian Curves
by: Natarajan, Abhiram, et al.
Published: (2025)
by: Natarajan, Abhiram, et al.
Published: (2025)
On Structural and Spectral Properties of Distance Magic Graphs
by: Mukherjee, Himadri, et al.
Published: (2023)
by: Mukherjee, Himadri, et al.
Published: (2023)
When Distances Lie: Euclidean Embeddings in the Presence of Outliers and Distance Violations
by: Bentert, Matthias, et al.
Published: (2025)
by: Bentert, Matthias, et al.
Published: (2025)
The Complexity of Finding Tangles
by: Firman, Oksana, et al.
Published: (2020)
by: Firman, Oksana, et al.
Published: (2020)
Boxicity of Zero Divisor Graphs
by: Chandran, L. Sunil, et al.
Published: (2025)
by: Chandran, L. Sunil, et al.
Published: (2025)
Pairwise similarity method for majority domination problem
by: Shushko, N. I., et al.
Published: (2025)
by: Shushko, N. I., et al.
Published: (2025)
Stereotype graph: A mathematical framework of category stereotypes via graph theory
by: Yan, Yijia
Published: (2025)
by: Yan, Yijia
Published: (2025)
Notes for Miscellaneous Lectures
by: Levin, Leonid A.
Published: (2005)
by: Levin, Leonid A.
Published: (2005)
Efficient Algorithms for Minimizing the Kirchhoff Index via Adding Edges
by: Zhou, Xiaotian, et al.
Published: (2025)
by: Zhou, Xiaotian, et al.
Published: (2025)
On the rigidity of Arnoux-Rauzy words
by: Berthé, Valérie, et al.
Published: (2022)
by: Berthé, Valérie, et al.
Published: (2022)
Temporal Orienteering with Changing Fuel Costs
by: Corsini, Timothée, et al.
Published: (2025)
by: Corsini, Timothée, et al.
Published: (2025)
Spectral Moment of Order Four and the Uniqueness of the CCZ class of Dublin APN Permutation
by: Gillot, Valérie, et al.
Published: (2025)
by: Gillot, Valérie, et al.
Published: (2025)
CAZAC sequence generation of any length with iterative projection onto unit circle: principle and first results
by: Amis, Karine, et al.
Published: (2025)
by: Amis, Karine, et al.
Published: (2025)
Optimal Average Disk-Inspection via Fermat's Principle
by: Georgiou, Konstantinos
Published: (2025)
by: Georgiou, Konstantinos
Published: (2025)
Why Districting Becomes NP-hard
by: Jost, Niklas, et al.
Published: (2025)
by: Jost, Niklas, et al.
Published: (2025)
Word-representability and comparability: Minimal forbidden induced subgraphs and cover number bounds
by: Kenkireth, Benny George, et al.
Published: (2025)
by: Kenkireth, Benny George, et al.
Published: (2025)
Near-optimal edge partitioning via intersecting families
by: Yakunin, Alexander, et al.
Published: (2025)
by: Yakunin, Alexander, et al.
Published: (2025)
RDNF Oriented Analytics to Random Boolean Functions
by: Aslanyan, Levon, et al.
Published: (2024)
by: Aslanyan, Levon, et al.
Published: (2024)
Finding a Sparse Connected Spanning Subgraph in a non-Uniform Failure Model
by: Bentert, Matthias, et al.
Published: (2023)
by: Bentert, Matthias, et al.
Published: (2023)
From Tripods to Bipods: Reducing the Queue Number of Planar Graphs Costs Just One Leg
by: Förster, Henry
Published: (2024)
by: Förster, Henry
Published: (2024)
Topological Analysis and Synthesis of Structures related to Certain Classes of K-Geodetic Computer Networks
by: Frasser, Carlos E.
Published: (2017)
by: Frasser, Carlos E.
Published: (2017)
Multi-Agent Search-Type Problems on Polygons
by: Georgiou, Konstantinos, et al.
Published: (2024)
by: Georgiou, Konstantinos, et al.
Published: (2024)
A Novel Approach for Bent Functions with Dillon-like Exponents and Characterizing Three Classes of Bent Functions via Kloosterman Sums
by: Tu, Ziran, et al.
Published: (2024)
by: Tu, Ziran, et al.
Published: (2024)
Single machine rescheduling for new orders: properties and complexity results
by: Rener, Elena, et al.
Published: (2023)
by: Rener, Elena, et al.
Published: (2023)
The LLLR generalised Langton's ant
by: Lutfalla, Victor
Published: (2025)
by: Lutfalla, Victor
Published: (2025)
Stronger Hardness for Maximum Robust Flow and Randomized Network Interdiction
by: Matuschke, Jannik
Published: (2025)
by: Matuschke, Jannik
Published: (2025)
Morse frames
by: Bertrand, Gilles, et al.
Published: (2024)
by: Bertrand, Gilles, et al.
Published: (2024)
Similar Items
-
Asymptotic analysis and efficient random sampling of directed ordered acyclic graphs
by: Pépin, Martin, et al.
Published: (2023) -
Elimination Distance to Dominated Clusters
by: Schirrmacher, Nicole, et al.
Published: (2025) -
A Euclidean Distance Matrix Model for Convex Clustering
by: Wang, Zhaowei, et al.
Published: (2021) -
The Power of Amortization on Minimizing Total Completion Time with Explorable Uncertainty
by: Krekelberg, Bob, et al.
Published: (2025) -
Distance-based (and path-based) covering problems for graphs of given cyclomatic number
by: Chakraborty, Dibyayan, et al.
Published: (2025)