default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTomas Hruz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2018
[j7]Yves Frank, Tomas Hruz, Thomas Tschager
, Valentin Venzin:
Improved de novo peptide sequencing using LC retention time information. Algorithms Mol. Biol. 13(1): 14:1-14:16 (2018)- 2014
- [j6]Philip Zimmermann, Stefan Bleuler, Oliver Laule, Florian Martin, Nikolai V. Ivanov, Prisca Campanoni, Karen Oishi, Nicolas Lugon-Moulin, Markus Wyss, Tomas Hruz, Wilhelm Gruissem:
ExpressionData - A public resource of high quality curated datasets representing gene expression across anatomy, development and experimental conditions. BioData Min. 7: 18 (2014) - 2013
- [j5]Tomas Hruz, Markus Wyss, Christoph Lucas, Oliver Laule, Peter von Rohr, Philip Zimmermann, Stefan Bleuler:
A Multilevel Gamma-Clustering Layout Algorithm for Visualization of Biological Networks. Adv. Bioinformatics 2013: 920325:1-920325:10 (2013) - 2011
- [j4]Tomas Hruz, Ueli Peter:
Nongrowing Preferential Attachment Random Graphs. Internet Math. 6(4): 461-487 (2011) - 2010
- [j3]Tomas Hruz, Stefan Geisseler, Marcel Schöngens:
Parallelism in simulation and modeling of scale-free complex networks. Parallel Comput. 36(8): 469-485 (2010) - 2008
- [j2]Tomas Hruz, Oliver Laule, Gábor Szabó, Frans Wessendorp, Stefan Bleuler, Lukas Oertle, Peter Widmayer, Wilhelm Gruissem, Philip Zimmermann:
Genevestigator V3: A Reference Expression Database for the Meta-Analysis of Transcriptomes. Adv. Bioinformatics 2008: 420747:1-420747:5 (2008) - 2006
- [j1]Oliver Laule, Matthias Hirsch-Hoffmann, Tomas Hruz, Wilhelm Gruissem, Philip Zimmermann:
Web-based analysis of the mouse transcriptome using Genevestigator. BMC Bioinform. 7: 311 (2006)
Conference and Workshop Papers
- 2017
- [c6]Yves Frank, Tomas Hruz, Thomas Tschager, Valentin Venzin:
Improved De Novo Peptide Sequencing using LC Retention Time Information. WABI 2017: 26:1-26:17 - 2016
- [c5]Andreas Bärtschi, Barbara Geissmann, Daniel Graf, Tomas Hruz, Paolo Penna, Thomas Tschager:
On Computing the Total Displacement Number via Weighted Motzkin Paths. IWOCA 2016: 423-434 - 2012
- [c4]Tomas Hruz, Marcel Schöngens:
Partially Specified Nearest Neighbor Search. COCOON 2012: 372-383 - [c3]Tomas Hruz, Marcel Schöngens:
A Simple Framework for the Generalized Nearest Neighbor Problem. SWAT 2012: 83-94 - 2009
- [c2]Ueli Peter, Tomas Hruz:
Clustering Signature in Complex Social Networks. CSE (4) 2009: 237-244 - 2006
- [c1]Tomas Hruz, Matthias Hirsch-Hoffmann, Wilhelm Gruissem, Philip Zimmermann:
Reducing Java internet project risks: a case study of public measurement of client component functionality in the user community. PPPJ 2006: 199-202
Informal and Other Publications
- 2016
- [i1]Andreas Bärtschi, Barbara Geissmann, Daniel Graf, Tomas Hruz, Paolo Penna, Thomas Tschager:
On computing the total displacement number via weighted Motzkin paths. CoRR abs/1606.05538 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:47 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
