scientific article; zbMATH DE number 3551946
From MaRDI portal
Publication:4125823
Cited in
(47)- Approximate string matching with address bit errors
- Parallel construction of a suffix tree with applications
- Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays
- On finding common subtrees
- Alphabet-independent optimal parallel search for three-dimensional patterns
- Parallel construction and query of index data structures for pattern matching on square matrices
- On two-dimensional pattern matching by optimal parallel algorithms
- Pattern matching in a digitized image
- Multiple sequence comparison -- a peptide matching approach
- Validating the Knuth-Morris-Pratt failure function, fast and online
- Period recovery of strings over the Hamming and edit distances
- Motif trie: an efficient text index for pattern discovery with don't cares
- Finding maximal 2-dimensional palindromes
- Comparison of strings belonging to the same family
- Efficient text fingerprinting via Parikh mapping
- Finding all periods and initial palindromes of a string in parallel
- Multidimensional period recovery
- 2-dimensional palindromes with k mismatches
- Two-dimensional maximal repetitions
- Universal reconstruction of a string
- Efficient one-dimensional real scaled matching
- Linear time algorithm for the longest common repeat problem
- Faster suffix sorting
- Double string tandem repeats
- Efficient special cases of pattern matching with swaps
- Permuted scaled matching
- Indexing and querying color sets of images
- Universal reconstruction of a string
- Faster Algorithm for the Set Variant of the String Barcoding Problem
- Approximate String Matching with Address Bit Errors
- LCS Approximation via Embedding into Local Non-repetitive Strings
- Various improvements to text fingerprinting
- Optimal parallel algorithms for Prefix Matching
- On the construction of classes of suffix trees for square matrices: algorithms and applications
- Algorithms for list structure condensation
- Forty Years of Text Indexing
- Two-dimensional maximal repetitions
- Repetition Detection in a Dynamic String
- Optimal parallel suffix tree construction
- An efficient algorithm for sequence comparison with block reversals
- Efficient constructions of test sets for regular and context-free languages
- Formally verified suffix array construction
- LCS approximation via embedding into locally non-repetitive strings
- Masking patterns in sequences: A new class of motif discovery with don't cares
- Better indexing for rectangular pattern matching
- Parallel construction of minimal suffix and factor automata
- Parallel tree pattern matching
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4125823)
