Solving the Maximum Weighted Clique Problem Based on Parallel Biological Computing Model

No abstract is available for this paper.

• Publication year

  2015

• Venue

  Mathematical Problems in Engineering

• Publication date

  2015-06-23

• Fields of study

  Biology, Mathematics, Computer Science

• Identifiers
  DOI 10.1155/2015/275019
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A biological algorithm to solve the assignment problem based on DNA molecules computation

  2014cited by this paper
• A new fast algorithm for solving the minimum spanning tree problem based on DNA molecules computation

  2013cited by this paper
• Mathematical modeling of left ventricular dimensional changes in mice during aging

  2012cited by this paper
• Fast Parallel DNA-Based Algorithms for Molecular Computation: Quadratic Congruence and Factoring Integers

  2012cited by this paper
• Mathematical modeling and stability analysis of macrophage activation in left ventricular remodeling post-myocardial infarction

  2012cited by this paper
• Genetic Algorithm Optimized CCEM for Complex Topology

  2012cited by this paper
• Solving traveling salesman problem in the Adleman-Lipton model

  2012cited by this paper
• A conceptual cellular interaction model of left ventricular remodelling post-MI: dynamic network with exit-entry competition strategy

  2010cited by this paper
• Solving the minimum bisection problem using a biologically inspired computational model

  2010cited by this paper
• Solving the SAT problem using a DNA computing algorithm based on ligase chain reaction

  2008cited by this paper
• Springer

  2006cited by this paper
• A DNA procedure for solving the shortest path problem

  2006cited by this paper
• DNA ternary addition

  2006cited by this paper
• Fast parallel molecular algorithms for DNA-based computation: factoring integers

  2005cited by this paper
• Is optimal solution of every NP-complete or NP-hard problem determined from its characteristic for DNA-based computing.

  2005cited by this paper
• Procedures For Logic And Arithmetic Operations With Dna Molecules

  2004cited by this paper
• Fast parallel molecular algorithms for DNA-based computation: factoring integers

  2004cited by this paper
• Strand design for biomolecular computation

  2002cited by this paper
• Solution of a Satisfiability Problem on a Gel-Based DNA Computer

  2000cited by this paper
• DNA solution of hard computational problems.

  1995influential reference
• Molecular computation of solutions to combinatorial problems.

  1994influential reference
• and as an in

  year unknowncited by this paper

• Information analysis to study interactions between different genes and diseases

  2017cites this paper