A geometric framework for solving subsequence problems in computational biology efficiently
From MaRDI portal
Publication:3602889
zbMATH Open1221.68256MaRDI QIDQ3602889FDOQ3602889
Authors: Thorsten Bernholt, Friedrich Eisenbrand, Thomas Hofmeister 
Publication date: 12 February 2009
Recommendations
- Constrained Minkowski sums: A geometric framework for solving interval problems in computational biology efficiently
- A simple algorithm for the constrained sequence problems
- Constrained sequence analysis algorithms in computational biology
- A fast algorithm of constrained longest common subsequence
- Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis.
Cited In (7)
- On locating disjoint segments with maximum sum of densities
- Constrained Minkowski sums: A geometric framework for solving interval problems in computational biology efficiently
- A geometric interpretation of the multiresolution criterion in nonparametric regression
- Finding long and similar parts of trajectories
- Optimal algorithms for the average-constrained maximum-sum segment problem
- Optimal eviction policies for stochastic address traces
- Subsequence Combinatorics and Applications to Microarray Production, DNA Sequencing and Chaining Algorithms
Uses Software
This page was built for publication: A geometric framework for solving subsequence problems in computational biology efficiently
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3602889)
