Approximate nearest neighbors and sequence comparison with block operations
From MaRDI portal
Publication:3192009
DOI10.1145/335305.335353zbMath1296.68082OpenAlexW2046042060MaRDI QIDQ3192009
No author found.
Publication date: 26 September 2014
Published in: Proceedings of the thirty-second annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/335305.335353
Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)
Related Items (13)
Sketching and Embedding are Equivalent for Norms ⋮ Approximating tree edit distance through string edit distance ⋮ An efficient algorithm for sequence comparison with block reversals ⋮ Unnamed Item ⋮ Edit distance with move operations ⋮ Edit distance with block deletions ⋮ An algorithm with linear expected running time for string editing with substitutions and substring reversals ⋮ Efficient algorithms for the block edit problems ⋮ Nonembeddability theorems via Fourier analysis ⋮ Polylogarithmic Approximation for Edit Distance and the Asymmetric Query Complexity ⋮ Distance measures for biological sequences: some recent approaches ⋮ The greedy algorithm for edit distance with moves ⋮ Forbidden Factors and Fragment Assembly
This page was built for publication: Approximate nearest neighbors and sequence comparison with block operations
