Finding submasses in weighted strings with fast Fourier transform

DOI10.1016/J.DAM.2005.09.019MaRDI QIDQ876468zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

fast Fourier transformstring algorithmsweighted stringsprotein identification

Mathematics Subject Classification ID

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

Recommendations

• Combinatorial Pattern Matching
• Algorithmic complexity of protein identification: Combinatorics of weighted strings
• Linear-time computation of prefix table for weighted strings
• Fast Average-Case Pattern Matching on Weighted Sequences
• An acceleration of FFT-based algorithms for the match-count problem

Cites work

• scientific article; zbMATH DE number 5604096 (Why is no real title available?)
• scientific article; zbMATH DE number 45266 (Why is no real title available?)
• scientific article; zbMATH DE number 1945155 (Why is no real title available?)
• scientific article; zbMATH DE number 910895 (Why is no real title available?)
• Algorithmic complexity of protein identification: Combinatorics of weighted strings
• An Algorithm for the Machine Calculation of Complex Fourier Series
• Efficient text fingerprinting via Parikh mapping
• Verifying candidate matches in sparse and wildcard matching

Cited in

(1)

• Combinatorial Pattern Matching

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)