IDEAS home Printed from https://ideas.repec.org/a/taf/lstaxx/v48y2019i1p62-74.html
   My bibliography  Save this article

Entropy-based goodness-of-fit tests—a unifying framework: Application to DNA replication

Author

Listed:
  • Valérie Girardin
  • Justine Lequesne

Abstract

This paper mainly aims at unifying as a unique goodness-of-fit procedure the tests based on Shannon entropy–called S-tests–introduced by Vasicek in 1976, and the tests based on relative entropy–or Kullback-Leibler divergence, called KL-tests–introduced by Song in 2002. While Vasicek’s procedure is widely used in the literature, Song’s has remained more confidential. Both tests are known to have good power properties and to lead to straightforward computations. However, some asymptotic properties of the S-tests have never been checked and the link between the two procedures has never been highlighted. Mathematical justification of both tests is detailed here, leading to show their equivalence for testing any parametric composite null hypothesis of maximum entropy distributions. For testing any other distribution, the KL-tests are still reliable goodness-of-fit tests, whereas the S-tests become tests of entropy level. Moreover, for simple null hypothesis, only the KL-tests can be considered. The methodology is applied to a real dataset of a DNA replication process, issued from a collaboration with biologists. The objective is to validate an experimental protocol to detect chicken cell lines for which the spatiotemporal program of DNA replication is not correctly executed. We propose a two-step approach through entropy-based tests. First, a Fisher distribution with non integer parameters is retained as reference, and then the experimental protocol is validated.

Suggested Citation

  • Valérie Girardin & Justine Lequesne, 2019. "Entropy-based goodness-of-fit tests—a unifying framework: Application to DNA replication," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 48(1), pages 62-74, January.
  • Handle: RePEc:taf:lstaxx:v:48:y:2019:i:1:p:62-74
    DOI: 10.1080/03610926.2017.1401084
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2017.1401084
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/03610926.2017.1401084?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:taf:lstaxx:v:48:y:2019:i:1:p:62-74. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/lsta .

    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.