Data structures and algorithms for approximate string matching

From MaRDI portal
Publication:1104103

DOI10.1016/0885-064X(88)90008-8zbMath0646.68078OpenAlexW1981320868MaRDI QIDQ1104103

Raffaele Giancarlo, Zvi Galil

Publication date: 1988

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0885-064x(88)90008-8




Related Items (31)

Sublinear approximate string matching and biological applicationsFrom Nerode's congruence to suffix automata with mismatchesBoyer-Moore approach to approximate string matchingEdit distance for a run-length-encoded string and an uncompressed stringFast approximate matching of words against a dictionaryOn-line construction of suffix treesOn-Line Approximate String Searching Algorithms: Survey and Experimental ResultsMultiple filtration and approximate pattern matchingEFFICIENT PARALLEL ALGORITHMS FOR PATTERN RECOGNITION∗A dynamic edit distance tableAnalysis of two-dimensional approximate pattern matching algorithmsA linear-time algorithm for the 1-mismatch problemBlock edit models for approximate string matchingOn the Suffix Automaton with MismatchesString matching with weighted errorsExtending alignments with \(k\)-mismatches and \(\ell\)-gapsAn efficient algorithm for some tree matching problemsA note on the subtree isomorphism for ordered trees and related problemsFull-Text Indexes for High-Throughput SequencingAn improved algorithm for computing the edit distance of run-length coded stringsApproximate string-matching with \(q\)-grams and maximal matchesOn similarity of polynomial configurationsApproximate string matching with suffix automataFaster approximate string matching for short patternsExploiting word-level parallelism for fast convolutions and their applications in approximate string matchingSimple and efficient string matching with k mismatchesFast parallel and serial multidimensional approximate array matchingOptimal data compression algorithmUniversal Data Compression Algorithm Based on Approximate String MatchingEfficient algorithms for approximate string matching with swapsA model and a fast algorithm for multiple errors spelling correction



Cites Work


This page was built for publication: Data structures and algorithms for approximate string matching