IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v24y1982i6p531-534.html
   My bibliography  Save this article

Algorithms, software and sequential optimal sampling schedule designs for pharmacokinetic and physiologic experiments

Author

Listed:
  • DiStefano, Joseph J.

Abstract

The problem of designing optimal blood sampling protocols for kinetic experiments in pharmacology, physiology and medicine is briefly described, followed by a presentation of several interesting results based on sequentially optimized studies we have performed in more than 75 laboratory animals. Experiences with different algorithms and design software are also presented. The overall approach appears to be highly efficacious, from the standpoints of both laboratory economics and resulting model accuracy. Optimal sampling schedules (OSS) have a number of different time points equal to the number of unknown parameters for a popular class of models. Replication rather than distribution of samples provide maximum accuracy when additional sampling is feasible; and specific replicates can be used to weight some parameter accuracies more than others, even when a D-optimality criterion is used. Our sequential experiment scheme often converged in 1 step and resulting optimal sampling schedules were reasonably robust, allowing for biological variation among the animals studied.

Suggested Citation

  • DiStefano, Joseph J., 1982. "Algorithms, software and sequential optimal sampling schedule designs for pharmacokinetic and physiologic experiments," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 24(6), pages 531-534.
    • Handle: RePEc:eee:matcom:v:24:y:1982:i:6:p:531-534
    DOI: 10.1016/0378-4754(82)90654-1
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0378475482906541
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/0378-4754(82)90654-1?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:matcom:v:24:y:1982:i:6:p:531-534. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.