orfm

orfm identifies open reading frames (ORFs) in nucleotide sequence data using the Aho-Corasick algorithm to rapidly locate regions without stop codons for high-throughput sequencing analyses such as Illumina metagenomics.

Key Features:

• Speed and Efficiency: Achieves a four- to five-fold increase in speed over GetOrf and Translate while reporting the same ORFs.
• Algorithmic Approach: Uses the Aho-Corasick algorithm to rapidly locate stretches of DNA uninterrupted by stop codons.
• Read and Contig Compatibility: Detects ORFs in both unassembled reads and assembled contigs typical of metagenomic datasets.
• Optimal Data Performance: Performs best on large, high-quality datasets typical of Illumina sequencing.
• Output Format: Outputs identified ORFs as FASTA sequences.
• Implementation Language: Implemented in C for high-performance execution.

Scientific Applications:

• Metagenomics: Rapid ORF identification from unassembled reads and assembled contigs in Illumina-based metagenomic studies.
• Genomics: Screening assembled contigs for genes of interest in genomic sequencing projects.
• Gene Discovery: Enabling gene discovery from high-throughput nucleotide datasets by detecting candidate protein-coding regions.
• Functional Annotation: Providing protein-coding sequences for downstream functional annotation pipelines.
• Comparative Genomics: Supporting comparative genomics analyses through fast extraction of ORFs across large datasets.

Methodology:

Translates nucleotide sequences into potential protein-coding regions by locating stretches without stop codons using the Aho-Corasick algorithm, outputs ORFs as FASTA files, and is implemented in C.