https://github.com/gagniuc/simple-sequence-alignment-in-vb6

This highly responsive VB6 application is an implementation of the global sequence alignment algorithm. It allows the modification of the alignment parameters (match, mismatch, gap), and it shows the pairwise alignment as well as the score matrix in real time. The purpose of it is to seeks the optimal alignment between two text sequences.
https://github.com/gagniuc/simple-sequence-alignment-in-vb6

alignment alignment-algorithm dna-sequences global matrix proteins rna score sequence-alignment text vb6 vb6-application vb6-source

Last synced: 4 months ago
JSON representation

This highly responsive VB6 application is an implementation of the global sequence alignment algorithm. It allows the modification of the alignment parameters (match, mismatch, gap), and it shows the pairwise alignment as well as the score matrix in real time. The purpose of it is to seeks the optimal alignment between two text sequences.

• Host: GitHub
• URL: https://github.com/gagniuc/simple-sequence-alignment-in-vb6
• Owner: Gagniuc
• License: mit
• Created: 2021-11-12T14:50:36.000Z (over 3 years ago)
• Default Branch: main
• Last Pushed: 2022-11-17T07:11:15.000Z (over 2 years ago)
• Last Synced: 2025-01-15T07:31:51.849Z (6 months ago)
• Topics: alignment, alignment-algorithm, dna-sequences, global, matrix, proteins, rna, score, sequence-alignment, text, vb6, vb6-application, vb6-source
• Language: Visual Basic 6.0
• Homepage:
• Size: 4.31 MB
• Stars: 6
• Watchers: 2
• Forks: 2
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • Funding: .github/FUNDING.yml
  • License: LICENSE

Awesome Lists containing this project

README

        
# :fleur_de_lis: Simple sequence alignment in VB6

This highly responsive VB6 application is an implementation of the global sequence alignment algorithm. It allows the modification of the alignment parameters (match, mismatch, gap), and it shows the pairwise alignment as well as the score matrix in real time. The purpose of it is to seeks the optimal alignment between two text sequences. Why is this optimal alignment so important? To find similarities between two words, a manual comparison is required. For words between 4 and 8 letters, such a task can be performed by any of us without the use of a computer. However, what if the objects of comparison are entire phrases/sequences/files? Then the number of possibilities for different matches increases exponentially and nobody can do it by paper computing (to my knowledge). Computational solutions for these problems exist, such as different implementations of sequence alignment algorithms. Here, the implementation of global sequence alignment is shown in detail. Note that the implementation si designed in Visual Basic 6.0.





# References

- Paul A. Gagniuc. Algorithms in Bioinformatics: Theory and Implementation. John Wiley & Sons, Hoboken, NJ, USA, 2021, ISBN: 9781119697961.