scientific article; zbMATH DE number 776086

MaRDI QIDQ4840106zbMATH OpenFDO

Authors Tao Jiang, Ming Li

Publication date 27 September 1995

zbMATH Keywords

computational complexityDNA sequencesapproximation algorithmaverage-case analysislongest common subsequencemultiple sequence alignmentshortest common superstringshortest common supersequencemolecular biologyprotein sequencesoptimal alignmentchromosome inversions

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Biochemistry, molecular biology (92C40) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• On some optimization problems in molecular biology
• scientific article; zbMATH DE number 1154743
• The Multiple Sequence Alignment Problem in Biology
• scientific article; zbMATH DE number 5310719
• Selected combinatorial problems of computational biology

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
• scientific article; zbMATH DE number 5310719 (Why is no real title available?)
• Aligning two fragmented sequences
• Combinatorics of genome rearrangements.
• Non-overlapping common substrings allowing mutations
• Mathematical challenges from genomics and molecular biology
• scientific article; zbMATH DE number 735214 (Why is no real title available?)
• 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)