Title :
An approximation algorithm for bounded degree closest phylogenetic 2nd root problem
Author :
Rahman, Md Ahsanur ; Islam, Md Rafiqul
Author_Institution :
Dept. of Comput. Sci., American Int. Univ. Bangladesh, Dhaka, Bangladesh
Abstract :
The degree Δ-closest phylogenetic 2nd root problem (ΔCPR2) is an NP-hard problem concerning phylogenetic tree reconstruction from a graph representing the similarities of the species concerned. Here we present an approximation algorithm for this problem for any fixed Δ >; 3. When |V| >; 3Δ - 1, our algorithm yields an approximation ratio of max((Δ-2)/α, 2), where α >; 1 is a constant whose value depends on the values of |V| and Δ.
Keywords :
approximation theory; computational complexity; genetic algorithms; trees (mathematics); Δ-closest phylogenetic second root problem; NP-hard problem; approximation algorithm; approximation ratio; phylogenetic tree reconstruction; Algorithm design and analysis; Approximation algorithms; Approximation methods; Clustering algorithms; Equations; Phylogeny; approximation algorithm; evolutionary biology; phylogenetic root; phylogeny;
Conference_Titel :
Computer and Information Technology (ICCIT), 2010 13th International Conference on
Conference_Location :
Dhaka
Print_ISBN :
978-1-4244-8496-6
DOI :
10.1109/ICCITECHN.2010.5723821
