Constrained string editing

DOI10.1016/0020-0255(86)90061-7zbMath0639.68053DBLPjournals/isci/Oommen86OpenAlexW2108701227WikidataQ60328371 ScholiaQ60328371MaRDI QIDQ1099954

B. John Oommen

Publication date: 1986

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(86)90061-7

zbMATH Keywords

optimal transformationedit operationsedit constraintstring editing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)

Related Items (7)

Constrained tree editing ⋮ Breadth-first search strategies for trie-based syntactic pattern recognition ⋮ Constrained many-to-one string editing with memory ⋮ On message protection in cryptosystems modelled as the generalized wire-tap channel II ⋮ Fuzzy automata with \(\varepsilon\)-moves compute fuzzy measures between strings ⋮ A generalized correlation attack on a class of stream ciphers based on the Levenshtein distance ⋮ String editing under a combination of constraints

Cites Work

• Unnamed Item
• A faster algorithm computing string edit distances
• A common basis for similarity measures involving two strings†
• Similarity measures for sets of strings^†
• A linear space algorithm for computing maximal common subsequences
• A Method for the Correction of Garbled Words Based on the Levenshtein Metric
• Bounds for the String Editing Problem
• Bounds on the Complexity of the Longest Common Subsequence Problem
• A fast algorithm for computing longest common subsequences
• The Complexity of Some Problems on Subsequences and Supersequences
• Algorithms for the Longest Common Subsequence Problem
• The String-to-String Correction Problem
• The Noisy Substring Matching Problem
• Matching Sequences under Deletion/Insertion Constraints

This page was built for publication: Constrained string editing