Algorithmic complexity of protein identification: Combinatorics of weighted strings
DOI10.1016/S0166-218X(03)00187-2zbMATH Open1031.92012OpenAlexW2031705959WikidataQ54308824 ScholiaQ54308824MaRDI QIDQ1422404FDOQ1422404
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
Recommendations
Biochemistry, molecular biology (92C40) Analysis of algorithms and problem complexity (68Q25) Combinatorics on words (68R15)
Cites Work
- Title not available (Why is that?)
- Algorithms on Strings, Trees and Sequences
- Title not available (Why is that?)
- Title not available (Why is that?)
- Storing a Sparse Table with 0 (1) Worst Case Access Time
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sorting X + Y
- Title not available (Why is that?)
- The complexity of searching in \(X+Y\) and other multisets
Cited In (7)
- 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
- Combinatorial Pattern Matching
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)