کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
524487 | 868672 | 2006 | 6 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
pNJTree: A parallel program for reconstruction of neighbor-joining tree and its application in ClustalW
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نرم افزارهای علوم کامپیوتر
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: pNJTree: A parallel program for reconstruction of neighbor-joining tree and its application in ClustalW pNJTree: A parallel program for reconstruction of neighbor-joining tree and its application in ClustalW](/preview/png/524487.png)
چکیده انگلیسی
Neighbor-joining (NJ) is a distance-based method for tree construction. It is the most widely used method with polynomial time complexity at present. However, a fundamental problem with the previous implementations of this method is its limitation to handle large taxa sets within a reasonable time and memory resources. In this paper, we present a parallel implementation, pNJTree, for fast construction of very large phylogenetic trees. In comparison, pNJTree gets near-linear speedup for large taxa sets. It can be used to improve the speedup of the parallelized ClustalW methods.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Parallel Computing - Volume 32, Issues 5–6, June 2006, Pages 441–446
Journal: Parallel Computing - Volume 32, Issues 5–6, June 2006, Pages 441–446
نویسندگان
Zhihua Du, Feng Lin,