How julian-borges/algorithms-for-dna-sequencing-project-1 works
Project type and purpose
• This is a command-line bioinformatics analysis project (not a web app or microservice).
• Purpose: implement and demonstrate core DNA-sequencing algorithms (FASTA/FASTQ parsing, exact/approximate matching, reverse complement computation, quality‐score analysis) against a reference genome and sample reads, answering biological questions.
File structure
• Top-level files:
• dna_sequencing_analysis.py – monolithic Python script that orchestrates all steps
• dna_sequencing_analysis.ipynb – Jupyter notebook variant for interactive exploration
• lambda_virus.fa – reference FASTA file
• ERR037900_1.first1000.fastq – FASTQ reads dataset
• requirements.txt – Python dependencies
• Supporting artifacts (PDFs) are documentation or background reading; they do not participate at runtime.
README for additional insights
• Confirms sequential pipeline: parse input → run exact/approximate matchers → compute reverse complements → analyze per-cycle quality scores → generate answers.
• No database or external web services; all I/O is file-based.