Recognition of Noisy Subsequences Using Constrained Edit Distances

DOI10.1109/TPAMI.1987.4767962MaRDI QIDQ3811744zbMATH OpenOpenAlexWikidataFDO

Authors B. John Oommen

Publication date 1987

Published in IEEE Transactions on Pattern Analysis and Machine Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tpami.1987.4767962

zbMATH Keywords

constrained edit distanceLevenshtein metricstring correctionsubsequence correctionsubstring correction

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68R99) Pattern recognition, speech recognition (68T10)

Recommendations

• String editing under a combination of constraints
• scientific article; zbMATH DE number 1482232
• How hard is computing the edit distance?
• Constrained string editing
• Constrained many-to-one string editing with memory

Cited in

(11)

• String editing under a combination of constraints
• Constrained tree editing
• Constrained many-to-one string editing with memory
• Diversity metrics for direct-coded variable-length chromosome shortest path problem evolutionary algorithms
• A generalized correlation attack on a class of stream ciphers based on the Levenshtein distance
• Breadth-first search strategies for trie-based syntactic pattern recognition
• Fuzzy automata with -moves compute fuzzy measures between strings
• scientific article; zbMATH DE number 1482232 (Why is no real title available?)
• On message protection in cryptosystems modelled as the generalized wire-tap channel II
• A novel look-ahead optimization strategy for trie-based approximate string matching
• String matching with weighted errors

This page was built for publication: Recognition of Noisy Subsequences Using Constrained Edit Distances

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