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
Follow spark-msna
Other Useful Business Software
Earn up to 16% annual interest with Nexo.
Put idle assets to work with competitive interest rates, borrow without selling, and trade with precision. All in one platform.
Geographic restrictions, eligibility, and terms apply.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of spark-msna!