2009 Fifth International Conference on Natural Computation 2009
DOI: 10.1109/icnc.2009.719
|View full text |Cite
|
Sign up to set email alerts
|

The Minimum Spanning Trees of tRNA Sequences Based on Prim's Algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2015
2015
2019
2019

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 8 publications
0
3
0
Order By: Relevance
“…It is one of the greedy algorithm in graph theory that finds a minimum spanning tree for a connected weighted graph. A minimum spanning tree (MST) is a subset of the edges of a connected, undirected graph that connects all the vertices together, without forming any cycles and with the minimum total edge weight [23]. Minimum spanning tree are divided into line-based MST algorithm and node-based MST algorithm.…”
Section: Kruskal's Algorithmmentioning
confidence: 99%
“…It is one of the greedy algorithm in graph theory that finds a minimum spanning tree for a connected weighted graph. A minimum spanning tree (MST) is a subset of the edges of a connected, undirected graph that connects all the vertices together, without forming any cycles and with the minimum total edge weight [23]. Minimum spanning tree are divided into line-based MST algorithm and node-based MST algorithm.…”
Section: Kruskal's Algorithmmentioning
confidence: 99%
“…Step 2: After Step 1, the Controller starts to adopt the Prim algorithm [19] to create Minimum Spanning Tree (MST) on switch level, and then takes it as the broadcast tree of the network. For instance, the broadcast tree in Fig.…”
Section: Related Workmentioning
confidence: 99%
“…Hence, the Controller knows the entire network topology. Step 2: After Step 1, the Controller starts to adopt the Prim algorithm [19] to create Minimum Spanning Tree (MST) on switch level, and then takes it as the broadcast tree of the network. For instance, the broadcast tree in Fig.…”
Section: Related Workmentioning
confidence: 99%