Efficient algorithms for finding submasses in weighted strings
From MaRDI portal
Recommendations
- Finding submasses in weighted strings with fast Fourier transform
- Algorithmic complexity of protein identification: Combinatorics of weighted strings
- A linear space algorithm for the heaviest common subsequence problem
- Fast Average-Case Pattern Matching on Weighted Sequences
- Crochemore's partitioning on weighted strings and applications
Cited in
(5)- Discovering subword associations in strings in time linear in the output size
- Algorithmic complexity of protein identification: Combinatorics of weighted strings
- Finding least-weight subsequences with fewer processors
- Algorithms – ESA 2005
- Finding submasses in weighted strings with fast Fourier transform
This page was built for publication: Efficient algorithms for finding submasses in weighted strings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5315327)