Scholars Central

Conference abstractPublished 2 Jul 2012

Solving shortest hamilinion path problem using DNA computing

Authors: Hala Mohammed, Alshamlan Mohammed, El Bachir Menai

Ask about this article

Abstract

Select any words in the title or abstract, or press this and choose a sentence.

DNA computing fundamentally being similar to parallel computing provides a nice way to make trillions of similar calculations in a moment. DNA computing have solve main and important NP-complete problems such as Hamilton Path Problem, 3-SAT Problem, and Maximum Clique Problem. In this paper we apply DNA computing to solve Shortest Hamiltonian Path Problem using two steps. First one, determine all Hamilton path from specific weighted graph, and then in second step we select the shortest one and return it assolution of our problem.

Ask about this article

Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.

Try:

Similar by topic

More from this journal

The newest in Journal of Proteomics & Bioinformatics.

All its articles

Conferences in this field

Upcoming conferences in this field.

Follow

New articles from what you follow go into your email digest, once you agree to alert emails.

  • JournalJournal of Proteomics & Bioinformatics
  • SubjectBiochemistry & Biotechnology
  • BylineArticles whose byline prints “Hala Mohammed”
  • BylineArticles whose byline prints “Alshamlan Mohammed”
  • BylineArticles whose byline prints “El Bachir Menai”

For authors and organisers

Publish, present and keep up with your field

Find the right journal for your paper and submit your manuscript.

Photo: Pexels