DocumentCode :
3135545
Title :
New Constraints on Generation of Uniform Random Samples from Evolutionary Trees
Author :
Bhattacharjee, Anupam ; Shams, Zalia ; Sultana, Kazi Zakia
Author_Institution :
Dept. of Comput. Sci. & Eng., Bangladesh Univ. of Eng. & Technol., Dhaka
fYear :
2006
fDate :
38838
Firstpage :
115
Lastpage :
118
Abstract :
In this paper, we introduce new algorithms for selecting taxon samples from large evolutionary trees, maintaining uniformity and randomness, under certain new constraints on the taxa. The algorithms are efficient as their runtimes and space complexities are polynomial. The algorithms have direct applications to the evolution of phylogenetic tree and efficient supertree construction using biologically curated data. We also present new lower bounds for the problem of constructing evolutionary tree from experiment under some earlier stated constraints. All the algorithms have been implemented
Keywords :
biology computing; computational complexity; evolution (biological); random processes; sampling methods; trees (mathematics); evolutionary trees; phylogenetic tree; polynomial space complexities; supertree construction; taxon sample selection; uniform random samples; Bioinformatics; Computer science; Evolution (biology); Maintenance engineering; Phylogeny; Polynomials; Runtime; Sampling methods; Sequences; Space technology; NP-hard problems; Uniformity; bioinformatics; evolutionary tree; polynomial algorithms; randomness;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Electrical and Computer Engineering, 2006. CCECE '06. Canadian Conference on
Conference_Location :
Ottawa, Ont.
Print_ISBN :
1-4244-0038-4
Electronic_ISBN :
1-4244-0038-4
Type :
conf
DOI :
10.1109/CCECE.2006.277581
Filename :
4054619
Link To Document :
بازگشت