About: Lander–Green algorithm

An Entity of Type: software, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

The Lander–Green algorithm is an algorithm, due to Eric Lander and for computing the likelihood of observed genotype data given a pedigree. It is appropriate for relatively small pedigrees and a large number of markers. It is used in the analysis of genetic linkage.

Property Value
dbo:abstract
  • The Lander–Green algorithm is an algorithm, due to Eric Lander and for computing the likelihood of observed genotype data given a pedigree. It is appropriate for relatively small pedigrees and a large number of markers. It is used in the analysis of genetic linkage. (en)
dbo:wikiPageID
  • 17440858 (xsd:integer)
dbo:wikiPageLength
  • 1161 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 798588140 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
gold:hypernym
rdf:type
rdfs:comment
  • The Lander–Green algorithm is an algorithm, due to Eric Lander and for computing the likelihood of observed genotype data given a pedigree. It is appropriate for relatively small pedigrees and a large number of markers. It is used in the analysis of genetic linkage. (en)
rdfs:label
  • Lander–Green algorithm (en)
rdfs:seeAlso
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License