scientific article; zbMATH DE number 2185638
From MaRDI portal
Publication:3024804
Recommendations
- Tight bounds on maximal and maximum matchings
- scientific article; zbMATH DE number 2081000
- Bounds on maximum \(b\)-matchings
- Max-Min Problems of Searching for Two Disjoint Subsets
- Maximum gap labelings of graphs
- On maximum bipartite matching with separation
- scientific article; zbMATH DE number 866672
- Maximum induced matchings close to maximum matchings
- Finding maximum square-free 2-matchings in bipartite graphs
- Finding a Maximum Clique in an Arbitrary Graph
Cited in
(19)- Discovering subword associations in strings in time linear in the output size
- On maximal repeats in strings
- Improved upper bounds on all maximal -gapped repeats and palindromes
- Tighter bounds and optimal algorithms for all maximal -gapped repeats and palindromes. Finding all maximal -gapped repeats and palindromes in optimal worst case time on integer alphabets
- Linear time algorithms for finding and representing all the tandem repeats in a string
- Algorithms for extracting motifs from biological weighted sequences
- Double string tandem repeats
- Reporting consecutive substring occurrences under bounded gap constraints
- Longest -gapped repeat and palindrome
- Reporting consecutive substring occurrences under bounded gap constraints
- A faster algorithm for computing maximal -gapped repeats in a string
- scientific article; zbMATH DE number 2087049 (Why is no real title available?)
- Small-space LCE data structure with constant-time queries
- Discovery Science
- scientific article; zbMATH DE number 7651094 (Why is no real title available?)
- Maximal closed substrings
- Finding maximal closed substrings
- Counting maximal-exponent factors in words
- Computing maximal-exponent factors in an overlap-free word
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 Q3024804)
