Basic Gene Grammars and DNA-ChartParser for language processing of Escherichia coli promoter DNA sequences

Area of Science:

• Computational Biology
• Bioinformatics
• Genomic Sequence Analysis

Background:

• DNA linguistics integrates computational linguistics and molecular biology.
• Definite Clause Grammars (DCGs) are common in DNA linguistics but have computational limitations.
• A novel DNA parsing system is introduced to address these limitations.

Purpose of the Study:

• To present a new DNA parsing system, Basic Gene Grammars (BGGs) and DNA-ChartParser.
• To demonstrate the utility of BGGs in representing diverse knowledge formulations for gene elements.
• To enhance the accuracy of promoter recognition by integrating multiple knowledge sources.

Main Methods:

• Developed Basic Gene Grammars (BGGs), a logic grammar formalism for DNA sequences.
• Implemented DNA-ChartParser, a bidirectional chart parser for BGGs.
• Applied the system to model Escherichia coli promoter knowledge from various sources.

Main Results:

• BGGs successfully represented diverse Escherichia coli promoter knowledge (expert, statistical, machine learning).
• DNA-ChartParser handled complex parsing features like gaps and approximate matching.
• Combining knowledge sources via BGGs and DNA-ChartParser improved promoter recognition accuracy on real-world data.

Conclusions:

• The BGG formalism and DNA-ChartParser provide a robust system for DNA sequence analysis.
• This approach effectively integrates heterogeneous biological knowledge for improved accuracy.
• The system offers a powerful tool for computational genomics and bioinformatics research.