A fast Newton–Raphson based iterative algorithm for large scale optimal contribution selection

Binyam S. Dagnachew, Theo H. E. Meuwissen

Open source

DOI
10.1186/s12711-016-0249-2
Published
2016-09-20
Container
Genetics Selection Evolution
Publisher
Springer Science and Business Media LLC
Open access
unknown

Credibility signals

uncertain Score 64/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.1186/s12711-016-0249-2,
  title = {A fast Newton–Raphson based iterative algorithm for large scale optimal contribution selection},
  author = {Binyam S. Dagnachew and Theo H. E. Meuwissen},
  year = {2016},
  journal = {Genetics Selection Evolution},
  doi = {10.1186/s12711-016-0249-2},
  url = {https://doi.org/10.1186/s12711-016-0249-2}
}

RIS

TY  - JOUR
TI  - A fast Newton–Raphson based iterative algorithm for large scale optimal contribution selection
AU  - Binyam S. Dagnachew
AU  - Theo H. E. Meuwissen
PY  - 2016
JO  - Genetics Selection Evolution
DO  - 10.1186/s12711-016-0249-2
UR  - https://doi.org/10.1186/s12711-016-0249-2
ER  - 

APA

Dagnachew, B. S., & Meuwissen, T. H. E. (2016). A fast Newton–Raphson based iterative algorithm for large scale optimal contribution selection. Genetics Selection Evolution. https://doi.org/10.1186/s12711-016-0249-2

Source records