Pages that link to "Item:Q3799643"
From MaRDI portal
The following pages link to Efficient randomized pattern-matching algorithms (Q3799643):
Displaying 50 items.
- Efficient and secure outsourced approximate pattern matching protocol (Q1797787) (← links)
- Time-space-optimal string matching (Q1838329) (← links)
- Sending compressed messages to a learned receiver on a bidirectional line. (Q1853045) (← links)
- Sensitivity analysis and efficient method for identifying optimal spaced seeds (Q1878677) (← links)
- When can you fold a map? (Q1883580) (← links)
- Multiple filtration and approximate pattern matching (Q1902470) (← links)
- Super-pattern matching (Q1902473) (← links)
- \(p\)-suffix sorting as arithmetic coding (Q1932361) (← links)
- Permuted pattern matching algorithms on multi-track strings (Q2003324) (← links)
- Two-dimensional pattern matching against local and regular-like picture languages (Q2029490) (← links)
- The circulant hash revisited (Q2033521) (← links)
- Top tree compression of tries (Q2067669) (← links)
- Quantum algorithms for string processing (Q2091414) (← links)
- Approximate hashing for bioinformatics (Q2117679) (← links)
- Computing the maximum exponent in a stream (Q2118207) (← links)
- Streaming dictionary matching with mismatches (Q2118382) (← links)
- Efficient computation of sequence mappability (Q2134748) (← links)
- Efficient computation of shortest absent words in complete genomes (Q2195411) (← links)
- Dynamic and internal longest common substring (Q2211363) (← links)
- Fast algorithms for single and multiple pattern Cartesian tree matching (Q2215968) (← links)
- Block trees (Q2221797) (← links)
- Fast parallel and serial multidimensional approximate array matching (Q2277849) (← links)
- Succinct non-overlapping indexing (Q2285052) (← links)
- Index structures for fast similarity search for symbol strings (Q2287426) (← links)
- Dynamic determination of variable sizes of chunks in a deduplication system (Q2295627) (← links)
- Streaming \(k\)-mismatch with error correcting and applications (Q2304535) (← links)
- Tight tradeoffs for real-time approximation of longest palindromes in streams (Q2319637) (← links)
- Finger search in grammar-compressed strings (Q2322694) (← links)
- Sliding suffix tree (Q2331636) (← links)
- Fingerprints in compressed strings (Q2396828) (← links)
- Weighted approximate parameterized string matching (Q2409763) (← links)
- Space-time trade-offs for finding shortest unique substrings and maximal unique matches (Q2410365) (← links)
- Longest common substring with approximately \(k\) mismatches (Q2414870) (← links)
- Time-space trade-offs for longest common extensions (Q2442815) (← links)
- A lower-variance randomized algorithm for approximate string matching (Q2444913) (← links)
- Constrained tree inclusion (Q2569419) (← links)
- Document listing on repetitive collections with guaranteed performance (Q2632016) (← links)
- Can Burrows-Wheeler transform be replaced in chain code compression? (Q2663576) (← links)
- A Very Fast String Matching Algorithm Based on Condensed Alphabets (Q2830059) (← links)
- Time-Space Trade-Offs for Longest Common Extensions (Q2904502) (← links)
- Longest Common Extensions in Sublinear Space (Q2942246) (← links)
- Succinct Non-overlapping Indexing (Q2942256) (← links)
- Dictionary Matching with Uneven Gaps (Q2942261) (← links)
- More Than 1700 Years of Word Equations (Q2947143) (← links)
- Real-Time Streaming String-Matching (Q3011851) (← links)
- Simple Real-Time Constant-Space String Matching (Q3011852) (← links)
- Deterministic Sampling–A New Technique for Fast Pattern Matching (Q3204065) (← links)
- Solutions to twisted word equations and equations in virtually free groups (Q3299596) (← links)
- String-Matching and Alignment Algorithms for Finding Motifs in NGS Data (Q3305534) (← links)
- Kings, Name Days, Lazy Servants and Magic (Q3305728) (← links)
