Pages that link to "Item:Q3082960"
From MaRDI portal
The following pages link to Fast and Space-Efficient Location of Heavy or Dense Segments in Run-Length Encoded Sequences (Q3082960):
Displaying 3 items.
- Searching a bitstream in linear time for the longest substring of any given density (Q644795) (← links)
- Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications (Q1776373) (← links)
- Testing Stream Ciphers by Finding the Longest Substring of a Given Density (Q3634488) (← links)
