On strings having the same length-k substrings
From MaRDI portal
On strings having the same length-\(k\) substrings
Cites work
- A Faster Strongly Polynomial Minimum Cost Flow Algorithm
- A note on \(K\) best network flows
- A polynomial time primal network simplex algorithm for minimum cost flows
- ACHIEVING k-ANONYMITY PRIVACY PROTECTION USING GENERALIZATION AND SUPPRESSION
- Algorithms on Strings
- An algorithm for distinguishing efficiently bit-strings by their subsequences
- An Eulerian path approach to DNA fragment assembly
- Beyond the BEST theorem: fast assessment of Eulerian trails
- Connecting de Bruijn graphs
- Directed acyclic subsequence graph -- overview
- Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm
- Efficiently testing Simon's congruence
- Finding all minimum cost flows and a faster algorithm for the \(K\) best flow problem
- scientific article; zbMATH DE number 3478914 (Why is no real title available?)
- scientific article; zbMATH DE number 3495598 (Why is no real title available?)
- scientific article; zbMATH DE number 3523580 (Why is no real title available?)
- scientific article; zbMATH DE number 1024080 (Why is no real title available?)
- scientific article; zbMATH DE number 1962790 (Why is no real title available?)
- scientific article; zbMATH DE number 7056230 (Why is no real title available?)
- scientific article; zbMATH DE number 7695995 (Why is no real title available?)
- k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
- Linking indexing data structures to de Bruijn graphs: construction and update
- Longest common prefix arrays for succinct \(k\)-spectra
- Making de Bruijn graphs Eulerian
- Matching patterns with variables under Simon's congruence
- Matching, Euler tours and the Chinese postman
- Missing value replacement in strings and applications
- On cardinalities of \(k\)-abelian equivalence classes
- On Eulerian circuits and words with prescribed adjacency patterns
- On strings having the same length-\(k\) substrings
- On the K best integer network flows
- On the index of Simon's congruence for piecewise testability
- On the possibility, to travel around a graph without repetition and without cutting
- On the Simon's congruence neighborhood of languages
- Reverse-safe data structures for text indexing
- Reverse-safe text indexing
- Scattered Factor-Universality of Words
- Simon's congruence pattern matching
- Simon's congruence pattern matching
- Space-efficient substring occurrence estimation
- Testing Simon's congruence
- The height of piecewise-testable languages with applications in logical complexity
This page was built for publication: On strings having the same length-\(k\) substrings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7233470)
