Approximate nearest neighbor under edit distance via product metrics

zbMATH Open1318.68070MaRDI QIDQ5501320FDOQ5501320

Authors: Piotr Indyk 

Publication date: 3 August 2015

Recommendations

• Approximating edit distance in near-linear time
• Approximating edit distance in near-linear time
• scientific article; zbMATH DE number 2119725
• The string edit distance matching problem with moves
• Automata, Languages and Programming

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10) Algorithms on strings (68W32)

Cited In (6)

• Bounded occurrence edit distance: a new metric for string similarity joins with edit distance constraints
• Nonembeddability theorems via Fourier analysis
• Automata, Languages and Programming
• Vector representations for efficient comparison and search for similar strings
• Index structures for fast similarity search for symbol strings
• A kd-tree-accelerated hybrid data-driven/model-based approach for poroelasticity problems with multi-fidelity multi-physics data

This page was built for publication: Approximate nearest neighbor under edit distance via product metrics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501320)