Algorithms for finding the weight-constrained \(k\) longest paths in a tree and the length-constrained \(k\) maximum-sum segments of a sequence (Q955012)
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 5368342
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for finding the weight-constrained \(k\) longest paths in a tree and the length-constrained \(k\) maximum-sum segments of a sequence |
scientific article; zbMATH DE number 5368342 |
Statements
Algorithms for finding the weight-constrained \(k\) longest paths in a tree and the length-constrained \(k\) maximum-sum segments of a sequence (English)
0 references
18 November 2008
0 references
sequence analysis
0 references
0 references
0 references
0 references
0 references
0 references
0.8372399806976318
0 references
0.80401211977005
0 references
0.7993258237838745
0 references
0.7931761741638184
0 references
