Finding submasses in weighted strings with fast Fourier transform
From MaRDI portal
Publication:876468
DOI10.1016/J.DAM.2005.09.019zbMATH Open1163.68044OpenAlexW2112196488MaRDI QIDQ876468FDOQ876468
N. Bansal, Mark Cieliebak, Zsuzsanna Lipták
Publication date: 18 April 2007
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2005.09.019
Protein sequences, DNA sequences (92D20) Analysis of algorithms (68W40) Nonnumerical algorithms (68W05)
Cites Work
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Efficient text fingerprinting via Parikh mapping
- Verifying candidate matches in sparse and wildcard matching
- Algorithmic complexity of protein identification: Combinatorics of weighted strings
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: Finding submasses in weighted strings with fast Fourier transform
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q876468)
