The Noisy Substring Matching Problem

DOI10.1109/TSE.1983.237018zbMath0509.68102WikidataQ60328416 ScholiaQ60328416MaRDI QIDQ4747554

B. John Oommen, Rangasami L. Kashyap

Publication date: 1983

Published in: IEEE Transactions on Software Engineering (Search for Journal in Brave)

zbMATH Keywords

text editingLevenshtein metricerror correction in stringsstring set estimation

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Artificial intelligence (68T99)

Related Items

Constrained string editing ⋮ Algorithms for approximate graph matching ⋮ Diversity metrics for direct-coded variable-length chromosome shortest path problem evolutionary algorithms