An Algorithm for a Generalized Maximum Subsequence Problem

DOI10.1007/11682462_20zbMath1145.68582OpenAlexW1481901482MaRDI QIDQ3525758

Thomas Hofmeister, Thorsten Bernholt

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)

Related Items (4)

Nonparametric regression, confidence regions and regularization ⋮ Two parallel algorithms for finding all minimal maximum subsequences ⋮ Residual-based localization and quantification of peaks in X-ray diffractograms ⋮ Constrained Minkowski sums: A geometric framework for solving interval problems in computational biology efficiently

Uses Software

• ftnonpar

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