Cluster-Distribute-Align-Merge: A General Algorithm to Speed Up Multiple Sequence Alignment on Multi-Core Computers

Faculty Computer Science Year: 2014
Type of Publication: ZU Hosted Pages:
Authors:
Journal: Journal of Computational and Theoretical Nanoscience Journal of Computational and Theoretical Nanoscience Volume: 11
Keywords : Cluster-Distribute-Align-Merge: , General Algorithm , Speed , Multiple Sequence    
Abstract:
We present a general algorithm to speed up multiple sequence alignment on modern multi-core computers. This algorithm is implemented in a software called CDAM. By clustering, CDAM partitions a large-scale alignment problem into smaller and
   
     
 
       

Author Related Publications

  • Ahmed Salah Mohamed Mostafa, "Artificial Intelligence and Machine Learning-Driven Decision-Making", Hindawi, 2021 More
  • Ahmed Salah Mohamed Mostafa, "Usages of Spark Framework with Different Machine Learning Algorithms", Hindawi, 2021 More
  • Ahmed Salah Mohamed Mostafa, "Efficient index-independent approaches for the collective spatial keyword queries", elsevier, 2021 More
  • Ahmed Salah Mohamed Mostafa, "A robust UWSN handover prediction system using ensemble learning", MDPI, 2021 More
  • Ahmed Salah Mohamed Mostafa, "Price Prediction of Seasonal Items Using Machine Learning and Statistical Methods", Tech Science Press, 2021 More

Department Related Publications

  • Heba Zaki Mohamed Abdallah Elfiqi, "Structural simplexity of the brain", Elsevier Publisher, 2010 More
  • Heba Zaki Mohamed Abdallah Elfiqi, "A computational linguistic approach for the identification of translator stylometry using Arabic-English text", IEEE, 2011 More
  • Heba Zaki Mohamed Abdallah Elfiqi, "Measuring Complexity of Mouse Brain Morphological Changes Using GeoEntropy", AIP Publishing, 2009 More
  • Ahmed Salah Mohamed Mostafa, "A data parallel strategy for aligning multiple biological sequences on multi-core computers", Computers in Biology and Medicine, 2013 More
  • Ahmed Salah Mohamed Mostafa, "A Parallel Chemical Reaction Optimization for Multiple Choice Knapsack Problem", Springer Berlin Heidelberg, 2014 More
Tweet