Antoine H. C. van Kampen

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with coauthor community group 2

> Home > Persons > Antoine H. C. van Kampen

Publications

2022
[j18]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/ploscb/LashgariTMCGHK22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ploscb/LashgariTMCGHK22
Danial Lashgari, Elena Merino Tejero, Michael Meyer-Hermann, Mathieu A. F. Claireaux, Marit J. van Gils, Huub C. J. Hoefsloot, Antoine H. C. van Kampen:
From affinity selection to kinetic selection in Germinal Centre modelling. PLoS Comput. Biol. 18(6) (2022)
2015
[j15]
- view
  authority control:
- export record
  dblp key:
  - journals/cbm/ReshetovaSWK15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cbm/ReshetovaSWK15
Polina Reshetova, Age K. Smilde, Johan A. Westerhuis, Antoine H. C. van Kampen:
Using Petri nets for experimental design in a multi-organ elimination pathway. Comput. Biol. Medicine 63: 19-27 (2015)
2014
[j12]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/bmcsb/ReshetovaSKW14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/bmcsb/ReshetovaSKW14
Polina Reshetova, Age K. Smilde, Antoine H. C. van Kampen, Johan A. Westerhuis:
Use of prior knowledge for the analysis of high-throughput transcriptomics and metabolomics data. BMC Syst. Biol. 8(S-2): S2 (2014)

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.