Computing Maximum-Scoring Segments in Almost Linear Time

DOI10.1007/11809678_28MaRDI QIDQ3591343zbMATH OpenOpenAlexFDO

Authors Fredrik Bengtsson, Jingsen Chen

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)

Recommendations

• An optimal algorithm for maximum-sum segment and its application in bioinformatics (extended abstract)
• Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications
• On Locating Disjoint Segments with Maximum Sum of Densities
• Algorithms for Computing the Length-Constrained Max-Score Segments with Applications to DNA Copy Number Data Analysis
• scientific article; zbMATH DE number 1945161

Cited in

(7)

• Rectangle blanket problem: binary integer linear programming formulation and solution algorithms
• Encodings of range maximum-sum segment queries and applications
• Algorithms for Computing the Length-Constrained Max-Score Segments with Applications to DNA Copy Number Data Analysis
• Algorithms and Computation
• Linear time maximum segmentation problems in column stream model
• Left-bottom and right-top segments
• Homogeneous string segmentation using trees and weighted independent sets

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3591343)