Approximate searching in phylogenetic databases

Katherine Herbert, Huiyuan Shan, Jason T.L. Wang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This paper presents background information about phylogenetic trees and possible methods for comparing the structures of these trees. Phylogeny, or the study of the evolutionary development of organisms, provides a vast amount of data, most of which is represented in the form of trees. Traditional methods for querying these trees can be inefficient. Therefore, more effective methods need to be developed. Here, we present two possible schemes for querying these trees, analyze them and introduce improvements on these methods.

Original languageEnglish
Title of host publicationProceedings of the Atlantic Symposium on Computational Biology and Genome Information Systems and Technology, CBGIST 2001
EditorsC.H. Wu, P.P. Wang, J.T.L. Wang
Pages140-142
Number of pages3
Publication statusPublished - 1 Dec 2001
EventProceedings of the Atlantic Symposium on Computational Biology and Genome Information Systems and Technology, GBGIST 2001 - Durham, NC, United States
Duration: 15 Mar 200117 Mar 2001

Publication series

NameProceedings of the Atlantic Symposium on Computational Biology and Genome Information Systems and Technolgoy, CBGIST 2001

Other

OtherProceedings of the Atlantic Symposium on Computational Biology and Genome Information Systems and Technology, GBGIST 2001
CountryUnited States
CityDurham, NC
Period15/03/0117/03/01

    Fingerprint

Cite this

Herbert, K., Shan, H., & Wang, J. T. L. (2001). Approximate searching in phylogenetic databases. In C. H. Wu, P. P. Wang, & J. T. L. Wang (Eds.), Proceedings of the Atlantic Symposium on Computational Biology and Genome Information Systems and Technology, CBGIST 2001 (pp. 140-142). (Proceedings of the Atlantic Symposium on Computational Biology and Genome Information Systems and Technolgoy, CBGIST 2001).