Finding submasses in weighted strings with fast Fourier transform

DOI10.1016/J.DAM.2005.09.019zbMath1163.68044OpenAlexW2112196488MaRDI QIDQ876468

Nikhil 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

zbMATH Keywords

fast Fourier transformstring algorithmsweighted stringsprotein identification

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Protein sequences, DNA sequences (92D20)

Cites Work

• Algorithmic complexity of protein identification: Combinatorics of weighted strings
• Efficient text fingerprinting via Parikh mapping
• Verifying candidate matches in sparse and wildcard matching
• An Algorithm for the Machine Calculation of Complex Fourier Series
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Finding submasses in weighted strings with fast Fourier transform