Download
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
Resolve Support Tickets 2x Faster with ServoDesk
What if You Could Automate 90% of Your Repetitive Tasks in Under 30 Days? At ServoDesk, we help businesses like yours automate operations with AI, allowing you to cut service times in half and increase productivity by 25% - without hiring more staff.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of spark-msna!
