Load Balancing and Parallel Multiple Sequence Alignment with Tree Accumulation
暂无分享,去创建一个
[1] Dorit S. Hochba,et al. Approximation Algorithms for NP-Hard Problems , 1997, SIGA.
[2] J. Thompson,et al. CLUSTAL W: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position-specific gap penalties and weight matrix choice. , 1994, Nucleic acids research.
[3] N. Saitou,et al. The neighbor-joining method: a new method for reconstructing phylogenetic trees. , 1987, Molecular biology and evolution.
[4] Dorit S. Hochbaum,et al. Approximation Algorithms for NP-Hard Problems , 1996 .
[5] R. Doolittle,et al. Progressive sequence alignment as a prerequisitetto correct phylogenetic trees , 2007, Journal of Molecular Evolution.
[6] Wentong Cai,et al. Efficient Parallel Algorithms for Tree Accumulations , 1994, Sci. Comput. Program..
[7] Andrew Rau-Chaplin,et al. Parallel CLUSTAL W for PC Clusters , 2003, ICCSA.
[8] Vijay V. Vazirani,et al. Approximation Algorithms , 2001, Springer Berlin Heidelberg.
[9] Roberto Gomperts,et al. Performance Optimization of Clustal W : Parallel Clustal W , HT Clustal , and MULTICLUSTAL , 2001 .
[10] Kuo-Bin Li,et al. ClustalW-MPI: ClustalW analysis using distributed and parallel computing , 2003, Bioinform..
[11] Y.-K. Kwok,et al. Static scheduling algorithms for allocating directed task graphs to multiprocessors , 1999, CSUR.