Large edit distance with multiple block operations.

DOI10.1007/B14038MaRDI QIDQ5897144zbMATH OpenOpenAlexFDO

Authors Dana Shapira, James A. Storer

Publication date 9 February 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b14038

Mathematics Subject Classification ID

Data structures (68P05) Information storage and retrieval of data (68P20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Recommendations

• Efficient algorithms for the block edit problems
• Edit distance with block deletions
• Approximate nearest neighbors and sequence comparison with block operations
• scientific article; zbMATH DE number 2087046
• Edit distance with move operations

Cited in

(8)

• Block edit models for approximate string matching
• Edit distance with block deletions
• Edit distance with move operations
• scientific article; zbMATH DE number 2087046 (Why is no real title available?)
• scientific article; zbMATH DE number 2087059 (Why is no real title available?)
• Edit distance with block operations
• 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: Large edit distance with multiple block operations.

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