Recognition of Noisy Subsequences Using Constrained Edit Distances

DOI10.1109/TPAMI.1987.4767962zbMath0661.68088OpenAlexW2018366250WikidataQ60328350 ScholiaQ60328350MaRDI QIDQ3811744

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

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

Related Items (10)

Constrained tree editing ⋮ Breadth-first search strategies for trie-based syntactic pattern recognition ⋮ A novel look-ahead optimization strategy for trie-based approximate string matching ⋮ Constrained many-to-one string editing with memory ⋮ String matching with weighted errors ⋮ On message protection in cryptosystems modelled as the generalized wire-tap channel II ⋮ Fuzzy automata with \(\varepsilon\)-moves compute fuzzy measures between strings ⋮ 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 ⋮ String editing under a combination of constraints

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