{"id":26506594,"url":"https://github.com/bibymaths/sequencealigner","last_synced_at":"2025-03-20T22:39:37.548Z","repository":{"id":283481555,"uuid":"951909821","full_name":"bibymaths/SequenceAligner","owner":"bibymaths","description":"A simple C++ program for performing Longest Common Subsequence (LCS), Global Alignment, and Local Alignment using dynamic programming. Reads sequences from input files and computes alignment scores based on match, mismatch, and gap penalties.","archived":false,"fork":false,"pushed_at":"2025-03-20T13:29:36.000Z","size":10,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-20T14:04:33.156Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/bibymaths.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2025-03-20T12:40:50.000Z","updated_at":"2025-03-20T13:29:40.000Z","dependencies_parsed_at":"2025-03-20T14:04:58.791Z","dependency_job_id":"4a77d0fd-0fe6-4c66-a773-abc35e4d9063","html_url":"https://github.com/bibymaths/SequenceAligner","commit_stats":null,"previous_names":["bibymaths/sequencealigner"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bibymaths%2FSequenceAligner","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bibymaths%2FSequenceAligner/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bibymaths%2FSequenceAligner/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bibymaths%2FSequenceAligner/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/bibymaths","download_url":"https://codeload.github.com/bibymaths/SequenceAligner/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":244706294,"owners_count":20496565,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2025-03-20T22:39:36.959Z","updated_at":"2025-03-20T22:39:37.539Z","avatar_url":"https://github.com/bibymaths.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Sequence Alignment Program\n\n## Description\nThis C++ program performs sequence alignment using three different methods:\n1. **Longest Common Subsequence (LCS)**: Finds the length of the longest common subsequence between two sequences.\n2. **Global Alignment**: Uses a scoring system with match, mismatch, and gap penalties to align two sequences globally.\n3. **Local Alignment**: Identifies the best local alignment between two sequences based on a scoring system.\n\n## Requirements\n- C++ compiler (e.g., `g++`)\n- Input sequence files (`seq1.txt` and `seq2.txt`)\n\n## Compilation\nTo compile the program, run:\n\n```sh\ng++ -o sequence_alignment sequence_alignment.cpp\n```\n\n## Usage\nRun the program from the terminal:\n\n```sh\n./sequence_alignment\n```\n\nThen, enter your choice of alignment method:\n- `1` for LCS\n- `2` for Global Alignment\n- `3` for Local Alignment\n\n## Input Format\nThe program reads two DNA or protein sequences from text files:\n- `seq1.txt` (First sequence)\n- `seq2.txt` (Second sequence)\n\nEach file should contain a single line with the sequence.\n\n## Output\n- LCS method prints the length of the longest common subsequence.\n- Global and Local alignment methods print the alignment score.\n\n## Example\n**Input files:**\n```\nseq1.txt:\nATGCTGA\n\nseq2.txt:\nATGTTGA\n```\n\n**Running the program:**\n```sh\n./sequence_alignment\nSelect Alignment Method:\n1. LCS\n2. Global\n3. Local\nChoice: 2\n```\n\n**Output:**\n```\nGlobal Alignment Score: 10\n```\n\n## License\nThis program is open-source and free to use for educational purposes.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbibymaths%2Fsequencealigner","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fbibymaths%2Fsequencealigner","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbibymaths%2Fsequencealigner/lists"}