Genetic and tabu search algorithms for peptide assembly problem
From MaRDI portal
Recommendations
Cites work
- Combinatorial optimization in DNA mapping — a computational thread of the Simplified Partial Digest Problem
- scientific article; zbMATH DE number 5842463 (Why is no real title available?)
- scientific article; zbMATH DE number 699389 (Why is no real title available?)
- scientific article; zbMATH DE number 1557065 (Why is no real title available?)
- Selected combinatorial problems of computational biology
- Tabu Search—Part I
- Tabu Search—Part II
Cited in
(6)- Use of genetic algorithms and solvation potential to study peptides structure
- Determination of Binding Amino Acids Based on Random Peptide Array Screening Data
- Reverse de Bruijn: Utilizing Reverse Peptide Synthesis to Cover All Amino Acid k-mers
- The simplified partial digest problem: approximation and a graph-theoretic model
- Solving peptide sequencing as satisfiability
- Using genetic algorithm to design protein sequence
This page was built for publication: Genetic and tabu search algorithms for peptide assembly problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3561754)