Complexity of Minimal Tree Routing and Coloring

2005 ◽  
pp. 6-15 ◽  
Author(s):  
Xujin Chen ◽  
Xiaodong Hu ◽  
Xiaohua Jia
Keyword(s):  
Minimal Tree ◽  
Tree Routing

scholarly journals Inapproximability and approximability of minimal tree routing and coloring

2008 ◽  
Vol 6 (2) ◽  
pp. 341-351
Author(s):  
Xujin Chen ◽  
Xiaodong Hu ◽  
Xiaohua Jia
Keyword(s):  
Minimal Tree ◽  
Tree Routing

Clustering hierarchy tree routing algorithm based on LEACH

2009 ◽  
Vol 28 (10) ◽  
pp. 2594-2596
Author(s):  
Chun-yan SONG ◽  
Hua-zhong ZHANG ◽  
Xiu-yang ZHANG
Keyword(s):  
Routing Algorithm ◽  
Tree Routing

scholarly journals On a conjecture of Tutte concerning minimal tree numbers

1979 ◽  
Vol 26 (3) ◽  
pp. 346-348 ◽  
Author(s):  
F Göbel ◽  
A.A Jagers
Keyword(s):  
Minimal Tree

PATTERN MATCHING CODE MINIMIZATION IN REWRITING-BASED PROGRAMMING LANGUAGES

2002 ◽  
Vol 13 (06) ◽  
pp. 873-887
Author(s):  
NADIA NEDJAH ◽  
LUIZA DE MACEDO MOURELLE
Keyword(s):  
Programming Languages ◽  
Pattern Matching ◽  
Term Rewriting ◽  
Directed Acyclic Graphs ◽  
Tree Automaton ◽  
Minimal Tree ◽  
Term Rewriting Systems ◽  
Rewriting Systems ◽  
Acyclic Graphs ◽  
Space Requirements

We compile pattern matching for overlapping patterns in term rewriting systems into a minimal, tree matching automata. The use of directed acyclic graphs that shares all the isomorphic subautomata allows us to reduce space requirements. These are duplicated in the tree automaton. We design an efficient method to identify such subautomata and avoid duplicating their construction while generating the dag automaton. We compute some bounds on the size of the automata, thereby improving on previously known equivalent bounds for the tree automaton.

Executing tree routing algorithms on a high-performance pattern associative router

1998 ◽  
Vol 44 (11) ◽  
pp. 849-866
Author(s):  
Douglas H. Summerville ◽  
José G. Delgado-Frias ◽  
Stamatis Vassiliadis
Keyword(s):  
High Performance ◽  
Routing Algorithms ◽  
Tree Routing ◽  
Performance Pattern

Physical position based shortcut tree routing in ZigBee WSN’s

2021 ◽  
Author(s):  
Shiju Kumar P. S. ◽  
A. Ramesh Babu
Keyword(s):  
Physical Position ◽  
Tree Routing

scholarly journals Techniques for the verification of minimal phylogenetic trees illustrated with ten mammalian haemoglobin sequences

1980 ◽  
Vol 187 (1) ◽  
pp. 65-74 ◽  
Author(s):  
D Penny ◽  
M D Hendy ◽  
L R Foulds
Keyword(s):  
Amino Acid ◽  
Phylogenetic Tree ◽  
Protein Sequence ◽  
Phylogenetic Trees ◽  
Sequence Data ◽  
Protein Sequences ◽  
Nucleotide Sequences ◽  
Amino Acid Sequences ◽  
Minimal Tree ◽  
Protein Sequence Data

We have recently reported a method to identify the shortest possible phylogenetic tree for a set of protein sequences [Foulds Hendy & Penny (1979) J. Mol. Evol. 13. 127–150; Foulds, Penny & Hendy (1979) J. Mol. Evol. 13, 151–166]. The present paper discusses issues that arise during the construction of minimal phylogenetic trees from protein-sequence data. The conversion of the data from amino acid sequences into nucleotide sequences is shown to be advantageous. A new variation of a method for constructing a minimal tree is presented. Our previous methods have involved first constructing a tree and then either proving that it is minimal or transforming it into a minimal tree. The approach presented in the present paper progressively builds up a tree, taxon by taxon. We illustrate this approach by using it to construct a minimal tree for ten mammalian haemoglobin alpha-chain sequences. Finally we define a measure of the complexity of the data and illustrate a method to derive a directed phylogenetic tree from the minimal tree.

Sign in / Sign up

Export Citation Format

Share Document