fulltext.study @t Gmail

Quick path finding—Quick algorithmic solution for unambiguous labeling of phylogenetic tree nodes

Paper ID Volume ID Publish Year Pages File Format Full-Text
15285 1400 2010 8 PDF Available
Title
Quick path finding—Quick algorithmic solution for unambiguous labeling of phylogenetic tree nodes
Abstract

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.

Keywords
Quick path finding algorithm; Neighbor joining algorithm; Phylogenetic analysis; Phylogenetic tree; Newick format; Automatic node labeling
First Page Preview
Quick path finding—Quick algorithmic solution for unambiguous labeling of phylogenetic tree nodes
Publisher
Database: Elsevier - ScienceDirect
Journal: Computational Biology and Chemistry - Volume 34, Issues 5–6, December 2010, Pages 300–307
Authors
, ,
Subjects
Physical Sciences and Engineering Chemical Engineering Bioengineering