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

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

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
n19http://dbpedia.org/resource/File:
foafhttp://xmlns.com/foaf/0.1/
n7https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
n12http://commons.wikimedia.org/wiki/Special:FilePath/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
dbpedia-ithttp://it.dbpedia.org/resource/
wikipedia-enhttp://en.wikipedia.org/wiki/
dbphttp://dbpedia.org/property/
provhttp://www.w3.org/ns/prov#
dbchttp://dbpedia.org/resource/Category:
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
goldhttp://purl.org/linguistics/gold/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Historical_glottometry
dbo:wikiPageWikiLink
dbr:Neighbor-net
Subject Item
dbr:Quantitative_comparative_linguistics
dbo:wikiPageWikiLink
dbr:Neighbor-net
Subject Item
dbr:Neighbor-net
rdf:type
dbo:Software
rdfs:label
Neighbor-net Neighbor-net
rdfs:comment
NeighborNet is an algorithm for constructing phylogenetic networks which is loosely based on the neighbor joining algorithm. Like neighbor joining, the method takes a distance matrix as input, and works by agglomerating clusters. However, the NeighborNet algorithm can lead to collections of clusters which overlap and do not form a hierarchy, and are represented using a type of phylogenetic network called a splits graph. If the distance matrix satisfies the Kalmanson combinatorial conditions then Neighbor-net will return the corresponding circular ordering. The method is implemented in the SplitsTree and R/Phangorn packages. Neighbor-net (anche NeighborNet) è un algoritmo utilizzato per costruire alberi filogenetici, liberamente ispirato sull'algoritmo "neighbor joining". Come quest'ultimo, il metodo prende una matrice di distanza come input e lavora attraverso agglomeramenti di cluster. Tuttavia l'algoritmo neighbor-net può restituire delle collezioni di cluster che si sovrappongono e che non formano una gerarchia. Queste collezioni sono rappresentate usando un tipo di rete filogenetica chiamato "split network". Se la distanza della matrice soddisfa le condizioni combinatorie di Kalmanson, il neighbor-net restituisce il corrispondente ordine circolare. Il metodo è implementato dal software SplitsTree.
foaf:depiction
n12:Heterobranchia_tree.png
dcterms:subject
dbc:Computational_phylogenetics dbc:Genetics_software dbc:Molecular_biology
dbo:wikiPageID
35989789
dbo:wikiPageRevisionID
1077633995
dbo:wikiPageWikiLink
dbr:SplitsTree dbr:Quantitative_comparative_linguistics dbr:Distance_matrix dbr:Hierarchy_(mathematics) dbr:R_(programming_language) dbr:Neighbor_joining dbr:Kalmanson_combinatorial_conditions dbc:Computational_phylogenetics dbr:Split_graph dbc:Genetics_software dbr:Phylogenetic_network n19:Heterobranchia_tree.png dbc:Molecular_biology
owl:sameAs
dbpedia-it:Neighbor-net n7:4sFq9 freebase:m.0j_6zh_ wikidata:Q6987996
dbp:wikiPageUsesTemplate
dbt:Reflist dbt:Bioinformatics-stub dbt:Technical
dbo:thumbnail
n12:Heterobranchia_tree.png?width=300
dbo:abstract
NeighborNet is an algorithm for constructing phylogenetic networks which is loosely based on the neighbor joining algorithm. Like neighbor joining, the method takes a distance matrix as input, and works by agglomerating clusters. However, the NeighborNet algorithm can lead to collections of clusters which overlap and do not form a hierarchy, and are represented using a type of phylogenetic network called a splits graph. If the distance matrix satisfies the Kalmanson combinatorial conditions then Neighbor-net will return the corresponding circular ordering. The method is implemented in the SplitsTree and R/Phangorn packages. Examples of the application of Neighbor-net can be found in virology, horticulture, dinosaur genetics, comparative linguistics, and archaeology. Neighbor-net (anche NeighborNet) è un algoritmo utilizzato per costruire alberi filogenetici, liberamente ispirato sull'algoritmo "neighbor joining". Come quest'ultimo, il metodo prende una matrice di distanza come input e lavora attraverso agglomeramenti di cluster. Tuttavia l'algoritmo neighbor-net può restituire delle collezioni di cluster che si sovrappongono e che non formano una gerarchia. Queste collezioni sono rappresentate usando un tipo di rete filogenetica chiamato "split network". Se la distanza della matrice soddisfa le condizioni combinatorie di Kalmanson, il neighbor-net restituisce il corrispondente ordine circolare. Il metodo è implementato dal software SplitsTree.
gold:hypernym
dbr:Algorithm
prov:wasDerivedFrom
wikipedia-en:Neighbor-net?oldid=1077633995&ns=0
dbo:wikiPageLength
4780
foaf:isPrimaryTopicOf
wikipedia-en:Neighbor-net
Subject Item
dbr:SplitsTree
dbo:wikiPageWikiLink
dbr:Neighbor-net
Subject Item
dbr:NeighborNet
dbo:wikiPageWikiLink
dbr:Neighbor-net
dbo:wikiPageRedirects
dbr:Neighbor-net
Subject Item
wikipedia-en:Neighbor-net
foaf:primaryTopic
dbr:Neighbor-net