Finding a length-constrained maximum-density path in a tree (Q1781798): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On computing all suboptimal alignments / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4410125 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Linear-time algorithm for finding a maximum-density segment of a sequence / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An efficient algorithm for the length-constrained heaviest path problem on a tree / rank | |||
Normal rank | |||
Latest revision as of 12:12, 10 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding a length-constrained maximum-density path in a tree |
scientific article |
Statements
Finding a length-constrained maximum-density path in a tree (English)
0 references
8 June 2005
0 references
algorithm
0 references
computational biology
0 references
network design
0 references
tree
0 references
