Parametric optimization of sequence alignment
DOI10.1007/BF01185430zbMath0802.92016OpenAlexW2018885841MaRDI QIDQ1336962
K. Balasubramanian, Dan Gusfield, Dalit Naor
Publication date: 8 November 1994
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01185430
dynamic programmingDNA sequencesgapsmismatchesspacesconvex decompositionlocal alignmentvariable weightsamino acid sequencesmatchesglobal alignmentoptimal sequence alignmentcomputer program PARALparametric sequence alignmentsequence homologyweighted minimum edit distance
Applications of mathematical programming (90C90) Abstract computational complexity for mathematical programming problems (90C60) Protein sequences, DNA sequences (92D20) Computational methods for problems pertaining to biology (92-08)
Related Items (13)
Cites Work
- Optimal sequence alignment allowing for long gaps
- An Overview of Sequence Comparison: Time Warps, String Edits, and Macromolecules
- Parametric Combinatorial Computing and a Problem of Program Module Distribution
- Combinatorial Optimization with Rational Objective Functions
- Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases
- Unnamed Item
This page was built for publication: Parametric optimization of sequence alignment