Finding maximum sum segments in sequences with uncertainty (Q2216439): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2020.11.005 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3105863903 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Lowest common ancestors in trees and directed acyclic graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays / 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 | |||
Latest revision as of 05:57, 24 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding maximum sum segments in sequences with uncertainty |
scientific article |
Statements
Finding maximum sum segments in sequences with uncertainty (English)
0 references
16 December 2020
0 references
sequences
0 references
maximum sum segments
0 references
uncertainty
0 references
