NewickParser

Full name Microsoft.VisualBasic.DataMining.BinaryTree.NewickParser Assembly Microsoft.VisualBasic.DataMining.BinaryTreeClustering Members 4

01 Syntax

Microsoft.VisualBasic.DataMining.BinaryTree.NewickParser

02 Methods

Name	Overloads	Summary
TreeParser	2	created: Oct 20, 2013 : a better and easier to maintain parser for newick and nexus trees NOTE: this is a recursive function
__makeInternalNode	1	Dec 5, 2011; can be used to make rootnode
parseInforAndMakeNewLeafNode	1	created on Oct 20, 2013 input: the leafstr to be parsed, the internal node the leaf node has to be added to

03 Members

method TreeParser overload 2 #

TreeParser``1(String, Dictionary(Of String, String))

Type Parameters

Name	Description
`T`

Parameters

Name	Type	Description
`input`	`String`	-
`hashTranslate`	`Dictionary(Of String, String)`	可以通过这个对象将节点编号映射为名称

method TreeParser #

TreeParser``1(String, Dictionary(Of String, String), TreeNode(Of ``0))

created: Oct 20, 2013 : a better and easier to maintain parser for newick and nexus trees NOTE: this is a recursive function

Parameters

Name	Type	Description
`inputstr`	`String`	: input tree string
`hashTranslate`	`Dictionary(Of String, String)`	: aliases for lead nodes (for nexsus format)
`iNode`	TreeNode(Of ``0)	: current internal node; == rootNode the first time 'newickParser' is called

method __makeInternalNode #

__makeInternalNode``1(String, Boolean, TreeNode(Of ``0))

Dec 5, 2011; can be used to make rootnode

Parameters

method parseInforAndMakeNewLeafNode #

parseInforAndMakeNewLeafNode``1(String, Dictionary(Of String, String), TreeNode(Of ``0))

created on Oct 20, 2013 input: the leafstr to be parsed, the internal node the leaf node has to be added to