Pages that link to "Item:Q3811744"
From MaRDI portal
The following pages link to Recognition of Noisy Subsequences Using Constrained Edit Distances (Q3811744):
Displayed 10 items.
- A novel look-ahead optimization strategy for trie-based approximate string matching (Q851727) (← links)
- String matching with weighted errors (Q909451) (← links)
- String editing under a combination of constraints (Q1310955) (← links)
- Constrained tree editing (Q1328503) (← links)
- Constrained many-to-one string editing with memory (Q1358830) (← links)
- Diversity metrics for direct-coded variable-length chromosome shortest path problem evolutionary algorithms (Q2019686) (← links)
- A generalized correlation attack on a class of stream ciphers based on the Levenshtein distance (Q2277233) (← links)
- Breadth-first search strategies for trie-based syntactic pattern recognition (Q2383946) (← links)
- Fuzzy automata with \(\varepsilon\)-moves compute fuzzy measures between strings (Q2493982) (← links)
- On message protection in cryptosystems modelled as the generalized wire-tap channel II (Q4637798) (← links)