scientific article; zbMATH DE number 776086
zbMATH Open0821.92011MaRDI QIDQ4840106FDOQ4840106
Publication date: 27 September 1995
Title of this publication is not available (Why is that?)
Recommendations
computational complexityDNA sequencesapproximation algorithmaverage-case analysislongest common subsequencemultiple sequence alignmentshortest common superstringshortest common supersequencemolecular biologyprotein sequencesoptimal alignmentchromosome inversions
Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Biochemistry, molecular biology (92C40) Abstract computational complexity for mathematical programming problems (90C60)
Cited In (12)
- Weighted sequence graphs: Boosting iterated dynamic programming using locally suboptimal solutions
- On some optimization problems in molecular biology
- Optimization of biochemical systems through mathematical programming: methods and applications
- Rearrangement of DNA fragments: a branch-and-cut algorithm.
- On optimization of bio‐probes
- Title not available (Why is that?)
- Combinatorics of genome rearrangements.
- Aligning two fragmented sequences
- Non-overlapping common substrings allowing mutations
- Mathematical challenges from genomics and molecular biology
- Title not available (Why is that?)
- An application of nonlinear optimization in molecular biology
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4840106)