HTML Microdata document

This HTML5 document contains 39 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

Prefix	IRI
dcterms	http://purl.org/dc/terms/
dbo	http://dbpedia.org/ontology/
foaf	http://xmlns.com/foaf/0.1/
n10	https://global.dbpedia.org/id/
dbt	http://dbpedia.org/resource/Template:
rdfs	http://www.w3.org/2000/01/rdf-schema#
freebase	http://rdf.freebase.com/ns/
rdf	http://www.w3.org/1999/02/22-rdf-syntax-ns#
owl	http://www.w3.org/2002/07/owl#
wikipedia-en	http://en.wikipedia.org/wiki/
dbp	http://dbpedia.org/property/
dbc	http://dbpedia.org/resource/Category:
prov	http://www.w3.org/ns/prov#
xsdh	http://www.w3.org/2001/XMLSchema#
gold	http://purl.org/linguistics/gold/
wikidata	http://www.wikidata.org/entity/
dbr	http://dbpedia.org/resource/

Statements

Subject Item: dbr:Joseph_Felsenstein
dbo:wikiPageWikiLink: dbr:Felsenstein's_tree-pruning_algorithm
dbp:knownFor: dbr:Felsenstein's_tree-pruning_algorithm
dbo:knownFor: dbr:Felsenstein's_tree-pruning_algorithm

Subject Item: dbr:Ancestral_reconstruction
dbo:wikiPageWikiLink: dbr:Felsenstein's_tree-pruning_algorithm

Subject Item: dbr:Felsenstein's_tree-pruning_algorithm
rdf:type: dbo:Software
rdfs:label: Felsenstein's tree-pruning algorithm
rdfs:comment: In statistical genetics, Felsenstein's tree-pruning algorithm (or Felsenstein's tree-peeling algorithm), attributed to Joseph Felsenstein, is an algorithm for computing the likelihood of an evolutionary tree from nucleic acid sequence data. The algorithm is often used as a subroutine in a search for a maximum likelihood estimate for an evolutionary tree. Further, it can be used in a hypothesis test for whether evolutionary rates are constant (by using likelihood ratio tests). It can also be used to provide error estimates for the parameters describing an evolutionary tree.
dcterms:subject: dbc:Statistical_genetics
dbo:wikiPageID: 17441873
dbo:wikiPageRevisionID: 1065079084
dbo:wikiPageWikiLink: dbr:Evolutionary_tree dbr:Likelihood dbr:Nucleic_acid dbr:Algorithm dbr:Maximum_likelihood dbr:Joe_Felsenstein dbc:Statistical_genetics dbr:Likelihood_ratio_test dbr:Statistical_genetics
owl:sameAs: freebase:m.04g0ltg n10:4jGp5 wikidata:Q5442616
dbp:wikiPageUsesTemplate: dbt:Statistics-stub dbt:Short_description dbt:Reflist dbt:Genetics-stub
dbo:abstract: In statistical genetics, Felsenstein's tree-pruning algorithm (or Felsenstein's tree-peeling algorithm), attributed to Joseph Felsenstein, is an algorithm for computing the likelihood of an evolutionary tree from nucleic acid sequence data. The algorithm is often used as a subroutine in a search for a maximum likelihood estimate for an evolutionary tree. Further, it can be used in a hypothesis test for whether evolutionary rates are constant (by using likelihood ratio tests). It can also be used to provide error estimates for the parameters describing an evolutionary tree.
gold:hypernym: dbr:Algorithm
prov:wasDerivedFrom: wikipedia-en:Felsenstein's_tree-pruning_algorithm?oldid=1065079084&ns=0
dbo:wikiPageLength: 1510
foaf:isPrimaryTopicOf: wikipedia-en:Felsenstein's_tree-pruning_algorithm

Subject Item: dbr:Felsenstein's_tree_pruning_algorithm
dbo:wikiPageWikiLink: dbr:Felsenstein's_tree-pruning_algorithm
dbo:wikiPageRedirects: dbr:Felsenstein's_tree-pruning_algorithm

Subject Item: dbr:Felsenstein's_Tree_Peeling_Algorithm
dbo:wikiPageWikiLink: dbr:Felsenstein's_tree-pruning_algorithm
dbo:wikiPageRedirects: dbr:Felsenstein's_tree-pruning_algorithm

Subject Item: dbr:List_of_statistics_articles
dbo:wikiPageWikiLink: dbr:Felsenstein's_tree-pruning_algorithm

Subject Item: dbr:Felsenstein's_tree_peeling_algorithm
dbo:wikiPageWikiLink: dbr:Felsenstein's_tree-pruning_algorithm
dbo:wikiPageRedirects: dbr:Felsenstein's_tree-pruning_algorithm

Subject Item: wikipedia-en:Felsenstein's_tree-pruning_algorithm
foaf:primaryTopic: dbr:Felsenstein's_tree-pruning_algorithm