The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
A Molecular Solution to the Three-Partition Problem
|
|
Author(s): Maryam S. Nuser (Computer Information Systems Department, Yarmouk University, Irbid, Jordan)
Copyright: 2012
Volume: 5
Issue: 4
Pages: 16
Source title:
Journal of Information Technology Research (JITR)
Editor(s)-in-Chief: Wen-Chen Hu (University of North Dakota, USA)
DOI: 10.4018/jitr.2012100102
Purchase
|
Abstract
Given a set of numbers, the three-partition problem is to divide them into disjoint triplets that all have the same sum. The problem is NP-complete. This paper presents an algorithm to solve this problem using the biomolecular computing approach. The algorithm uses a distinctive encoding technique that depends on the numbers values which omits the need to an adder to find the sum. The algorithm is explained and an analysis of its complexity in terms of time, the number of strands, number of tubes, and the longest library strand used is presented. A simulation of the algorithm is implemented and tested. This algorithm further proves the ability of molecular computing in solving hard problems.
Related Content
|
Ran Geng.
© 2026.
16 pages.
|
|
Huawei Ding.
© 2026.
18 pages.
|
|
Danji Qu.
© 2026.
22 pages.
|
|
Chao Ye, Fei Fang, Nijia Zhang, Li Wang, Hang Wan.
© 2026.
24 pages.
|
|
Milan Kořínek, Kamila Štekerová.
© 2026.
28 pages.
|
|
Lili Liu.
© 2026.
21 pages.
|
|
Marek Zanker, Alzbeta Docekalova, Patrik Urbanik.
© 2026.
26 pages.
|
|
|