Fast and Space-Efficient Location of Heavy or Dense Segments in Run-Length Encoded Sequences

DOI10.1007/3-540-45071-8_53zbMath1276.68179OpenAlexW1494238107MaRDI QIDQ3082960

Ronald I. Greenberg

Publication date: 18 March 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-45071-8_53

zbMATH Keywords

image processingdata compressionbioinformaticsbiomolecular sequence analysismaximum consecutive subsequence summaximum-density segments

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computing methodologies for image processing (68U10) Biomedical imaging and signal processing (92C55) Protein sequences, DNA sequences (92D20) Algorithms on strings (68W32)

Related Items (3)

Searching a bitstream in linear time for the longest substring of any given density ⋮ Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications ⋮ Testing Stream Ciphers by Finding the Longest Substring of a Given Density

This page was built for publication: Fast and Space-Efficient Location of Heavy or Dense Segments in Run-Length Encoded Sequences