Faster algorithms for computing the hairpin completion distance and minimum ancestor (Q6622008)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7929268
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Faster algorithms for computing the hairpin completion distance and minimum ancestor |
scientific article; zbMATH DE number 7929268 |
Statements
Faster algorithms for computing the hairpin completion distance and minimum ancestor (English)
0 references
21 October 2024
0 references
dynamic programming
0 references
incremental trees
0 references
exact algorithm
0 references
