Algebraic dynamic programming on trees (Q2633220): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q56267141, #quickstatements; #temporary_batch_1714632961156 |
||
Property / Wikidata QID | |||
Property / Wikidata QID: Q56267141 / rank | |||
Normal rank |
Latest revision as of 09:01, 2 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Algebraic dynamic programming on trees |
scientific article |
Statements
Algebraic dynamic programming on trees (English)
0 references
8 May 2019
0 references
Summary: Where string grammars describe how to generate and parse strings, tree grammars describe how to generate and parse trees. We show how to extend generalized algebraic dynamic programming to tree grammars. The resulting dynamic programming algorithms are efficient and provide the complete feature set available to string grammars, including automatic generation of outside parsers and algebra products for efficient backtracking. The complete parsing infrastructure is available as an embedded domain-specific language in Haskell. In addition to the formal framework, we provide implementations for both tree alignment and tree editing. Both algorithms are in active use in, among others, the area of bioinformatics, where optimization problems on trees are of considerable practical importance. This framework and the accompanying algorithms provide a beneficial starting point for developing complex grammars with tree- and forest-based inputs.
0 references
dynamic programming
0 references
formal language
0 references
tree editing
0 references
tree alignment
0 references