Parsing Expression Grammars and Their Induction Algorithm

Created by W.Langdon from gp-bibliography.bib Revision:1.8051

@Article{wieczorek:2020:AS,

• author = "Wojciech Wieczorek and Olgierd Unold and Lukasz Strak",
• title = "Parsing Expression Grammars and Their Induction Algorithm",
• journal = "Applied Sciences",
• year = "2020",
• volume = "10",
• number = "23",
• keywords = "genetic algorithms, genetic programming, genetic improvement",
• ISSN = "2076-3417",
• URL = "https://www.mdpi.com/2076-3417/10/23/8747",
• DOI = "doi:10.3390/app10238747",
• abstract = "Grammatical inference (GI), i.e., the task of finding a rule that lies behind given words, can be used in the analyses of amyloidogenic sequence fragments, which are essential in studies of neurodegenerative diseases. In this paper, we developed a new method that generates non-circular parsing expression grammars (PEGs) and compares it with other GI algorithms on the sequences from a real dataset. The main contribution of this paper is a genetic programming-based algorithm for the induction of parsing expression grammars from a finite sample. The induction method has been tested on a real bioinformatics dataset and its classification performance has been compared to the achievements of existing grammatical inference methods. The evaluation of the generated PEG on an amyloidogenic dataset revealed its accuracy when predicting amyloid segments. We show that the new grammatical inference algorithm achieves the best ACC (Accuracy), AUC (Area under ROC curve), and MCC (Mathew's correlation coefficient) scores in comparison to five other automata or grammar learning methods.",
• notes = "also known as \cite{app10238747}",

}

Genetic Programming entries for Wojciech Wieczorek Olgierd Unold Lukasz Strak

Citations