This repository contains a collection of scripts designed to solve common problems in bioinformatics and algorithmic puzzles. These Perl scripts can be utilized for DNA sequence analysis, optimization problems, and mathematical challenges.
| Script Name | Description |
|---|---|
fibonacci_series_calculator.pl |
Generates Fibonacci series numbers. |
tower_of_hanoi_solver.pl |
Solves the Tower of Hanoi puzzle. |
dna_distinct_substrings.pl |
Finds all distinct substrings in DNA data. |
hamming_distance_calculator.pl |
Calculates the Hamming distance between sequences. |
amino_acid_to_dna_converter.pl |
Converts amino acid sequences to DNA codons. |
global_alignment_wunsch.pl |
Performs global sequence alignment using the Needleman-Wunsch algorithm. |
local_alignment_smith.pl |
Performs local sequence alignment using the Smith-Waterman algorithm. |
edit_distance_calculator.pl |
Computes edit distance between strings. |
motif_identification_profile.pl |
Identifies motifs using profile matrices. |
longest_common_subsequence.pl |
Finds the longest common subsequence between strings. |
dna_fragment_assembly.pl |
Assembles DNA fragments into sequences. |
euclid_pdb.pl |
Calculate and print the distances between atoms. |
dna_mutation.pl |
Randomized mutation of genomic sequences. |
- Perl: Ensure you have Perl installed on your system. Most Unix-based systems come with Perl pre-installed.
-
Clone this repository:
git clone https://github.com/your-username/bioinformatics-scripts.git cd bioinformatics-scripts -
Run the scripts using Perl:
perl script_name.pl
-
For scripts requiring input, provide the necessary arguments or input files as specified in the script comments.
Generates Fibonacci numbers up to a specified limit. Useful for sequence-based problems.
Solves the Tower of Hanoi puzzle and outputs the steps required to move all disks from one peg to another.
Analyzes a given DNA sequence and outputs all distinct substrings, aiding in sequence pattern recognition.
Calculates the Hamming distance between two DNA or RNA sequences, measuring the number of differing nucleotides.
Converts amino acid sequences back into possible DNA codons, useful for reverse translation.
Implements the Needleman-Wunsch algorithm for aligning two sequences globally.
Implements the Smith-Waterman algorithm for local alignment of sequences.
Computes the minimum number of edits required to transform one string into another.
Uses profile matrices to identify motifs in DNA sequences.
Finds the longest subsequence common to two given sequences.
Reconstructs DNA sequences from smaller fragments using sequence overlaps.
Calculate and print the distances between atoms with the maximum distance for each atom in the first set relative to atoms in the second set.
Reads a DNA sequence from a file, mutates it at random positions to create successive variations, and prints the original sequence, the first mutation, and 10 successive mutated sequences.
This repository is licensed under the MIT License. See the LICENSE file for details.