A GPU-based parallel method for evolutionary tree construction

[1]  S. Henikoff,et al.  Amino acid substitution matrices from protein blocks. , 1992, Proceedings of the National Academy of Sciences of the United States of America.

[2]  Kuo-Bin Li,et al.  ClustalW-MPI: ClustalW analysis using distributed and parallel computing , 2003, Bioinform..

[3]  Ninghui Sun,et al.  Parallel multiple sequences alignment in SMP cluster , 2005, Eighth International Conference on High-Performance Computing in Asia-Pacific Region (HPCASIA'05).

[4]  John D. Owens,et al.  Glift: Generic, efficient, random-access GPU data structures , 2006, TOGS.

[5]  Surin Kittitornkun,et al.  MT-ClustalW: multithreading multiple sequence alignment , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

[6]  P. J. Narayanan,et al.  Accelerating Large Graph Algorithms on the GPU Using CUDA , 2007, HiPC.

[7]  Thomas Mailund,et al.  Rapid Neighbour-Joining , 2008, WABI.

[8]  Yongchao Liu,et al.  Parallel reconstruction of neighbor-joining trees for large multiple sequence alignments using CUDA , 2009, 2009 IEEE International Symposium on Parallel & Distributed Processing.

[9]  Jens Lagergren,et al.  Fast neighbor joining , 2009, Theor. Comput. Sci..

[10]  John R. Kender,et al.  Video genetics: a case study from YouTube , 2010, ACM Multimedia.

[11]  Thomas Mailund,et al.  Inference of Large Phylogenies Using Neighbour-Joining , 2010, BIOSTEC.

[12]  K. Somasundaram,et al.  Efficient Resource Scheduler for Parallel Implementation of MSA Algorithm on Computational Grid , 2010, 2010 International Conference on Recent Trends in Information, Telecommunication and Computing.

[13]  Christophe Godin,et al.  Quantifying the Degree of Self-Nestedness of Trees: Application to the Structural Analysis of Plants , 2010, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[14]  Unweighted Multiple Group Method with Arithmetic Mean , 2010, 2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA).

[15]  Atsuhiro Takasu,et al.  An Improved Clique-Based Method for Computing Edit Distance between Unordered Trees and Its Application to Comparison of Glycan Structures , 2011, 2011 International Conference on Complex, Intelligent, and Software Intensive Systems.

[16]  Edans Flavius de Oliveira Sandes,et al.  Smith-Waterman Alignment of Huge Sequences with GPU in Linear Space , 2011, 2011 IEEE International Parallel & Distributed Processing Symposium.

[17]  Sanjay V. Rajopadhye,et al.  Improving CUDASW++, a Parallelization of Smith-Waterman for CUDA Enabled Devices , 2011, 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum.

[18]  Abraham Kandel,et al.  Knowledge discovery in data streams with regression tree methods , 2012, WIREs Data Mining Knowl. Discov..

[19]  Norbert Luttenberger,et al.  A Novel Sorting Algorithm for Many-core Architectures Based on Adaptive Bitonic Sort , 2012, 2012 IEEE 26th International Parallel and Distributed Processing Symposium.

[20]  Nicholas A. Hamilton,et al.  Fast Parallel Markov Clustering in Bioinformatics Using Massively Parallel Computing on GPU with CUDA and ELLPACK-R Sparse Format , 2012, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[21]  Hai Jin,et al.  Parallelization Mechanisms of Neighbor-Joining for CUDA Enabled Devices , 2012, 2012 Seventh ChinaGrid Annual Conference.

[22]  Zijiang Yang,et al.  LemK_MSA: A Multiple Sequence Alignment Method with Sequence Vectorization Based on Lempel-Ziv , 2013 .