scientific article
From MaRDI portal
Publication:3747742
zbMath0608.68058MaRDI QIDQ3747742
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Formal languages and automata (68Q45)
Related Items (31)
Boyer-Moore approach to approximate string matching ⋮ Multidimensional period recovery ⋮ Bit-parallel string matching under Hamming distance in \(O(n\lceil m/w\rceil)\) worst case time ⋮ Parallel string matching with k mismatches ⋮ Data structures and algorithms for approximate string matching ⋮ On pattern matching with \(k\) mismatches and few don't cares ⋮ Locating maximal approximate runs in a string ⋮ Fast and Simple Computations Using Prefix Tables Under Hamming and Edit Distance ⋮ Checking whether a word is Hamming-isometric in linear time ⋮ Maximal degenerate palindromes with gaps and mismatches ⋮ Pattern matching in the Hamming distance with thresholds ⋮ Period recovery of strings over the Hamming and edit distances ⋮ 2-dimensional palindromes with \(k\) mismatches ⋮ Extending alignments with \(k\)-mismatches and \(\ell\)-gaps ⋮ Double string tandem repeats ⋮ Pattern matching with address errors: rearrangement distances ⋮ Practical Performance of Space Efficient Data Structures for Longest Common Extensions. ⋮ On string matching with mismatches ⋮ A fast algorithm for string matching with mismatches ⋮ On the string matching with \(k\) mismatches ⋮ On approximate pattern matching with thresholds ⋮ A randomized numerical aligner (rNA) ⋮ String indexing for patterns with wildcards ⋮ Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching ⋮ Simple and efficient string matching with k mismatches ⋮ Fast parallel and serial multidimensional approximate array matching ⋮ Efficient computations of \(\ell _1\) and \(\ell _{\infty }\) rearrangement distances ⋮ Small-space LCE data structure with constant-time queries ⋮ Fast and practical approximate string matching ⋮ Efficient Identification of k-Closed Strings ⋮ Approximate periodicity
This page was built for publication:
