IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v23y2012i1d10.1007_s10878-010-9340-8.html
   My bibliography  Save this article

Solving haplotype inference problem with non-genotyped founders via integer linear programming

Author

Listed:
  • Yongxi Cheng

    (Xi’an Jiao Tong University)

  • Guohui Lin

    (University of Alberta)

Abstract

In Cheng et al. (Acta Math. Appl. Sin. (English Ser.), 25:475–486, 2009), the authors present a cubic time zero-recombination haplotyping algorithm that can handle some incomplete pedigrees. More specifically, the algorithm can handle pedigrees with non-genotyped founders, provided that for each nuclear family at least one parent is genotyped and each non-genotyped founder appears in at most one nuclear family. The importance of this lies in that such cases frequently happen in real data, because some founders may have passed away and their genotype data can no longer be collected. In this paper, we further generalize the above algorithm by removing the first restriction. We present a new integer linear programming based algorithm that handles pedigrees with non-genotyped founders. The new algorithm allows the pedigrees to have nuclear families where both parents are non-genotyped founders, provided that each non-genotyped founder appears in at most one nuclear family.

Suggested Citation

  • Yongxi Cheng & Guohui Lin, 2012. "Solving haplotype inference problem with non-genotyped founders via integer linear programming," Journal of Combinatorial Optimization, Springer, vol. 23(1), pages 50-60, January.
    • Handle: RePEc:spr:jcomop:v:23:y:2012:i:1:d:10.1007_s10878-010-9340-8
    DOI: 10.1007/s10878-010-9340-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-010-9340-8
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-010-9340-8?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.

    References listed on IDEAS

    as
    1. Lan Liu & Tao Jiang, 2010. "A linear-time algorithm for reconstructing zero-recombinant haplotype configuration on pedigrees without mating loops," Journal of Combinatorial Optimization, Springer, vol. 19(2), pages 217-240, February.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      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:spr:jcomop:v:23:y:2012:i:1:d:10.1007_s10878-010-9340-8. 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.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

      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.