Selected combinatorial problems of computational biology

DOI10.1016/J.EJOR.2003.10.054zbMATH Open1176.90484OpenAlexW1974908481WikidataQ57387787 ScholiaQ57387787MaRDI QIDQ706944FDOQ706944

Authors Jacek Blazewicz, Piotr Formanowicz, Marta Kasprzak 

Publication date 9 February 2005

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2003.10.054

zbMATH Keywords

DNA sequencing by hybridizationGenome mappingSequence alignmentSequence assembling

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Genetics and epigenetics (92D10) Combinatorial optimization (90C27)

Recommendations

• On some optimization problems in molecular biology
• Opportunities for combinatorial optimization in computational biology
• scientific article; zbMATH DE number 5310719
• scientific article; zbMATH DE number 863508
• scientific article; zbMATH DE number 1154743

Cites Work

• scientific article; zbMATH DE number 699389 (Why is no real title available?)
• scientific article; zbMATH DE number 1557065 (Why is no real title available?)
• scientific article; zbMATH DE number 3095523 (Why is no real title available?)
• A partial digest approach to restriction site mapping
• Algorithms on Strings, Trees and Sequences
• Complexity of DNA sequencing by hybridization.
• DNA sequencing-tabu and scatter search combined
• Hybrid genetic algorithm for DNA sequencing with errors
• Incidence matrices and interval graphs
• Maximum likelihood genetic sequence reconstruction from oligo content
• Multiple solutions of DNA restriction mapping problems
• On some properties of DNA graphs
• On the recognition of de Bruijn graphs and their induced subgraphs
• On-line construction of suffix trees
• Recognizing DNA graphs is difficult.
• The selective travelling salesman problem

Cited In (17)

• An analytical comparison of the LP relaxations of integer models for the \(k\)-club problem
• Some experiences with solving semidefinite programming relaxations of binary quadratic optimization models in computational biology
• Graph-Theoretic Concepts in Computer Science
• The triangle \(k\)-club problem
• The combinatorics of modeling and analyzing biological systems
• Opportunities for combinatorial optimization in computational biology
• Combinatorics of genome rearrangements.
• The simplified partial digest problem: approximation and a graph-theoretic model
• Two-phase heuristics for the \(k\)-club problem
• Some operations research methods for analyzing protein sequences and structures
• Improved approaches to solve the one-to-one skewgram problem
• Upper bounds and heuristics for the 2-club problem
• Clique-detection models in computational biochemistry and genomics
• Title not available (Why is no real title available?)
• Genetic and tabu search algorithms for peptide assembly problem
• Integer models and upper bounds for the 3-club problem
• Complexity issues in computational biology

This page was built for publication: Selected combinatorial problems of computational biology

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q706944)