Quick path finding--quick algorithmic solution for unambiguous labeling of phylogenetic tree nodes.
Ever increasing amounts of genetic information stored in sequential databases require efficient methods to automatically reveal their phylogenetic relationships. A framework for in silico unambiguous analysis of phylogenetic trees, based on information contained in tree's topology, together with its branches length, is proposed. The resulting, translated tree has all nodes labeled, with no constraints on nodes' degree, and the subsequent finding of evolutionary pathways from the QPF-translated tree is robust and straightforward. Main features of the method are: small demands on computational time, and the ability to analyze phylogenies obtained prior to the proposed QPF analysis by any traditional tree-building technique.
Płoński
Piotr
P
Interdisciplinary Center for Mathematical and Computational Modeling, Warsaw University, Pawińskiego 5A, Bldg. D, PL-02106 Warsaw, Poland. pplonski@icm.edu.pl
Radomski
Jan P
JP
D000465:Algorithms; D003198:Computer Simulation; D030541:Databases, Genetic; D019143:Evolution, Molecular; D014644:Genetic Variation; D010802:Phylogeny