Fast parallel and serial approximate string matching
From MaRDI portal
Publication:4203810
DOI10.1016/0196-6774(89)90010-2zbMath0685.68033OpenAlexW2052899946MaRDI QIDQ4203810
Publication date: 1989
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-6774(89)90010-2
Related Items (65)
Approximate string matching using compressed suffix arrays ⋮ Sublinear approximate string matching and biological applications ⋮ Swap and mismatch edit distance ⋮ New and faster filters for multiple approximate string matching ⋮ Longest common extensions in trees ⋮ Time-Space Trade-Offs for Longest Common Extensions ⋮ Boyer-Moore approach to approximate string matching ⋮ Fast approximate matching of words against a dictionary ⋮ On-Line Approximate String Searching Algorithms: Survey and Experimental Results ⋮ Algorithms for approximate graph matching ⋮ Computing longest common extensions in partial words ⋮ Multiple filtration and approximate pattern matching ⋮ Optimal spaced seeds for faster approximate string matching ⋮ A constrained edit distance between unordered labeled trees ⋮ A dynamic edit distance table ⋮ The approximate swap and mismatch edit distance ⋮ Locating maximal approximate runs in a string ⋮ Longest Common Extensions in Trees ⋮ Longest Common Extensions in Sublinear Space ⋮ On updating suffix tree labels ⋮ Longest common extension ⋮ A new filtration method and a hybrid strategy for approximate string matching ⋮ Pattern matching in hypertext ⋮ Multiple approximate string matching ⋮ Block edit models for approximate string matching ⋮ The longest common extension problem revisited and applications to approximate string searching ⋮ On the relationship between histogram indexing and block-mass indexing ⋮ Matching patterns with variables under edit distance ⋮ Generalizations of suffix arrays to multi-dimensional matrices. ⋮ Overlap matching. ⋮ Period recovery of strings over the Hamming and edit distances ⋮ 2-dimensional palindromes with \(k\) mismatches ⋮ Speeding up the detection of tandem repeats over the edit distance ⋮ Double string tandem repeats ⋮ Average-case linear-time similar substring searching by the \(q\)-gram distance ⋮ Unnamed Item ⋮ Time-space trade-offs for longest common extensions ⋮ Improved approximate string matching using compressed suffix data structures ⋮ EDIT-DISTANCE OF WEIGHTED AUTOMATA: GENERAL DEFINITIONS AND ALGORITHMS ⋮ Finding maximal 2-dimensional palindromes ⋮ An approximate string-matching algorithm ⋮ Approximate string-matching with \(q\)-grams and maximal matches ⋮ THEORETICAL ISSUES OF SEARCHING AERIAL PHOTOGRAPHS: A BIRD'S EYE VIEW ⋮ Approximate string matching with suffix automata ⋮ Approximate XML structure validation based on document-grammar tree similarity ⋮ A practical semi-external memory method for approximate pattern matching ⋮ Faster approximate string matching for short patterns ⋮ String indexing for patterns with wildcards ⋮ Efficient algorithms for the block edit problems ⋮ Some theoretical challenges in digital geometry: a perspective ⋮ Efficient CRCW-PRAM algorithms for universal substring searching ⋮ Identifying periodic occurrences of a template with applications to protein structure ⋮ A survey on tree edit distance and related problems ⋮ Simple and efficient string matching with k mismatches ⋮ Fast parallel and serial multidimensional approximate array matching ⋮ Two-dimensional maximal repetitions ⋮ Range LCP ⋮ FAST ALGORITHMS FOR COMPARISON OF SIMILAR UNORDERED TREES ⋮ ALGORITHMS FOR POINT SET MATCHING WITH k-DIFFERENCES ⋮ Generalizations of suffix arrays to multi-dimensional matrices. ⋮ Efficient algorithms for approximate string matching with swaps ⋮ Random Access to Grammar-Compressed Strings and Trees ⋮ Approximate swapped matching. ⋮ Approximate pattern matching in LZ77-compressed texts ⋮ Finding approximate palindromes in strings
This page was built for publication: Fast parallel and serial approximate string matching
