NAP

NAP performs optimal global alignment between DNA sequences and protein sequences to identify gene-level homology while accommodating frameshifts and long introns.

Key Features:

• Nucleotide–Amino Acid Alignment: Computes optimal global alignments between nucleotide (DNA) sequences and amino acid (protein) sequences.
• Frameshift Handling: Explicitly accounts for frameshifts when aligning DNA to protein sequences.
• Long Intron Accommodation: Handles long introns within DNA sequences during alignment.
• No Terminal Gap Penalties: Computes alignments without imposing penalties on terminal gaps to increase sensitivity.
• Global and Local Alignment Methods: Implements two approaches for constructing optimal global alignments and local alignments between nucleotide and amino acid sequences.
• Linear-Space Memory Usage: Requires computer memory proportional to sequence lengths, enabling efficient alignment of very long sequences.
• Sensitivity for Gene Detection: Optimized for sensitive identification of genes through DNA–protein sequence homology.

Scientific Applications:

• Gene Prediction: Supports gene prediction tasks by aligning genomic DNA to protein sequences while accounting for frameshifts and introns.
• Gene Identification via Homology: Detects homologous coding regions through DNA–protein sequence comparisons.
• Alignment of Long Genomic Regions: Facilitates alignment of long DNA sequences to proteins using linear-space algorithms suitable for large genomic analyses.

Methodology:

Implements two approaches to construct optimal global and local nucleotide–amino acid alignments, computes alignments without terminal gap penalties, and uses algorithms requiring computer memory proportional to sequence lengths (linear space).