Finding maximum sum segments in sequences with uncertainty

DOI10.1016/J.TCS.2020.11.005MaRDI QIDQ2216439zbMATH OpenOpenAlexFDO

Authors Hung-I Yu, Tien-Ching Lin, Der-Tsai Lee

Publication date 16 December 2020

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2020.11.005

zbMATH Keywords

uncertaintysequencesmaximum sum segments

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Analysis of algorithms (68W40) Algorithms on strings (68W32)

Recommendations

• Finding maximum sum segments in sequences with uncertainty
• Algorithms and Computation
• Efficient algorithms for the sum selection problem and \(k\) maximum sums problem
• Randomized algorithm for the sum selection problem
• Efficient Algorithms for the Sum Selection Problem and K Maximum Sums Problem

Cites work

• Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis.
• Lowest common ancestors in trees and directed acyclic graphs
• Space-efficient preprocessing schemes for range minimum queries on static arrays

Cited in

(1)

• Finding maximum sum segments in sequences with uncertainty

This page was built for publication: Finding maximum sum segments in sequences with uncertainty

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