Date: Sat, 28 May 2022 06:56:21 +0300 (EEST) Message-ID: <868260277.7794.1653710181808@wiki-1.it.helsinki.fi> Subject: Exported From Confluence MIME-Version: 1.0 Content-Type: multipart/related; boundary="----=_Part_7793_2147445076.1653710181808" ------=_Part_7793_2147445076.1653710181808 Content-Type: text/html; charset=UTF-8 Content-Transfer-Encoding: quoted-printable Content-Location: file:///C:/exported.html NeighborNet

# NeighborNet

The NeighborNet algorithm is an algorithm based on neighbour joining to const= ruct phylogenetic networks. Like neighbor joining, this method takes a distance matrix as input = and starts with a completely unresolved tree (i.e. a tree connecting all nodes individually to a single root). It determines which two edges (or taxa/branches) may be connected to a new in= termediate node because they are the least distant ones compared to any of = the other branch combinations in the network. This process is repeated unti= l there are no 'unprocessed' edges left. The difference to neighbour joinin= g is that NeighborNet allows for collections of clusters that overlap and d= o not form a hierarchy. The Sp= litsTree software package implements several phylogenetic algorithms am= ongst which NeigborNet. Fig. 1: Neighbornet representation of different versions of Red Ridingho= od (Tehrani et al. 2015)

#### References

=E2=80=93 Bryant, David, and Vincent Moulton. 2004. =E2=80=9CNeighbor-Ne= t: An Agglomerative Method for the Construction of Phylogenetic Networks.= =E2=80=9D Molecular Biology and Evolution 21 (2): 255=E2=80= =93265.
=E2=80=93 Huson, Daniel H., and David Bryant. 2006. =E2=80=9CApp= lication of Phylogenetic Networks in Evolutionary Studies.=E2=80=9D Mol= ecular Biology and Evolution 23 (2): 254=E2=80=93267.

=E2=80=93 Tehrani, Jamie, Quan Nguyen, and Teemu Roos. 2015. =E2=80=9COral = fairy tale or literary fake? Investigating the origins of Little Red Riding= Hood using phylogenetic network analysis.=E2=80=9D  Digital Scholarship in the Humanities. Advance Access 23 June 2015= :=20 http://dsh.oxfordjourn= als.org/content/early/2015/06/21/llc.fqv016.abstract.
{"ft_lang_label":"__label__en","ft_lang_prob":0.7757014,"math_prob":0.69355816,"size":1729,"snap":"2022-05-2022-21","text_gpt3_token_len":481,"char_repetition_ratio":0.09507246,"word_repetition_ratio":0.0,"special_character_ratio":0.31000578,"punctuation_ratio":0.1625,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9733185,"pos_list":[0,1,2],"im_url_duplicate_count":[null,1,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-05-28T03:56:22Z\",\"WARC-Record-ID\":\"<urn:uuid:a49b567c-a210-4fda-beee-be88a5c932fd>\",\"Content-Length\":\"193769\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:d6951f44-5454-4f13-bdc7-9a817db272a7>\",\"WARC-Concurrent-To\":\"<urn:uuid:ecd6c6dc-26c9-4a41-8c5f-e68d6b68771e>\",\"WARC-IP-Address\":\"128.214.205.178\",\"WARC-Target-URI\":\"https://wiki.helsinki.fi/exportword?pageId=229150111\",\"WARC-Payload-Digest\":\"sha1:3LFARGIZ4UXFUZJPGZGDP5RYEPP72LOI\",\"WARC-Block-Digest\":\"sha1:77K5XFB7M3RMW2JTLVZ7DW5QZ6CGGAMH\",\"WARC-Identified-Payload-Type\":\"message/rfc822\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-21/CC-MAIN-2022-21_segments_1652663012542.85_warc_CC-MAIN-20220528031224-20220528061224-00057.warc.gz\"}"}