Computing Maximum-Scoring Segments in Almost Linear Time

DOI10.1007/11809678_28zbMath1163.68322OpenAlexW2152650440MaRDI QIDQ3591343

Jingsen Chen, Fredrik Bengtsson

Publication date: 10 September 2007

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

Full work available at URL: http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-25447

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Protein sequences, DNA sequences (92D20)

Related Items (3)

Encodings of Range Maximum-Sum Segment Queries and Applications ⋮ Rectangle blanket problem: binary integer linear programming formulation and solution algorithms ⋮ Homogeneous string segmentation using trees and weighted independent sets

This page was built for publication: Computing Maximum-Scoring Segments in Almost Linear Time