Algorithmic complexity of protein identification: Combinatorics of weighted strings

DOI10.1016/S0166-218X(03)00187-2zbMath1031.92012OpenAlexW2031705959WikidataQ54308824 ScholiaQ54308824MaRDI QIDQ1422404

Mark Cieliebak, Jens Stoye, Zsuzsanna Lipták, Erlebach, Thomas, Ermo 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

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

Related Items (5)

ALGORITHMS FOR JUMBLED PATTERN MATCHING IN STRINGS ⋮ Finding submasses in weighted strings with fast Fourier transform ⋮ Approximating the maximum consecutive subsums of a sequence ⋮ On approximate jumbled pattern matching in strings ⋮ On prefix normal words and prefix normal forms

Cites Work

• The complexity of searching in \(X+Y\) and other multisets
• Storing a Sparse Table with 0 (1) Worst Case Access Time
• Sorting X + Y
• Algorithms on Strings, Trees and Sequences
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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