Zobrazeno 1 - 10
of 400
pro vyhledávání: '"Böcker Sebastian"'
Autor:
Bushuiev, Roman, Bushuiev, Anton, de Jonge, Niek F., Young, Adamo, Kretschmer, Fleming, Samusevich, Raman, Heirman, Janne, Wang, Fei, Zhang, Luke, Dührkop, Kai, Ludwig, Marcus, Haupt, Nils A., Kalia, Apurva, Brungs, Corinna, Schmid, Robin, Greiner, Russell, Wang, Bo, Wishart, David S., Liu, Li-Ping, Rousu, Juho, Bittremieux, Wout, Rost, Hannes, Mak, Tytus D., Hassoun, Soha, Huber, Florian, van der Hooft, Justin J. J., Stravs, Michael A., Böcker, Sebastian, Sivic, Josef, Pluskal, Tomáš
The discovery and identification of molecules in biological and environmental samples is crucial for advancing biomedical and chemical sciences. Tandem mass spectrometry (MS/MS) is the leading technique for high-throughput elucidation of molecular st
Externí odkaz:
http://arxiv.org/abs/2410.23326
Autor:
Barbosa Eudes, Röttger Richard, Hauschild Anne-Christin, de Castro Soares Siomar, Böcker Sebastian, Azevedo Vasco, Baumbach Jan
Publikováno v:
Journal of Integrative Bioinformatics, Vol 14, Iss 2, Pp 1366-1372 (2017)
Distinct bacteria are able to cope with highly diverse lifestyles; for instance, they can be free living or host-associated. Thus, these organisms must possess a large and varied genomic arsenal to withstand different environmental conditions. To fac
Externí odkaz:
https://doaj.org/article/3b1e2c33bcd7496a925afaa042134663
Publikováno v:
BMC Bioinformatics, Vol 10, Iss Suppl 1, p S61 (2009)
Abstract Background The COMPARABILITY EDITING problem appears in the context of hierarchical disease classification based on noisy data. We are given a directed graph G representing hierarchical relationships between patient subgroups. The task is to
Externí odkaz:
https://doaj.org/article/93eb7c46537245eb91e96bf643906702
Publikováno v:
BMC Bioinformatics, Vol 12, Iss 1, p 106 (2011)
Abstract Background The center string (or closest string) problem is a classic computer science problem with important applications in computational biology. Given k input strings and a distance threshold d, we search for a string within Hamming dist
Externí odkaz:
https://doaj.org/article/ef521c8520174adda8f9fd9a1b4b4ead
Publikováno v:
BMC Bioinformatics, Vol 9, Iss 1, p 443 (2008)
Abstract Background Mass spectrometry is a key technique in proteomics and can be used to analyze complex samples quickly. One key problem with the mass spectrometric analysis of peptides and proteins, however, is the fact that absolute quantificatio
Externí odkaz:
https://doaj.org/article/83c0fdfc47014d60ba035a2c44a2659b
Publikováno v:
BMC Bioinformatics, Vol 8, Iss 1, p 102 (2007)
Abstract Background Mass spectrometry based peptide mass fingerprints (PMFs) offer a fast, efficient, and robust method for protein identification. A protein is digested (usually by trypsin) and its mass spectrum is compared to simulated spectra for
Externí odkaz:
https://doaj.org/article/c47997b792ee4113a7d80233f794e0e7
In metabolomics, small molecules are structurally elucidated using tandem mass spectrometry (MS/MS); this resulted in the computational Maximum Colorful Subtree problem, which is NP-hard. Unfortunately, data from a single metabolite requires us to so
Externí odkaz:
http://arxiv.org/abs/1801.07456
We present a dynamic programming algorithm for optimally solving the Cograph Editing problem on an $n$-vertex graph that runs in $O(3^n n)$ time and uses $O(2^n)$ space. In this problem, we are given a graph $G = (V, E)$ and the task is to find a sma
Externí odkaz:
http://arxiv.org/abs/1711.05839
Publikováno v:
In Journal of Chromatography B 1 January 2022 1188
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.