Not checked for notices yet.

Assessment of the performance of hidden Markov models for imputation in animal breeding

Andrew Whalen, Gregor Gorjanc, Roger Ros-Freixedes and 1 more

Genetics Selection Evolution · 2018

doi:10.1186/s12711-018-0416-8

References 28

1.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
2.
A Flexible and Accurate Genotype Imputation Method for the Next Generation of Genome-Wide Association Studies · 2009
No notice
3.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
4.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
5.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
6.
A new approach for efficient genotype imputation using information from relatives · 2014
No notice
7.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
8.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
9.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
10.
A General Approach for Haplotype Phasing across the Full Spectrum of Relatedness · 2014
No notice
11.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
12.
Accuracy of Predicting the Genetic Risk of Disease Using a Genome-Wide Approach · 2008
No notice
13.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
14.
High-resolution haplotype block structure in the cattle genome · 2009
No notice
15.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
16.
Efficient haplotype matching and storage using the positional Burrows–Wheeler transform (PBWT) · 2014
No notice
17.
A phasing and imputation method for pedigreed populations that results in a single-stage genomic evaluation · 2012
No notice
18.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
19.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
20.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
21.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
22.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
23.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
24.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
25.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
26.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
27.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
28.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.