A linear-time algorithm for reconstructing zero-recombinant haplotype configuration on a pedigree
Background When studying genetic diseases in which genetic variations are passed on to offspring, the ability to distinguish between paternal and maternal alleles is essential. Determining haplotypes from genotype data is called haplotype inference. Most existing computational algorithms for haploty...
Saved in:
| Published in | BMC bioinformatics Vol. 13; no. Suppl 17; p. S19 |
|---|---|
| Main Authors | , , , |
| Format | Journal Article |
| Language | English |
| Published |
London
BioMed Central
2012
Springer Nature B.V BMC |
| Subjects | |
| Online Access | Get full text |
| ISSN | 1471-2105 1471-2105 |
| DOI | 10.1186/1471-2105-13-S17-S19 |
Cover
| Abstract | Background
When studying genetic diseases in which genetic variations are passed on to offspring, the ability to distinguish between paternal and maternal alleles is essential. Determining haplotypes from genotype data is called haplotype inference. Most existing computational algorithms for haplotype inference have been designed to use genotype data collected from individuals in the form of a pedigree. A haplotype is regarded as a hereditary unit and therefore input pedigrees are preferred that are free of mutational events and have a minimum number of genetic recombinational events. These ideas motivated the zero-recombinant haplotype configuration (ZRHC) problem, which strictly follows the Mendelian law of inheritance, namely that one haplotype of each child is inherited from the father and the other haplotype is inherited from the mother, both without any mutation. So far no linear-time algorithm for ZRHC has been proposed for general pedigrees, even though the number of mating loops in a human pedigree is usually very small and can be regarded as constant.
Results
Given a pedigree with
n
individuals,
m
marker loci, and
k
mating loops, we proposed an algorithm that can provide a general solution to the zero-recombinant haplotype configuration problem in
O
(
kmn
+
k
2
m
) time. In addition, this algorithm can be modified to detect inconsistencies within the genotype data without loss of efficiency. The proposed algorithm was subject to 12000 experiments to verify its performance using different (
n, m
) combinations. The value of
k
was uniformly distributed between zero and six throughout all experiments. The experimental results show a great linearity in terms of execution time in relation to input size when both
n
and
m
are larger than 100. For those experiments where
n
or
m
are less than 100, the proposed algorithm runs very fast, in thousandth to hundredth of a second, on a personal desktop computer.
Conclusions
We have developed the first deterministic linear-time algorithm for the zero-recombinant haplotype configuration problem. Our experimental results demonstrated the linearity of its execution time in relation to the input size. The proposed algorithm can be modified to detect inconsistency within the genotype data without loss of efficiency and is expected to be able to handle recombinant and missing data with further extension. |
|---|---|
| AbstractList | Doc number: S19 Abstract Background: When studying genetic diseases in which genetic variations are passed on to offspring, the ability to distinguish between paternal and maternal alleles is essential. Determining haplotypes from genotype data is called haplotype inference. Most existing computational algorithms for haplotype inference have been designed to use genotype data collected from individuals in the form of a pedigree. A haplotype is regarded as a hereditary unit and therefore input pedigrees are preferred that are free of mutational events and have a minimum number of genetic recombinational events. These ideas motivated the zero-recombinant haplotype configuration (ZRHC) problem, which strictly follows the Mendelian law of inheritance, namely that one haplotype of each child is inherited from the father and the other haplotype is inherited from the mother, both without any mutation. So far no linear-time algorithm for ZRHC has been proposed for general pedigrees, even though the number of mating loops in a human pedigree is usually very small and can be regarded as constant. Results: Given a pedigree with n individuals, m marker loci, and k mating loops, we proposed an algorithm that can provide a general solution to the zero-recombinant haplotype configuration problem in O (kmn + k2m ) time. In addition, this algorithm can be modified to detect inconsistencies within the genotype data without loss of efficiency. The proposed algorithm was subject to 12000 experiments to verify its performance using different (n, m ) combinations. The value of k was uniformly distributed between zero and six throughout all experiments. The experimental results show a great linearity in terms of execution time in relation to input size when both n and m are larger than 100. For those experiments where n or m are less than 100, the proposed algorithm runs very fast, in thousandth to hundredth of a second, on a personal desktop computer. Conclusions: We have developed the first deterministic linear-time algorithm for the zero-recombinant haplotype configuration problem. Our experimental results demonstrated the linearity of its execution time in relation to the input size. The proposed algorithm can be modified to detect inconsistency within the genotype data without loss of efficiency and is expected to be able to handle recombinant and missing data with further extension. Background: When studying genetic diseases in which genetic variations are passed on to offspring, the ability to distinguish between paternal and maternal alleles is essential. Determining haplotypes from genotype data is called haplotype inference. Most existing computational algorithms for haplotype inference have been designed to use genotype data collected from individuals in the form of a pedigree. A haplotype is regarded as a hereditary unit and therefore input pedigrees are preferred that are free of mutational events and have a minimum number of genetic recombinational events. These ideas motivated the zero-recombinant haplotype configuration (ZRHC) problem, which strictly follows the Mendelian law of inheritance, namely that one haplotype of each child is inherited from the father and the other haplotype is inherited from the mother, both without any mutation. So far no linear-time algorithm for ZRHC has been proposed for general pedigrees, even though the number of mating loops in a human pedigree is usually very small and can be regarded as constant. Results: Given a pedigree with n individuals, m marker loci, and k mating loops, we proposed an algorithm that can provide a general solution to the zero-recombinant haplotype configuration problem in O(kmn + k super(2)m) time. In addition, this algorithm can be modified to detect inconsistencies within the genotype data without loss of efficiency. The proposed algorithm was subject to 12000 experiments to verify its performance using different (n, m) combinations. The value of k was uniformly distributed between zero and six throughout all experiments. The experimental results show a great linearity in terms of execution time in relation to input size when both n and m are larger than 100. For those experiments where n or m are less than 100, the proposed algorithm runs very fast, in thousandth to hundredth of a second, on a personal desktop computer. Conclusions: We have developed the first deterministic linear-time algorithm for the zero-recombinant haplotype configuration problem. Our experimental results demonstrated the linearity of its execution time in relation to the input size. The proposed algorithm can be modified to detect inconsistency within the genotype data without loss of efficiency and is expected to be able to handle recombinant and missing data with further extension. When studying genetic diseases in which genetic variations are passed on to offspring, the ability to distinguish between paternal and maternal alleles is essential. Determining haplotypes from genotype data is called haplotype inference. Most existing computational algorithms for haplotype inference have been designed to use genotype data collected from individuals in the form of a pedigree. A haplotype is regarded as a hereditary unit and therefore input pedigrees are preferred that are free of mutational events and have a minimum number of genetic recombinational events. These ideas motivated the zero-recombinant haplotype configuration (ZRHC) problem, which strictly follows the Mendelian law of inheritance, namely that one haplotype of each child is inherited from the father and the other haplotype is inherited from the mother, both without any mutation. So far no linear-time algorithm for ZRHC has been proposed for general pedigrees, even though the number of mating loops in a human pedigree is usually very small and can be regarded as constant.BACKGROUNDWhen studying genetic diseases in which genetic variations are passed on to offspring, the ability to distinguish between paternal and maternal alleles is essential. Determining haplotypes from genotype data is called haplotype inference. Most existing computational algorithms for haplotype inference have been designed to use genotype data collected from individuals in the form of a pedigree. A haplotype is regarded as a hereditary unit and therefore input pedigrees are preferred that are free of mutational events and have a minimum number of genetic recombinational events. These ideas motivated the zero-recombinant haplotype configuration (ZRHC) problem, which strictly follows the Mendelian law of inheritance, namely that one haplotype of each child is inherited from the father and the other haplotype is inherited from the mother, both without any mutation. So far no linear-time algorithm for ZRHC has been proposed for general pedigrees, even though the number of mating loops in a human pedigree is usually very small and can be regarded as constant.Given a pedigree with n individuals, m marker loci, and k mating loops, we proposed an algorithm that can provide a general solution to the zero-recombinant haplotype configuration problem in O(kmn + k2m) time. In addition, this algorithm can be modified to detect inconsistencies within the genotype data without loss of efficiency. The proposed algorithm was subject to 12000 experiments to verify its performance using different (n, m) combinations. The value of k was uniformly distributed between zero and six throughout all experiments. The experimental results show a great linearity in terms of execution time in relation to input size when both n and m are larger than 100. For those experiments where n or m are less than 100, the proposed algorithm runs very fast, in thousandth to hundredth of a second, on a personal desktop computer.RESULTSGiven a pedigree with n individuals, m marker loci, and k mating loops, we proposed an algorithm that can provide a general solution to the zero-recombinant haplotype configuration problem in O(kmn + k2m) time. In addition, this algorithm can be modified to detect inconsistencies within the genotype data without loss of efficiency. The proposed algorithm was subject to 12000 experiments to verify its performance using different (n, m) combinations. The value of k was uniformly distributed between zero and six throughout all experiments. The experimental results show a great linearity in terms of execution time in relation to input size when both n and m are larger than 100. For those experiments where n or m are less than 100, the proposed algorithm runs very fast, in thousandth to hundredth of a second, on a personal desktop computer.We have developed the first deterministic linear-time algorithm for the zero-recombinant haplotype configuration problem. Our experimental results demonstrated the linearity of its execution time in relation to the input size. The proposed algorithm can be modified to detect inconsistency within the genotype data without loss of efficiency and is expected to be able to handle recombinant and missing data with further extension.CONCLUSIONSWe have developed the first deterministic linear-time algorithm for the zero-recombinant haplotype configuration problem. Our experimental results demonstrated the linearity of its execution time in relation to the input size. The proposed algorithm can be modified to detect inconsistency within the genotype data without loss of efficiency and is expected to be able to handle recombinant and missing data with further extension. When studying genetic diseases in which genetic variations are passed on to offspring, the ability to distinguish between paternal and maternal alleles is essential. Determining haplotypes from genotype data is called haplotype inference. Most existing computational algorithms for haplotype inference have been designed to use genotype data collected from individuals in the form of a pedigree. A haplotype is regarded as a hereditary unit and therefore input pedigrees are preferred that are free of mutational events and have a minimum number of genetic recombinational events. These ideas motivated the zero-recombinant haplotype configuration (ZRHC) problem, which strictly follows the Mendelian law of inheritance, namely that one haplotype of each child is inherited from the father and the other haplotype is inherited from the mother, both without any mutation. So far no linear-time algorithm for ZRHC has been proposed for general pedigrees, even though the number of mating loops in a human pedigree is usually very small and can be regarded as constant. Given a pedigree with n individuals, m marker loci, and k mating loops, we proposed an algorithm that can provide a general solution to the zero-recombinant haplotype configuration problem in O(kmn + k2m) time. In addition, this algorithm can be modified to detect inconsistencies within the genotype data without loss of efficiency. The proposed algorithm was subject to 12000 experiments to verify its performance using different (n, m) combinations. The value of k was uniformly distributed between zero and six throughout all experiments. The experimental results show a great linearity in terms of execution time in relation to input size when both n and m are larger than 100. For those experiments where n or m are less than 100, the proposed algorithm runs very fast, in thousandth to hundredth of a second, on a personal desktop computer. We have developed the first deterministic linear-time algorithm for the zero-recombinant haplotype configuration problem. Our experimental results demonstrated the linearity of its execution time in relation to the input size. The proposed algorithm can be modified to detect inconsistency within the genotype data without loss of efficiency and is expected to be able to handle recombinant and missing data with further extension. Background When studying genetic diseases in which genetic variations are passed on to offspring, the ability to distinguish between paternal and maternal alleles is essential. Determining haplotypes from genotype data is called haplotype inference. Most existing computational algorithms for haplotype inference have been designed to use genotype data collected from individuals in the form of a pedigree. A haplotype is regarded as a hereditary unit and therefore input pedigrees are preferred that are free of mutational events and have a minimum number of genetic recombinational events. These ideas motivated the zero-recombinant haplotype configuration (ZRHC) problem, which strictly follows the Mendelian law of inheritance, namely that one haplotype of each child is inherited from the father and the other haplotype is inherited from the mother, both without any mutation. So far no linear-time algorithm for ZRHC has been proposed for general pedigrees, even though the number of mating loops in a human pedigree is usually very small and can be regarded as constant. Results Given a pedigree with n individuals, m marker loci, and k mating loops, we proposed an algorithm that can provide a general solution to the zero-recombinant haplotype configuration problem in O ( kmn + k 2 m ) time. In addition, this algorithm can be modified to detect inconsistencies within the genotype data without loss of efficiency. The proposed algorithm was subject to 12000 experiments to verify its performance using different ( n, m ) combinations. The value of k was uniformly distributed between zero and six throughout all experiments. The experimental results show a great linearity in terms of execution time in relation to input size when both n and m are larger than 100. For those experiments where n or m are less than 100, the proposed algorithm runs very fast, in thousandth to hundredth of a second, on a personal desktop computer. Conclusions We have developed the first deterministic linear-time algorithm for the zero-recombinant haplotype configuration problem. Our experimental results demonstrated the linearity of its execution time in relation to the input size. The proposed algorithm can be modified to detect inconsistency within the genotype data without loss of efficiency and is expected to be able to handle recombinant and missing data with further extension. Abstract Background When studying genetic diseases in which genetic variations are passed on to offspring, the ability to distinguish between paternal and maternal alleles is essential. Determining haplotypes from genotype data is called haplotype inference. Most existing computational algorithms for haplotype inference have been designed to use genotype data collected from individuals in the form of a pedigree. A haplotype is regarded as a hereditary unit and therefore input pedigrees are preferred that are free of mutational events and have a minimum number of genetic recombinational events. These ideas motivated the zero-recombinant haplotype configuration (ZRHC) problem, which strictly follows the Mendelian law of inheritance, namely that one haplotype of each child is inherited from the father and the other haplotype is inherited from the mother, both without any mutation. So far no linear-time algorithm for ZRHC has been proposed for general pedigrees, even though the number of mating loops in a human pedigree is usually very small and can be regarded as constant. Results Given a pedigree with n individuals, m marker loci, and k mating loops, we proposed an algorithm that can provide a general solution to the zero-recombinant haplotype configuration problem in O(kmn + k2m) time. In addition, this algorithm can be modified to detect inconsistencies within the genotype data without loss of efficiency. The proposed algorithm was subject to 12000 experiments to verify its performance using different (n, m) combinations. The value of k was uniformly distributed between zero and six throughout all experiments. The experimental results show a great linearity in terms of execution time in relation to input size when both n and m are larger than 100. For those experiments where n or m are less than 100, the proposed algorithm runs very fast, in thousandth to hundredth of a second, on a personal desktop computer. Conclusions We have developed the first deterministic linear-time algorithm for the zero-recombinant haplotype configuration problem. Our experimental results demonstrated the linearity of its execution time in relation to the input size. The proposed algorithm can be modified to detect inconsistency within the genotype data without loss of efficiency and is expected to be able to handle recombinant and missing data with further extension. |
| ArticleNumber | S19 |
| Author | Wang, Wei-Bung Jiang, Tao Wu, Kun-Pin Lai, En-Yu |
| AuthorAffiliation | 3 Department of Computer Science and Engineering, University of California, Riverside, CA 92521, USA 1 Institute of Biomedical Informatics, National Yang Ming University, Taipei 112, Taiwan 2 Bioinformatics Program, Taiwan International Graduate Program, Academia Sinica, Taipei 115, Taiwan |
| AuthorAffiliation_xml | – name: 3 Department of Computer Science and Engineering, University of California, Riverside, CA 92521, USA – name: 2 Bioinformatics Program, Taiwan International Graduate Program, Academia Sinica, Taipei 115, Taiwan – name: 1 Institute of Biomedical Informatics, National Yang Ming University, Taipei 112, Taiwan |
| Author_xml | – sequence: 1 givenname: En-Yu surname: Lai fullname: Lai, En-Yu organization: Institute of Biomedical Informatics, National Yang Ming University, Bioinformatics Program, Taiwan International Graduate Program, Academia Sinica – sequence: 2 givenname: Wei-Bung surname: Wang fullname: Wang, Wei-Bung organization: Department of Computer Science and Engineering, University of California – sequence: 3 givenname: Tao surname: Jiang fullname: Jiang, Tao organization: Department of Computer Science and Engineering, University of California – sequence: 4 givenname: Kun-Pin surname: Wu fullname: Wu, Kun-Pin email: kpwu@ym.edu.tw organization: Institute of Biomedical Informatics, National Yang Ming University |
| BackLink | https://www.ncbi.nlm.nih.gov/pubmed/23281626$$D View this record in MEDLINE/PubMed |
| BookMark | eNqNUl2L1DAULbLifug_ECn44ks1n5PWB2FZ_FhY8EF9DnfStJMhTcY0VcZf7-3OOM4usgi5pL0553Bybs6LkxCDLYrnlLymtF68oULRilEiK8qrL1RhNY-Ks0P75Oj7tDgfxzUhVNVEPilOGWc1XbDFWQGXpXfBQqqyG2wJvo_J5dVQdjGVyZoYxpwmk13oy182xWruDUsXIORyBRsf83ZjS8R1rp8SZBdDiQvKjW1dn6x9WjzuwI_22X6_KL59eP_16lN18_nj9dXlTWVkTXMFDVOcKXTcqVq1y45L1ZlOESFbU1PGWtGCWPIG2sbYWrYECGtEZ2ppSNN1_KK43um2EdZ6k9wAaasjOH3biKnXkLIz3uqGogiDFpXniAQYSS0HIRhXHP9RS-60prCB7U_w_iBIiZ7j1zNRz9lqyvVIFVaDvHc73mZaDrY1NuQE_o6ZuyfBrXQff2guGQoSFHi1F0jx-2THrAc3Gus9BBunUVMMide0If8DlQqTFJQh9OU96DpOKeA0EMWVpFwoiagXx-YPrv88FgS83QFMiuOYbKeNy7cTx7s4_-9o8GVizdGIe-QHE_1L209iRHjobTqy_hDvNzB99Yk |
| CitedBy_id | crossref_primary_10_1186_1471_2164_14_645 crossref_primary_10_1186_1471_2105_13_S17_S1 crossref_primary_10_1016_j_compbiomed_2023_107296 crossref_primary_10_1186_2049_1891_4_30 |
| Cites_doi | 10.1002/1098-2272(2000)19:1+<::AID-GEPI10>3.0.CO;2-G 10.1089/10665270152530863 10.1086/338446 10.1073/pnas.1237858100 10.1534/genetics.107.074047 10.1089/cmb.2005.12.719 10.1007/978-1-4612-0751-1_6 10.1534/genetics.105.047134 10.1093/bioinformatics/bth388 10.1137/070687591 10.1159/000022890 10.1007/s10878-008-9180-y 10.1086/340610 10.1093/imammb/21.4.335 10.1137/080680990 10.1089/cmb.2009.0133 10.1038/nrg3054 10.1142/9781848162648_0026 10.1086/319501 10.1002/gepi.10195 |
| ContentType | Journal Article |
| Copyright | Lai et al.; licensee BioMed Central Ltd. 2012 This article is published under license to BioMed Central Ltd. This is an open access article distributed under the terms of the Creative Commons Attribution License ( ), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. 2012 Lai et al.; licensee BioMed Central Ltd. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Copyright ©2012 Lai et al.; licensee BioMed Central Ltd. 2012 Lai et al.; licensee BioMed Central Ltd. |
| Copyright_xml | – notice: Lai et al.; licensee BioMed Central Ltd. 2012 This article is published under license to BioMed Central Ltd. This is an open access article distributed under the terms of the Creative Commons Attribution License ( ), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. – notice: 2012 Lai et al.; licensee BioMed Central Ltd. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. – notice: Copyright ©2012 Lai et al.; licensee BioMed Central Ltd. 2012 Lai et al.; licensee BioMed Central Ltd. |
| DBID | C6C AAYXX CITATION CGR CUY CVF ECM EIF NPM 3V. 7QO 7SC 7X7 7XB 88E 8AL 8AO 8FD 8FE 8FG 8FH 8FI 8FJ 8FK ABUWG AEUYN AFKRA ARAPS AZQEC BBNVY BENPR BGLVJ BHPHI CCPQU DWQXO FR3 FYUFA GHDGH GNUQQ HCIFZ JQ2 K7- K9. L7M LK8 L~C L~D M0N M0S M1P M7P P5Z P62 P64 PHGZM PHGZT PIMPY PJZUB PKEHL PPXIY PQEST PQGLB PQQKQ PQUKI Q9U 7X8 5PM ADTOC UNPAY DOA |
| DOI | 10.1186/1471-2105-13-S17-S19 |
| DatabaseName | Springer Nature OA Free Journals (WRLC) CrossRef Medline MEDLINE MEDLINE (Ovid) MEDLINE MEDLINE PubMed ProQuest Central (Corporate) Biotechnology Research Abstracts Computer and Information Systems Abstracts Health & Medical Collection ProQuest Central (purchase pre-March 2016) Medical Database (Alumni Edition) Computing Database (Alumni Edition) ProQuest Pharma Collection Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Natural Science Journals Hospital Premium Collection Hospital Premium Collection (Alumni Edition) ProQuest Central (Alumni) (purchase pre-March 2016) ProQuest Central (Alumni) ProQuest One Sustainability ProQuest Central UK/Ireland ProQuest Advanced Technologies & Aerospace Database ProQuest Central Essentials Biological Science Collection ProQuest Central ProQuest Technology Collection (LUT) Natural Science Collection ProQuest One Community College ProQuest Central Korea Engineering Research Database Health Research Premium Collection Health Research Premium Collection (Alumni) ProQuest Central Student SciTech Premium Collection ProQuest Computer Science Collection Computer Science Database ProQuest Health & Medical Complete (Alumni) Advanced Technologies Database with Aerospace Biological Sciences Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Computing Database Health & Medical Collection (Alumni) Medical Database Biological Science Database Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection Biotechnology and BioEngineering Abstracts ProQuest Central Premium ProQuest One Academic Publicly Available Content Database ProQuest Health & Medical Research Collection ProQuest One Academic Middle East (New) ProQuest One Health & Nursing ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic ProQuest One Academic UKI Edition ProQuest Central Basic MEDLINE - Academic PubMed Central (Full Participant titles) Unpaywall for CDI: Periodical Content Unpaywall DOAJ Directory of Open Access Journals |
| DatabaseTitle | CrossRef MEDLINE Medline Complete MEDLINE with Full Text PubMed MEDLINE (Ovid) Publicly Available Content Database Computer Science Database ProQuest Central Student ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection Computer and Information Systems Abstracts SciTech Premium Collection ProQuest One Applied & Life Sciences ProQuest One Sustainability Health Research Premium Collection Natural Science Collection Health & Medical Research Collection Biological Science Collection ProQuest Central (New) ProQuest Medical Library (Alumni) Advanced Technologies & Aerospace Collection ProQuest Biological Science Collection ProQuest One Academic Eastern Edition ProQuest Hospital Collection ProQuest Technology Collection Health Research Premium Collection (Alumni) Biological Science Database ProQuest Hospital Collection (Alumni) Biotechnology and BioEngineering Abstracts ProQuest Health & Medical Complete ProQuest One Academic UKI Edition Engineering Research Database ProQuest One Academic ProQuest One Academic (New) Technology Collection Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest One Academic Middle East (New) ProQuest Health & Medical Complete (Alumni) ProQuest Central (Alumni Edition) ProQuest One Community College ProQuest One Health & Nursing ProQuest Natural Science Collection ProQuest Pharma Collection ProQuest Central ProQuest Health & Medical Research Collection Biotechnology Research Abstracts Health and Medicine Complete (Alumni Edition) ProQuest Central Korea Advanced Technologies Database with Aerospace ProQuest Computing ProQuest Central Basic ProQuest Computing (Alumni Edition) ProQuest SciTech Collection Computer and Information Systems Abstracts Professional Advanced Technologies & Aerospace Database ProQuest Medical Library ProQuest Central (Alumni) MEDLINE - Academic |
| DatabaseTitleList | Publicly Available Content Database Engineering Research Database MEDLINE - Academic MEDLINE |
| Database_xml | – sequence: 1 dbid: C6C name: Springer Nature OA Free Journals url: http://www.springeropen.com/ sourceTypes: Publisher – sequence: 2 dbid: DOA name: DOAJ Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website – sequence: 3 dbid: NPM name: PubMed url: https://proxy.k.utb.cz/login?url=http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed sourceTypes: Index Database – sequence: 4 dbid: EIF name: MEDLINE url: https://proxy.k.utb.cz/login?url=https://www.webofscience.com/wos/medline/basic-search sourceTypes: Index Database – sequence: 5 dbid: UNPAY name: Unpaywall url: https://proxy.k.utb.cz/login?url=https://unpaywall.org/ sourceTypes: Open Access Repository – sequence: 6 dbid: 8FG name: ProQuest Technology Collection url: https://search.proquest.com/technologycollection1 sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Biology |
| EISSN | 1471-2105 |
| EndPage | S19 |
| ExternalDocumentID | oai_doaj_org_article_91ad92ad5dc14714ac51e3a442373714 10.1186/1471-2105-13-s17-s19 PMC3521470 2839700611 23281626 10_1186_1471_2105_13_S17_S19 |
| Genre | Research Support, Non-U.S. Gov't Journal Article |
| GeographicLocations | Taiwan |
| GeographicLocations_xml | – name: Taiwan |
| GroupedDBID | --- 0R~ 23N 2WC 4.4 53G 5VS 6J9 7X7 88E 8AO 8FE 8FG 8FH 8FI 8FJ AAFWJ AAJSJ AAKPC AASML ABDBF ABUWG ACGFO ACGFS ACIHN ACIWK ACPRK ACUHS ADBBV ADMLS ADRAZ ADUKV AEAQA AENEX AEUYN AFKRA AFPKN AFRAH AHBYD AHMBA AHSBF AHYZX ALMA_UNASSIGNED_HOLDINGS AMKLP AMTXH AOIJS ARAPS AZQEC BAPOH BAWUL BBNVY BCNDV BENPR BFQNJ BGLVJ BHPHI BMC BPHCQ BVXVI C6C CCPQU CS3 DIK DU5 DWQXO E3Z EAD EAP EAS EBD EBLON EBS EJD EMB EMK EMOBN ESX F5P FYUFA GNUQQ GROUPED_DOAJ GX1 HCIFZ HMCUK HYE IAO ICD IHR INH INR IPNFZ ISR ITC K6V K7- KQ8 LK8 M1P M48 M7P MK~ ML0 M~E O5R O5S OK1 OVT P2P P62 PGMZT PHGZM PHGZT PIMPY PJZUB PPXIY PQGLB PQQKQ PROAC PSQYO PUEGO RBZ RIG RNS ROL RPM RSV SBL SOJ SV3 TR2 TUS UKHRP W2D WOQ WOW XH6 XSB AAYXX CITATION 123 2VQ ALIPV C1A CGR CUY CVF ECM EIF H13 NPM 3V. 7QO 7SC 7XB 8AL 8FD 8FK FR3 JQ2 K9. L7M L~C L~D M0N P64 PKEHL PQEST PQUKI Q9U 7X8 5PM ADTOC UNPAY |
| ID | FETCH-LOGICAL-c581t-a927327471f787dbf357fcf7045dc8122d4da4b39ad9ce85d0a0294fc85c09ff3 |
| IEDL.DBID | M48 |
| ISSN | 1471-2105 |
| IngestDate | Fri Oct 03 12:50:31 EDT 2025 Sun Oct 26 04:09:11 EDT 2025 Tue Sep 30 16:46:37 EDT 2025 Wed Oct 01 14:57:26 EDT 2025 Mon Oct 06 18:09:55 EDT 2025 Tue Oct 07 05:18:50 EDT 2025 Mon Jul 21 06:05:59 EDT 2025 Thu Apr 24 23:05:39 EDT 2025 Wed Oct 01 04:15:22 EDT 2025 Sat Sep 06 07:27:15 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | Suppl 17 |
| Keywords | pedigree Haplotype inference zero-recombinant haplotype configuration (ZRHC) mating loop |
| Language | English |
| License | This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. cc-by |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c581t-a927327471f787dbf357fcf7045dc8122d4da4b39ad9ce85d0a0294fc85c09ff3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 ObjectType-Article-2 ObjectType-Feature-1 content type line 23 ObjectType-Conference-3 SourceType-Conference Papers & Proceedings-2 |
| OpenAccessLink | http://journals.scholarsportal.info/openUrl.xqy?doi=10.1186/1471-2105-13-S17-S19 |
| PMID | 23281626 |
| PQID | 1237513475 |
| PQPubID | 44065 |
| ParticipantIDs | doaj_primary_oai_doaj_org_article_91ad92ad5dc14714ac51e3a442373714 unpaywall_primary_10_1186_1471_2105_13_s17_s19 pubmedcentral_primary_oai_pubmedcentral_nih_gov_3521470 proquest_miscellaneous_1273381900 proquest_miscellaneous_1257787412 proquest_journals_1237513475 pubmed_primary_23281626 crossref_citationtrail_10_1186_1471_2105_13_S17_S19 crossref_primary_10_1186_1471_2105_13_S17_S19 springer_journals_10_1186_1471_2105_13_S17_S19 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2012-00-00 |
| PublicationDateYYYYMMDD | 2012-01-01 |
| PublicationDate_xml | – year: 2012 text: 2012-00-00 |
| PublicationDecade | 2010 |
| PublicationPlace | London |
| PublicationPlace_xml | – name: London – name: England |
| PublicationTitle | BMC bioinformatics |
| PublicationTitleAbbrev | BMC Bioinformatics |
| PublicationTitleAlternate | BMC Bioinformatics |
| PublicationYear | 2012 |
| Publisher | BioMed Central Springer Nature B.V BMC |
| Publisher_xml | – name: BioMed Central – name: Springer Nature B.V – name: BMC |
| References | X Li (5483_CR11) 2008 K Zhang (5483_CR17) 2005; 21 D Gusfield (5483_CR18) 2001; 8 FYL Chin (5483_CR3) 2005 M Stephens (5483_CR20) 2001; 68 Y Yang (5483_CR22) 2002; 100 JR O'Connell (5483_CR9) 2000; 19 DD Doan (5483_CR14) 2010; 17 E Sobel (5483_CR7) 1996 E Baruch (5483_CR13) 2006; 172 T Niu (5483_CR19) 2002; 70 J Li (5483_CR4) 2003 A Thomas (5483_CR24) 2004; 21 MY Chan (5483_CR10) 2009; 38 WB Wang (5483_CR15) 2009 D Qian (5483_CR1) 2002; 70 S Wang (5483_CR21) 2003; 24 P Tapadar (5483_CR8) 2000; 50 J Xiao (5483_CR16) 2009; 38 J Li (5483_CR5) 2004 SR Browning (5483_CR23) 2011; 12 J Li (5483_CR6) 2005; 12 L Liu (5483_CR12) 2008; 19 CA Albers (5483_CR2) 2007; 177 11992251 - Am J Hum Genet. 2002 Jun;70(6):1434-45 15567888 - Math Med Biol. 2004 Dec;21(4):335-45 16361242 - Genetics. 2006 Mar;172(3):1757-65 12777616 - Proc Natl Acad Sci U S A. 2003 Jun 10;100(12):7225-30 11254454 - Am J Hum Genet. 2001 Apr;68(4):978-89 11535178 - J Comput Biol. 2001;8(3):305-23 10545757 - Hum Hered. 2000 Jan-Feb;50(1):43-56 11741196 - Am J Hum Genet. 2002 Jan;70(1):157-69 17660564 - Genetics. 2007 Oct;177(2):1101-16 21921926 - Nat Rev Genet. 2011 Oct;12(10):703-14 11055372 - Genet Epidemiol. 2000;19 Suppl 1:S64-70 16108713 - J Comput Biol. 2005 Jul-Aug;12(6):719-39 12508258 - Genet Epidemiol. 2003 Jan;24(1):74-82 15231536 - Bioinformatics. 2005 Jan 1;21(1):90-103 19642289 - Comput Syst Bioinformatics Conf. 2008;7:297-308 20937017 - J Comput Biol. 2010 Oct;17(10):1451-65 |
| References_xml | – volume: 19 start-page: 64 year: 2000 ident: 5483_CR9 publication-title: Genetic Epidemiology doi: 10.1002/1098-2272(2000)19:1+<::AID-GEPI10>3.0.CO;2-G – volume: 8 start-page: 305 issue: 3 year: 2001 ident: 5483_CR18 publication-title: Journal of Computational Biology doi: 10.1089/10665270152530863 – volume: 70 start-page: 157 year: 2002 ident: 5483_CR19 publication-title: The American Journal of Human Genetics doi: 10.1086/338446 – start-page: 20 volume-title: Proceedings of the 8th Annual Conference on Research in Computational Molecular Biology (RECOMB) year: 2004 ident: 5483_CR5 – volume: 100 start-page: 7225 year: 2002 ident: 5483_CR22 publication-title: Proceedings of the National Academy of Science of the United States of America doi: 10.1073/pnas.1237858100 – volume: 177 start-page: 1101 issue: 2 year: 2007 ident: 5483_CR2 publication-title: Genetics doi: 10.1534/genetics.107.074047 – volume: 12 start-page: 719 issue: 6 year: 2005 ident: 5483_CR6 publication-title: Journal of Computational Biology doi: 10.1089/cmb.2005.12.719 – start-page: 89 volume-title: Genetic Mapping and DNA Sequencing, Volume 81 of IMA Volumes in Mathematics and its Applications year: 1996 ident: 5483_CR7 doi: 10.1007/978-1-4612-0751-1_6 – volume: 172 start-page: 1757 issue: 3 year: 2006 ident: 5483_CR13 publication-title: Genetics doi: 10.1534/genetics.105.047134 – volume: 21 start-page: 90 year: 2005 ident: 5483_CR17 publication-title: Bioinformatics doi: 10.1093/bioinformatics/bth388 – volume: 38 start-page: 2198 year: 2009 ident: 5483_CR16 publication-title: SIAM J Comput doi: 10.1137/070687591 – start-page: 197 volume-title: Proceedings of the 7th Annual Conference on Research in Computational Molecular Biology (RECOMB) year: 2003 ident: 5483_CR4 – volume: 50 start-page: 43 year: 2000 ident: 5483_CR8 publication-title: Human Heredity doi: 10.1159/000022890 – start-page: 985 volume-title: Proceedings of the International Conference on Computational Science (ICCS) year: 2005 ident: 5483_CR3 – volume: 19 start-page: 217 year: 2008 ident: 5483_CR12 publication-title: Journal of Combinatorial Optimization doi: 10.1007/s10878-008-9180-y – start-page: 353 volume-title: CPM 2009, LNCS 5577 year: 2009 ident: 5483_CR15 – volume: 70 start-page: 1434 issue: 6 year: 2002 ident: 5483_CR1 publication-title: The American Journal of Human Genetics doi: 10.1086/340610 – volume: 21 start-page: 335 issue: 4 year: 2004 ident: 5483_CR24 publication-title: Math Med Biol doi: 10.1093/imammb/21.4.335 – volume: 38 start-page: 2179 issue: 6 year: 2009 ident: 5483_CR10 publication-title: SIAM J Comput doi: 10.1137/080680990 – volume: 17 start-page: 1451 issue: 10 year: 2010 ident: 5483_CR14 publication-title: J Comput Biol doi: 10.1089/cmb.2009.0133 – volume: 12 start-page: 703 year: 2011 ident: 5483_CR23 publication-title: Nature Reviews Genetics doi: 10.1038/nrg3054 – start-page: 297 volume-title: 7th Annual International conference on Computational Systems Bioinformatics year: 2008 ident: 5483_CR11 doi: 10.1142/9781848162648_0026 – volume: 68 start-page: 978 issue: 4 year: 2001 ident: 5483_CR20 publication-title: The American Journal of Human Genetics doi: 10.1086/319501 – volume: 24 start-page: 74 year: 2003 ident: 5483_CR21 publication-title: Genetic Epidemiology doi: 10.1002/gepi.10195 – reference: 16108713 - J Comput Biol. 2005 Jul-Aug;12(6):719-39 – reference: 19642289 - Comput Syst Bioinformatics Conf. 2008;7:297-308 – reference: 12508258 - Genet Epidemiol. 2003 Jan;24(1):74-82 – reference: 11254454 - Am J Hum Genet. 2001 Apr;68(4):978-89 – reference: 16361242 - Genetics. 2006 Mar;172(3):1757-65 – reference: 12777616 - Proc Natl Acad Sci U S A. 2003 Jun 10;100(12):7225-30 – reference: 20937017 - J Comput Biol. 2010 Oct;17(10):1451-65 – reference: 10545757 - Hum Hered. 2000 Jan-Feb;50(1):43-56 – reference: 15567888 - Math Med Biol. 2004 Dec;21(4):335-45 – reference: 21921926 - Nat Rev Genet. 2011 Oct;12(10):703-14 – reference: 17660564 - Genetics. 2007 Oct;177(2):1101-16 – reference: 11535178 - J Comput Biol. 2001;8(3):305-23 – reference: 11055372 - Genet Epidemiol. 2000;19 Suppl 1:S64-70 – reference: 11741196 - Am J Hum Genet. 2002 Jan;70(1):157-69 – reference: 11992251 - Am J Hum Genet. 2002 Jun;70(6):1434-45 – reference: 15231536 - Bioinformatics. 2005 Jan 1;21(1):90-103 |
| SSID | ssj0017805 |
| Score | 2.0354602 |
| Snippet | Background
When studying genetic diseases in which genetic variations are passed on to offspring, the ability to distinguish between paternal and maternal... When studying genetic diseases in which genetic variations are passed on to offspring, the ability to distinguish between paternal and maternal alleles is... Doc number: S19 Abstract Background: When studying genetic diseases in which genetic variations are passed on to offspring, the ability to distinguish between... Background: When studying genetic diseases in which genetic variations are passed on to offspring, the ability to distinguish between paternal and maternal... Abstract Background When studying genetic diseases in which genetic variations are passed on to offspring, the ability to distinguish between paternal and... |
| SourceID | doaj unpaywall pubmedcentral proquest pubmed crossref springer |
| SourceType | Open Website Open Access Repository Aggregation Database Index Database Enrichment Source Publisher |
| StartPage | S19 |
| SubjectTerms | Algorithms Alleles Bioinformatics Biomedical and Life Sciences Child Computational Biology/Bioinformatics Computer Appl. in Life Sciences Computer applications Computer programs Computer Simulation Computers Conferences Data processing Families & family life Genetic Diseases, Inborn - genetics Genetic disorders Genetic diversity Genetic Variation Genetics Genomes Genotype Genotypes Haplotype inference Haplotypes Heredity Humans Life Sciences Mating mating loop Microarrays Models, Genetic Mutation Offspring Pedigree Proceedings Progeny Recombination, Genetic Studies zero-recombinant haplotype configuration (ZRHC) |
| SummonAdditionalLinks | – databaseName: DOAJ Directory of Open Access Journals dbid: DOA link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3fa9swEBajMLY9jP2u225osFe1ki3Z1mM3Vspge-kKfROSJSWB1A5pwuj--t3JjknYSF8GyYt8CdLdSfrOOn1HyCdbQ_DfRM0ASzsmayeYFXXJhFMSoo1KxpRV-f1HeXktv92om61SX5gT1tMD94o708J6nVuvfCNgIZW2USIUVmI6B7LN4erLa70JpobzA2TqT_eKKsEgqFHDpTnoxdnYxkTBrmCNvkKWna1NKXH3_wtw_p03OR6ePiNP1u3C3v-y8_nW_nTxgjwfgCU97wf0kjwK7SvyuC81ef-a2HOKgNIuGVaTp3Y-6Zaz1fSWAmilKSoemGTbCf0dlh3DtluX8mTo1C7mHb6spSAXZ5N17zYUPpYuYPuDoD28IdcXX39-uWRDeQXWqFqsmNUAXVJQGmHWehcLVcUmVgDyfAP7fu6lt9IVGgyAxU09tzzXMja1ariOsXhLDtquDYeEOpcHHaXjjeeA8HgddJlH53zQrnC8zEix0a9pBu5xLIExNykGqUuDVjFoFSMKA1aBr84IG3-16Lk3HpD_jKYbZZE5OzWAP5nBn8xD_pSRk43hzTCd7wxs75XCS7cqIx_HxzAR8XTFtqFbo4yqQI9S5PtkqgJDZM4z8q73pbG3AG1rAeFlRqodL9sZzu6TdjZNhOAAomEs8J-nG3_c6vpehZ2OXrtfw3cCia310f_Q8DF5Cqgz799jnZAD8O7wHpDdyn1Ik_gPglxEqg priority: 102 providerName: Directory of Open Access Journals – databaseName: ProQuest Central dbid: BENPR link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwhV3da9RAEB_qFVEfxO9Gq6zg67bZZPOxDyKttBTBQ6yFvoXdbPaukCbxekepf70z-fIO5YTkJZmE3Z2Z3d_sx28APugUg__cKY5Y2nCZGsG1SGMuTCQx2kika3dVfp3GZxfyy2V0uQPT4SwMbasc-sS2o7Z1TnPkh9jDJhGde4w-NT85ZY2i1dUhhYbuUyvYjy3F2D3YDYgZawK7xyfTb9_HdQVi8O8P0GGJDgV2zRzlIi5Cfo799Tkx7qwNUC2P_7_A5997KMeF1EfwYFU1-u5Wl-XaWHX6BB73IJMddVbxFHaK6hnc79JO3j0HfcQIXOoFp8zyTJczrOhyfs0QwLI2Qu5ZZasZ-1Usak7Prk27Z4bNdVPWNHHLUM5dzVadCTG8NGtwKMQAvngBF6cnPz6f8T7VAs-jVCy5Vghj2gDVoQdb48IocblLEPDZHDFAYKXV0oRKW0WJTq2v_UBJl6dR7ivnwpcwqeqq2ANmTFAoJ42fWx_Rnp8WKg6cMbZQJjR-7EE4tG-W9zzklA6jzNp4JI0z0kpGWslEmKFW8FYe8PGrpuPh-I_8MalulCUW7fZBvZhlvVNmSmB1Am2xjvQPqfNIFKGWtFWImAw92B8Un_WufZP9MUQP3o-v0SlppUVXRb0imSjBdpQi2CaThBQu-74HrzpbGkuLMDcVGGp6kGxY2UZ1Nt9UV_OWHBwBNdYF_3kw2ONa0bc22MFotdtb-EYQybV6vb1x3sBDxJZBN1u1DxO02-It4reledc75W9bK0Ga priority: 102 providerName: ProQuest – databaseName: Springer Nature OA Free Journals (WRLC) dbid: C6C link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1Nb9QwEB1VRQg4IL4JFGQkjrjEiZ3Ex1JRVUhwKZV6s-zE3q2UJqu2K9T--s442WhXwCKk3UsyTmLPOPNexp4B-GgrJP910ByxtOOycoJbURVcOCWRbZQyxFWV338Ux6fy25k624FPq70w6_F7bPNZ4MuTIy1RXOT8BN-oJ5Tj8x66qSKGZovDKWZA2fnHzXF_a7nhfGKO_j8By9_XR05B0kfwYNkt7M0v27ZrfujoCTweASQ7GDT-FHZ89wzuDyUlb56DPWAEHO0lp6rxzLazHun__IIhOGWR_Y4ZY7sZu_WXPadjFy6uh2Fzu2h7-ijLUC6cz5aDeTD8WbZAN4fk3L-A06OvPw-P-VhGgdeqEtfcaoQokXwGnJ2NC7kqQx1KBHNNjf49a2Rjpcu1bTQVMW1Sm2ZahrpSdapDyF_Cbtd3_jUw5zKvg3Rp3aSI5NLK6yILzjVeu9ylRQL5anxNPeYYp1IXrYlcoyoMacWQVozIDWoF_zoBPrVaDDk2_iH_hVQ3yVKG7HgADceME85ogd3JbIN9pGtIWyvhcytpGRBlKUxgb6V4M07bK4NuvFS0uVYl8GE6jROOoii28_2SZFSJ4yhFtk2mzIkKp2kCrwZbmp4WIWwlkEYmUG5Y2UZ3Ns905_OY-BvBMvYFr7m_sse1R986YPuT1W4f4StBCaz1m_-9w1t4iEgyG75N7cEuWrJ_h2jt2r2Pk_QOj3M05A priority: 102 providerName: Springer Nature – databaseName: Unpaywall dbid: UNPAY link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3da9swEBclZWx72PeHt25osFe5li3Z1mM2VspgZdAGuicjyVIS6tjBiSntX9-T7ZhkHRmDgf1in2zrfDr9ztb9DqHPMoXgX1tBAEsrwlJFiaRpTKjiDKKNhNl2VeWPs_h0wr5f8ssDdLHJhVELreZVTxrqiIr97TT0ostycFUUTH28zG036NP4mIKTJRC-cEIjcg6e99xxgR7GHBD6CB1Ozn6Of7WJRr1Yn0V3r-kKmq4c7c7WLNWS-f8Jgd5fSDn8TX2MHjblUt5cy6LYmrBOnqJm09VuncqV36yVr29_Y4H837p4hp70CBePO5N8jg5M-QI96Gpe3rxEcowdspU1cWXtsSymVT1fzxYY7o_b8LyntC2n-NbUFXHHFqpdsINncllU7qsxBjk7nzad_WLYJF7CPDytjXmFJiffLr6ekr7OA9E8pWsiBWCoNjq24D5yZSOeWG0TQJu5BgAS5iyXTEVC5sJVWc0DGYSCWZ1yHQhro9doVFaleYuwUqERlqlA5wFAzSA1Ig6tUrkRKlJB7KFo814z3ZOgu1ocRdYGQ2mcOeVlTnkZjTJQHuzCQ2RotexIQP4i_8WZzCDrKLzbA1U9zXqPkAkK3QllDn1012BSc2oiydw6JUej6KGjjcFlvV9ZZYAzEu6yf7mHPg2nwSO43zyyNFXjZHgCemQ03CeTRC5WDwIPvelseHhawNgphTjXQ8mOde90Z_dMOZ-1zOSA5qEvcE1_Mw62Hn2vwvxhtOzXMIxP2MW7f23wHj0CqBt2H8-O0Ags2XwAOLlWH3vvcAfv2m5A priority: 102 providerName: Unpaywall |
| Title | A linear-time algorithm for reconstructing zero-recombinant haplotype configuration on a pedigree |
| URI | https://link.springer.com/article/10.1186/1471-2105-13-S17-S19 https://www.ncbi.nlm.nih.gov/pubmed/23281626 https://www.proquest.com/docview/1237513475 https://www.proquest.com/docview/1257787412 https://www.proquest.com/docview/1273381900 https://pubmed.ncbi.nlm.nih.gov/PMC3521470 https://bmcbioinformatics.biomedcentral.com/counter/pdf/10.1186/1471-2105-13-S17-S19 https://doaj.org/article/91ad92ad5dc14714ac51e3a442373714 |
| UnpaywallVersion | publishedVersion |
| Volume | 13 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVADU databaseName: BioMed Central Open Access Free customDbUrl: eissn: 1471-2105 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: RBZ dateStart: 20000101 isFulltext: true titleUrlDefault: https://www.biomedcentral.com/search/ providerName: BioMedCentral – providerCode: PRVAFT databaseName: Open Access Digital Library customDbUrl: eissn: 1471-2105 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: KQ8 dateStart: 20000101 isFulltext: true titleUrlDefault: http://grweb.coalliance.org/oadl/oadl.html providerName: Colorado Alliance of Research Libraries – providerCode: PRVAFT databaseName: Open Access Digital Library customDbUrl: eissn: 1471-2105 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: KQ8 dateStart: 20000701 isFulltext: true titleUrlDefault: http://grweb.coalliance.org/oadl/oadl.html providerName: Colorado Alliance of Research Libraries – providerCode: PRVAON databaseName: DOAJ Directory of Open Access Journals customDbUrl: eissn: 1471-2105 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: DOA dateStart: 20000101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVEBS databaseName: Academic Search Ultimate customDbUrl: https://search.ebscohost.com/login.aspx?authtype=ip,shib&custid=s3936755&profile=ehost&defaultdb=asn eissn: 1471-2105 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: ABDBF dateStart: 20000101 isFulltext: true titleUrlDefault: https://search.ebscohost.com/direct.asp?db=asn providerName: EBSCOhost – providerCode: PRVEBS databaseName: Inspec with Full Text customDbUrl: eissn: 1471-2105 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: ADMLS dateStart: 20000101 isFulltext: true titleUrlDefault: https://www.ebsco.com/products/research-databases/inspec-full-text providerName: EBSCOhost – providerCode: PRVBFR databaseName: Free Medical Journals customDbUrl: eissn: 1471-2105 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: DIK dateStart: 20000101 isFulltext: true titleUrlDefault: http://www.freemedicaljournals.com providerName: Flying Publisher – providerCode: PRVFQY databaseName: GFMER Free Medical Journals customDbUrl: eissn: 1471-2105 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: GX1 dateStart: 0 isFulltext: true titleUrlDefault: http://www.gfmer.ch/Medical_journals/Free_medical.php providerName: Geneva Foundation for Medical Education and Research – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 1471-2105 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: M~E dateStart: 20000101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre – providerCode: PRVAQN databaseName: PubMed Central customDbUrl: eissn: 1471-2105 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: RPM dateStart: 20000101 isFulltext: true titleUrlDefault: https://www.ncbi.nlm.nih.gov/pmc/ providerName: National Library of Medicine – providerCode: PRVPQU databaseName: Health & Medical Collection customDbUrl: eissn: 1471-2105 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: 7X7 dateStart: 20090101 isFulltext: true titleUrlDefault: https://search.proquest.com/healthcomplete providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: http://www.proquest.com/pqcentral?accountid=15518 eissn: 1471-2105 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: BENPR dateStart: 20090101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Technology Collection customDbUrl: eissn: 1471-2105 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: 8FG dateStart: 20090101 isFulltext: true titleUrlDefault: https://search.proquest.com/technologycollection1 providerName: ProQuest – providerCode: PRVFZP databaseName: Scholars Portal Journals: Open Access customDbUrl: eissn: 1471-2105 dateEnd: 20250131 omitProxy: true ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: M48 dateStart: 20000701 isFulltext: true titleUrlDefault: http://journals.scholarsportal.info providerName: Scholars Portal – providerCode: PRVAVX databaseName: HAS SpringerNature Open Access 2022 customDbUrl: eissn: 1471-2105 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: AAJSJ dateStart: 20001201 isFulltext: true titleUrlDefault: https://www.springernature.com providerName: Springer Nature – providerCode: PRVAVX databaseName: Springer Nature OA Free Journals customDbUrl: eissn: 1471-2105 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: C6C dateStart: 20000112 isFulltext: true titleUrlDefault: http://www.springeropen.com/ providerName: Springer Nature |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1ba9swFBa9MLY-jN3nrQsa7FWZZcsXPYyRhmYl0FCWBbInI9lWUnCdNE3osl-_c2THa1iXDRwHJFn43Kzv6HIOIR9UDM5_aiQDLK2ZiDVnisch4zoQ4G1EwthdleeD8Gwk-uNgvEc2C-01A2_ude0wn9RoUbR_XK8_g8F_sgYfhx85fGAZuC4B4z4bwld3CFY4v2aYWgqXYOs8G_vkEIYvifkdzsXvpQYM6m-PINWd1Ofr_tbx1vhlw_zfh03_3GLZrLMekYercq7Wt6oo7gxlvSfkcY1BaadSmqdkLy-fkQdVVsr1c6I6FLGnWjBMPE9VMQESl9MrCviWWge6DjpbTujPfDFjWHal7ZYaOlXzYobzuhTamcvJqtIwCpeicxgpwb_PX5BR7_Rb94zVmRhYGsR8yZQElGP9VwMGnmnjB5FJTQR4MEsBIniZyJTQvlSZxDyomatcTwqTxkHqSmP8l-SgnJX5a0K19nJphHbTzAUw6Ma5DD2jdZZL7Ws3dIi_4W-S1mHKMVtGkVh3JQ4TlEqCUkm4n4BU4Ccdwpqn5lWYjn-0P0HRNW0xyLYtmC0mSW2zieRAjqcyoBH7ECoNeO4rgTuJMNChQ443gk82ipsAEogCPJ8bOOR9Uw02iwsxqsxnK2wTRMBHwb1dbSIfvWnXdcirSpeatwUUHHPwRB0SbWnZFjnbNeXl1MYOB7wNtECf7Y0-3nn1nQxrN1q7m8M3HGNgyzf_Qdlb8gjwp1fNaB2TA1De_B1gvKVukf1oHME97n1pkcNOpz_sw__J6eDiK5R2w27Lzp60rC1DzWhw0fn-C1qeUnY |
| linkProvider | Scholars Portal |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9QwEB6VIlQ4IN4EChgJjm7jxNnEB4TKo9rSx6Wt1FuwE3u30jZZ9qFq-VH8RmbyYleg5VQpe0km3nhmPPONHzMA73SCwX_mFEcsbbhMjOBaJD0uTCQx2oilq3ZVHp_0-ufy20V0sQG_2rMwtK2ytYmVoc7LjObId9HCxhGde4w-jn9wqhpFq6ttCY1aLQ7t4hpDtumHgy8o3_dBsP_17HOfN1UFeBYlYsa1Qo9dxWIOlTU3Loxil7kYsU2eobsLcplraUKlc0U1PXNf-4GSLkuizFfOhdjuLbgtQ7QlOH7iiy7AE1QfoDmeh_3dFfgfHEOqiIuQn6I3OKV8Pkvur6oS8C9o-_cOzW6Z9h5szYuxXlzr0WjJE-4_gPsNhGV7tc49hA1bPII7dVHLxWPQe4ygq55wqlvP9GiAbJwNrxjCY1bF303O2mLAftpJyenelal25LChHo9KmhZmSOcuB_NaQRlemo3R0Q4m1j6B8xth-VPYLMrCPgdmTGCVk8bPch-xpJ9Y1QucMblVJjR-z4Ow5W-aNVnOqdjGKK2inaSXklRSkkoqwhSlgj_lAe_eGtdZPv5D_4lE19FSju7qRjkZpM2QT5XA7gQ6xz5SG1JnkbChlrQRifIkerDdCj5tDMc0_aPmHrztHuOQp3UcXdhyTjRRjHyUIlhHE4cUjPu-B89qXeq-FkF0IjCQ9SBe0bKV7qw-KS6HVepxhOvYF2xzp9XHpU9fy7CdTmvXc3gqKIW2erGeOW9gq392fJQeHZwcvoS7iGKDel5sGzZRh-0rRIoz87oangy-37Q9-A0WB3g7 |
| linkToPdf | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1bb9MwFLbQEJc9IO4EBhiJV7M4sZP4cRSqcZuQxqS9WXZst5WypOpaTePXc06SRq2AIqTkJXEuPpec78T2dwh5awpI_sugGGBpy0RhOTO8yBi3UkC2kYvQzqr8dpIdn4nP5_J8Yy1MO9t9PSTZrWlAlqZ6eTh3oXPxIjvk8EllkKxIxlN2Ct_ZU2T-vCkgvmEVg1E2GkYSkLO_XzL3tyu3QlLL3P8nuPn7rMlh6HSf3FnVc3N9ZapqIzqN75N7PaykR50dPCA3fP2Q3OoKTV4_IuaIIpw0C4a15KmpJs1itpxeUICstM2Jex7ZekJ_-kXD8NiFbWfJ0KmZVw3-qqXQLswmq85oKGyGziH4QcruH5Oz8ccfo2PWF1dgpSz4khkFwKVNSQP4rLMhlXkoQw4Qz5UgxsQJZ4RNlXEKS5u62MSJEqEsZBmrENInZK9uav-MUGsTr4KwceliwHdx4VWWBGudVza1cRaRdC1fXfbM41gAo9JtBlJkGrWiUSuapxq0AruKCBuumnfMG_9o_x5VN7RF3uz2QLOY6N4NteLQncQ46CPeQ5hScp8agZODkLswIgdrxevemS81BPdc4pJbGZE3w2lwQxxbMbVvVthG5iBHwZNdbfIUE-Q4jsjTzpaGtwVgW3BILiOSb1nZVne2z9SzaUsHDhAa-gL3HPxm49V3CuzdYLW7JXzJkdZaPf_fJ7wmt79_GOuvn06-vCB3AWom3c-rA7IHRu1fApxb2letv_4COOJAGg |
| linkToUnpaywall | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3da9swEBclZWx72PeHt25osFe5li3Z1mM2VspgZdAGuicjyVIS6tjBiSntX9-T7ZhkHRmDgf1in2zrfDr9ztb9DqHPMoXgX1tBAEsrwlJFiaRpTKjiDKKNhNl2VeWPs_h0wr5f8ssDdLHJhVELreZVTxrqiIr97TT0ostycFUUTH28zG036NP4mIKTJRC-cEIjcg6e99xxgR7GHBD6CB1Ozn6Of7WJRr1Yn0V3r-kKmq4c7c7WLNWS-f8Jgd5fSDn8TX2MHjblUt5cy6LYmrBOnqJm09VuncqV36yVr29_Y4H837p4hp70CBePO5N8jg5M-QI96Gpe3rxEcowdspU1cWXtsSymVT1fzxYY7o_b8LyntC2n-NbUFXHHFqpdsINncllU7qsxBjk7nzad_WLYJF7CPDytjXmFJiffLr6ekr7OA9E8pWsiBWCoNjq24D5yZSOeWG0TQJu5BgAS5iyXTEVC5sJVWc0DGYSCWZ1yHQhro9doVFaleYuwUqERlqlA5wFAzSA1Ig6tUrkRKlJB7KFo814z3ZOgu1ocRdYGQ2mcOeVlTnkZjTJQHuzCQ2RotexIQP4i_8WZzCDrKLzbA1U9zXqPkAkK3QllDn1012BSc2oiydw6JUej6KGjjcFlvV9ZZYAzEu6yf7mHPg2nwSO43zyyNFXjZHgCemQ03CeTRC5WDwIPvelseHhawNgphTjXQ8mOde90Z_dMOZ-1zOSA5qEvcE1_Mw62Hn2vwvxhtOzXMIxP2MW7f23wHj0CqBt2H8-O0Ags2XwAOLlWH3vvcAfv2m5A |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+linear-time+algorithm+for+reconstructing+zero-recombinant+haplotype+configuration+on+a+pedigree&rft.jtitle=BMC+bioinformatics&rft.au=Lai%2C+En-Yu&rft.au=Wang%2C+Wei-Bung&rft.au=Jiang%2C+Tao&rft.au=Wu%2C+Kun-Pin&rft.date=2012&rft.issn=1471-2105&rft.eissn=1471-2105&rft.volume=13+Suppl+17&rft.spage=S19&rft_id=info:doi/10.1186%2F1471-2105-13-S17-S19&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1471-2105&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1471-2105&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1471-2105&client=summon |