Finding approximate patterns in strings
From MaRDI portal
Publication:3681960
DOI10.1016/0196-6774(85)90023-9zbMath0566.68072OpenAlexW2016219933WikidataQ56018896 ScholiaQ56018896MaRDI QIDQ3681960
Publication date: 1985
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-6774(85)90023-9
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Pattern recognition, speech recognition (68T10)
Related Items
Approximate pattern matching and transitive closure logics. ⋮ Sublinear approximate string matching and biological applications ⋮ A sublinear algorithm for approximate keyword searching ⋮ Matching regular expressions on uncertain data ⋮ New and faster filters for multiple approximate string matching ⋮ Boyer-Moore approach to approximate string matching ⋮ Fast approximate matching of words against a dictionary ⋮ Efficient matching of nonrectangular shapes. ⋮ On-Line Approximate String Searching Algorithms: Survey and Experimental Results ⋮ Algorithms for approximate graph matching ⋮ Data structures and algorithms for approximate string matching ⋮ Multiple filtration and approximate pattern matching ⋮ A subquadratic algorithm for approximate limited expression matching ⋮ Fast string matching with k differences ⋮ A constrained edit distance between unordered labeled trees ⋮ Approximate string matching with compressed indexes ⋮ A dynamic edit distance table ⋮ A new filtration method and a hybrid strategy for approximate string matching ⋮ Multiple approximate string matching ⋮ The longest common extension problem revisited and applications to approximate string searching ⋮ Fast Approximate Search in Large Dictionaries ⋮ On using q-gram locations in approximate string matching ⋮ A fully compressed algorithm for computing the edit distance of run-length encoded strings ⋮ String matching with weighted errors ⋮ Average-case linear-time similar substring searching by the \(q\)-gram distance ⋮ Route stability in vehicle routing decisions: a bi-objective approach using metaheuristics ⋮ Topology of strings: median string is NP-complete ⋮ Efficient generation of super condensed neighborhoods ⋮ Approximate string-matching with \(q\)-grams and maximal matches ⋮ A space-efficient alphabet-independent Four-Russians' lookup table and a multithreaded Four-Russians' edit distance algorithm ⋮ Approximate string matching with suffix automata ⋮ Finding similar consensus between trees: An algorithm and a distance hierarchy ⋮ A survey on tree edit distance and related problems ⋮ Unnamed Item ⋮ \(\text{MA}\mid\text{PM}\): memetic algorithms with population management ⋮ Finding approximate patterns in undirected acyclic graphs ⋮ Unnamed Item ⋮ FINDING ALL APPROXIMATE GAPPED PALINDROMES ⋮ Regularity of a dynamic neighborhood of a regular language ⋮ Improved approximate pattern matching on hypertext ⋮ Approximate string matching on Ziv--Lempel compressed text ⋮ A robust algorithm for identification of proteins in a database ⋮ Bit-parallel approximate string matching algorithms with transposition ⋮ Fast and practical approximate string matching ⋮ Edit distance of run-length encoded strings. ⋮ Finding approximate palindromes in strings ⋮ Application of max-plus algebra to biological sequence comparisons
