Approximate nearest neighbors and sequence comparison with block operations
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2087059
- Approximate nearest neighbor queries revisited
- An efficient algorithm for sequence comparison with block reversals
- Approximate nearest neighbor search in high dimensions
- scientific article; zbMATH DE number 437552
- New directions in approximate nearest-neighbor searching
- scientific article; zbMATH DE number 1003290
- A randomized approximate nearest neighbors algorithm
- scientific article; zbMATH DE number 6783438
- Fast Algorithms for Local Similarity Queries in Two Sequences
Cited in
(17)- The greedy algorithm for edit distance with moves
- DRESS: dimensionality reduction for efficient sequence search
- Edit distance with block deletions
- Fast algorithm for sequential machine to compute pattern spectrum via city-block distance transform
- Distance measures for biological sequences: some recent approaches
- Approximating tree edit distance through string edit distance
- Edit distance with move operations
- Nonembeddability theorems via Fourier analysis
- Forbidden Factors and Fragment Assembly
- Sketching and embedding are equivalent for norms
- scientific article; zbMATH DE number 2087059 (Why is no real title available?)
- Polylogarithmic approximation for edit distance and the asymmetric query complexity
- Edit distance with block operations
- Large edit distance with multiple block operations.
- An efficient algorithm for sequence comparison with block reversals
- An algorithm with linear expected running time for string editing with substitutions and substring reversals
- Efficient algorithms for the block edit problems
This page was built for publication: Approximate nearest neighbors and sequence comparison with block operations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3192009)
