Sublinear Algorithms for Parameterized Matching
From MaRDI portal
Recommendations
- Sublinear-Time Parallel Algorithms for Matching and Related Problems
- scientific article; zbMATH DE number 1003296
- A sublinear parallel algorithm for stable matching
- Algorithms – ESA 2004
- Approximate parameterized matching
- Parameterized algorithms for inclusion of linear matchings
- Parameterized and approximation algorithms for finding two disjoint matchings
- Parameterized and Approximation Algorithms for Finding Two Disjoint Matchings
Cited in
(18)- Fast parameterized matching with \(q\)-grams
- A taxonomy of sublinear multiple keyword pattern matching algorithms
- Parameterized algorithms and kernels for almost induced matching
- A brief history of parameterized matching problems
- Parameterized and Approximation Algorithms for Finding Two Disjoint Matchings
- Parameterized algorithms for inclusion of linear matchings
- Approximate parameterized matching
- Parameterized Duplication in Strings: Algorithms and an Application to Software Maintenance
- Two-dimensional parameterized matching
- Algorithms – ESA 2004
- Combinatorial Pattern Matching
- Parameterized complexity of perfectly matched sets
- Computing the parameterized Burrows-Wheeler transform online
- Efficient parameterized pattern matching in sublinear space
- Parameterized searching with mismatches for run-length encoded strings
- Efficient parameterized string matching
- Parameterized matching with mismatches
- Parameterized matching on non-linear structures
This page was built for publication: Sublinear Algorithms for Parameterized Matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5307519)
