scientific article; zbMATH DE number 3551946
From MaRDI portal
Publication:4125823
zbMath0354.68119MaRDI QIDQ4125823
Raymond E. Miller, Arnold L. Rosenberg, Richard M. Karp
Publication date: 1972
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Pattern recognition, speech recognition (68T10) General topics in the theory of software (68N01) Algorithms in computer science (68W99)
Related Items (45)
On the construction of classes of suffix trees for square matrices: Algorithms and applications ⋮ On two-dimensional pattern matching by optimal parallel algorithms ⋮ Pattern matching in a digitized image ⋮ Efficient special cases of pattern matching with swaps ⋮ Permuted scaled matching ⋮ Universal Reconstruction of a String ⋮ Indexing and querying color sets of images ⋮ Multidimensional period recovery ⋮ Finding all periods and initial palindromes of a string in parallel ⋮ Parallel construction of a suffix tree with applications ⋮ An efficient algorithm for sequence comparison with block reversals ⋮ Validating the Knuth-Morris-Pratt failure function, fast and online ⋮ Multiple sequence comparison -- a peptide matching approach ⋮ Various improvements to text fingerprinting ⋮ Faster Algorithm for the Set Variant of the String Barcoding Problem ⋮ Approximate String Matching with Address Bit Errors ⋮ Period recovery of strings over the Hamming and edit distances ⋮ Motif trie: an efficient text index for pattern discovery with don't cares ⋮ 2-dimensional palindromes with \(k\) mismatches ⋮ Unnamed Item ⋮ Parallel construction of minimal suffix and factor automata ⋮ Parallel tree pattern matching ⋮ Double string tandem repeats ⋮ Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays ⋮ Optimal parallel algorithms for Prefix Matching ⋮ Efficient one-dimensional real scaled matching ⋮ Linear time algorithm for the longest common repeat problem ⋮ Finding maximal 2-dimensional palindromes ⋮ Faster suffix sorting ⋮ Efficient constructions of test sets for regular and context-free languages ⋮ On finding common subtrees ⋮ Forty Years of Text Indexing ⋮ Optimal parallel suffix tree construction ⋮ LCS approximation via embedding into locally non-repetitive strings ⋮ Masking patterns in sequences: A new class of motif discovery with don't cares ⋮ Repetition Detection in a Dynamic String ⋮ Two-dimensional maximal repetitions ⋮ Universal reconstruction of a string ⋮ LCS Approximation via Embedding into Local Non-repetitive Strings ⋮ Comparison of strings belonging to the same family ⋮ Alphabet-independent optimal parallel search for three-dimensional patterns ⋮ Efficient text fingerprinting via Parikh mapping ⋮ Approximate string matching with address bit errors ⋮ Parallel construction and query of index data structures for pattern matching on square matrices ⋮ Algorithms for list structure condensation
This page was built for publication:
