Algorithmic complexity of protein identification: Combinatorics of weighted strings

DOI10.1016/S0166-218X(03)00187-2MaRDI QIDQ1422404zbMATH OpenOpenAlexWikidataFDO

Authors Mark Cieliebak, Zsuzsanna Lipták, Jens Stoye, Thomas Erlebach, Emo Welzl

Publication date 14 February 2004

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0166-218x(03)00187-2

zbMATH Keywords

Computational BiologyProtein IdentificationWeighted Strings

Mathematics Subject Classification ID

Biochemistry, molecular biology (92C40) Analysis of algorithms and problem complexity (68Q25) Combinatorics on words (68R15)

Recommendations

• Combinatorial Pattern Matching
• Linear-time computation of prefix table for weighted strings
• Linear-time computation of prefix table for weighted strings {\&} applications
• scientific article; zbMATH DE number 2163025
• Fast Average-Case Pattern Matching on Weighted Sequences

Cites work

• scientific article; zbMATH DE number 3607502 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1024080 (Why is no real title available?)
• scientific article; zbMATH DE number 1557065 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• scientific article; zbMATH DE number 801745 (Why is no real title available?)
• scientific article; zbMATH DE number 823957 (Why is no real title available?)
• Algorithms on Strings, Trees and Sequences
• Sorting X + Y
• Storing a Sparse Table with 0 (1) Worst Case Access Time
• The complexity of searching in \(X+Y\) and other multisets

Cited in

(7)

• Combinatorial Pattern Matching
• Natural vs. random protein sequences: discovering combinatorics properties on amino acid words
• On prefix normal words and prefix normal forms
• On approximate jumbled pattern matching in strings
• Finding submasses in weighted strings with fast Fourier transform
• Approximating the maximum consecutive subsums of a sequence
• Algorithms for jumbled pattern matching in strings

This page was built for publication: Algorithmic complexity of protein identification: Combinatorics of weighted strings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1422404)