The algorithm uses suffix tree for identifying common substrings and uses a modified Needleman-Wunsch algorithm for pairwise alignments. In order to improve the efficiency of pairwise alignments, an unsupervised learning based on clustering technique is used to create a knowledge base to guide them.

Features

  • Multiple sequence alignment
  • Suffix trees
  • Unsupervised Learning
  • Needleman–Wunsch algorithm
  • DNA/RNA sequences, MapReduce

Project Activity

See All Activity >

Follow spark-msna

spark-msna Web Site

Other Useful Business Software
$300 Free Credits to Build on Google Cloud Icon
$300 Free Credits to Build on Google Cloud

New customers can spin up VMs, build with AI, and query data at no cost.

Put your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.
Start Free
Rate This Project
Login To Rate This Project

User Reviews

Be the first to post a review of spark-msna!

Additional Project Details

Registered

2018-05-30