DocumentCode
3598308
Title
A new graph labelling on trees
Author
Yao, Ming ; Yao, Bing ; Xie, Jianming ; Zhang, Xiaoxian
Author_Institution
Dept. of Inf. Process & Control Eng., Lanzhou Petrochem. Coll. of Vocational Technol., Lanzhou, China
Volume
6
fYear
2010
Firstpage
2265
Lastpage
2269
Abstract
Graphs are excellent structures for storing, searching, and retrieving large amounts of data. By reducing an instance of a problem to a standard graph problem, we may be able to use well-known graph algorithms to provide an optimal solution, such as graphs in bioinformatics. Binary search trees in phylogenetic trees are organized so that each node has a label. A new graph labelling on trees is defined, and the properties of trees having this labelling are shown.
Keywords
bioinformatics; search problems; trees (mathematics); binary search tree; bioinformatics; data retrieval; data searching; data storing; graph labelling; phylogenetic tree; Algorithm design and analysis; Educational institutions; Graph theory; Labeling; Nickel; Phylogeny;
fLanguage
English
Publisher
ieee
Conference_Titel
Biomedical Engineering and Informatics (BMEI), 2010 3rd International Conference on
Print_ISBN
978-1-4244-6495-1
Type
conf
DOI
10.1109/BMEI.2010.5639422
Filename
5639422
Link To Document