An Algorithm for a Generalized Maximum Subsequence Problem

DOI10.1007/11682462_20MaRDI QIDQ3525758zbMATH OpenOpenAlexFDO

Authors Thorsten Bernholt, Thomas Hofmeister

Publication date 18 September 2008

Published in LATIN 2006: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11682462_20

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05)

Recommendations

• Efficient algorithms for \(k\) maximum sums
• Algorithms and Computation
• An optimal algorithm for maximum-sum segment and its application in bioinformatics (extended abstract)
• Fast algorithms for the maximum convolution problem
• scientific article; zbMATH DE number 1303586

Cited in

(8)

• Constrained Minkowski sums: A geometric framework for solving interval problems in computational biology efficiently
• A generalized insertion algorithm for the seriation problem
• Fast algorithms for the maximum convolution problem
• Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence
• Two parallel algorithms for finding all minimal maximum subsequences
• Finding the maximum subsequence sum on interconnection networks
• Nonparametric regression, confidence regions and regularization
• Residual-based localization and quantification of peaks in X-ray diffractograms

Describes a project that uses

Uses Software

• ftnonpar

This page was built for publication: An Algorithm for a Generalized Maximum Subsequence Problem

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