Calculating a linear-time solution to the densest-segment problem
From MaRDI portal
Publication:5371958
DOI10.1017/S095679681500026XzbMath1420.68239OpenAlexW2282029935MaRDI QIDQ5371958
Publication date: 23 October 2017
Published in: Journal of Functional Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s095679681500026x
Functional programming and lambda calculus (68N18) Data structures (68P05) Online algorithms; streaming algorithms (68W27) Algorithms on strings (68W32)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Left-bottom and right-top segments
- Small programming exercises 20
- Longest segment problems
- Formal program development. IFIP TC2/WG 2.1 State-of-the-Art report
- Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications
- Finger trees: a simple general-purpose data structure
- Algebra of programming in Agda: Dependent types for relational program derivation
- An Optimal Algorithm for the Maximum-Density Segment Problem
- Purely Functional Data Structures
- Algorithms - ESA 2003
This page was built for publication: Calculating a linear-time solution to the densest-segment problem