Skip to content

This project is a Java implementation of the Smith-Waterman algorithm, commonly used in bioinformatics for local sequence alignment. It enables the comparison of DNA, RNA, or protein sequences by identifying regions of similarity, which can be helpful for evolutionary studies, structural analysis, and functional predictions.

License

Notifications You must be signed in to change notification settings

MateusjsSilva/smith-waterman-algorithm

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 
 
 
 
 

Repository files navigation

Smith-Waterman Algorithm

This project implements the Smith-Waterman algorithm used for local alignment of DNA sequences.

Features

  • Reads sequences from an input file.
  • Calculates the optimal alignment and the maximum score.
  • Writes the aligned sequences and additional information to an output file.

Project Structure

algoritmo-de-smith-waterman
└── SmithWaterman
    └── src
        └── mateussilva
            └── main
                └── java

The source code is located in the mateussilva/main/java folder.

Requirements

  • Java (JDK 8 or higher)

About

This project is a Java implementation of the Smith-Waterman algorithm, commonly used in bioinformatics for local sequence alignment. It enables the comparison of DNA, RNA, or protein sequences by identifying regions of similarity, which can be helpful for evolutionary studies, structural analysis, and functional predictions.

Topics

Resources

License

Stars

Watchers

Forks

Languages