Skip to main content

DNA Computation Based Clustering Algorithm

  • Conference paper
Advances in Swarm Intelligence (ICSI 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8794))

Included in the following conference series:

  • 2697 Accesses

Abstract

Using DNA computation to solve clustering problem is a new approach in this field. In the process of problem solving, we use DNA strands to assign vertices and edges, constructing the shortest Hamilton path and cutting branches whose length is longer than the threshold we gave getting the initial clustering result. For improving the quality, we do the iterative calculation, getting clusters for every produced cluster, we deal all of the process with DNA computation in test tubes, reducing the time complexity obviously by DNAs high parallelism. In this paper, we give the process and analysis of our algorithm, illustrating the feasibility of the method.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Xue, J., Liu, X.: Applying dna computation to clustering in graph. In: 2011 2nd International Conference on Artificial Intelligence, Management Science and Electronic Commerce (AIMSEC), pp. 986–989 (2011)

    Google Scholar 

  2. Rooß, D.: Recent developments in dna-computing. In: Proceedings of the 27th International Symposium on Multiple-Valued Logic, pp. 3–9. IEEE (1997)

    Google Scholar 

  3. Yin, Z.: Using DNA computation to solve graph and combinatorial optimization problem. Science Publication (2004)

    Google Scholar 

  4. Hao, F., Wang, S., Qiang, X.: Models of DNA computation. Tsinghua University Press, Beijing (2010)

    Google Scholar 

  5. Bakar, R.B.A., Watada, J., Pedrycz, W.: Dna approach to solve clustering problem based on a mutual order. Biosystems 91(1), 1–12 (2008)

    Article  Google Scholar 

  6. Yin, Z.: DNA computation in graph and combinational problems. Science Press, Beijing (2004)

    Google Scholar 

  7. Zhang, H., Liu, X.: A clique algorithm using dna computing techniques based on closed-circle dna sequences. Biosystems 105(1), 73–82 (2011)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Kang, Z., Liu, X., Xue, J. (2014). DNA Computation Based Clustering Algorithm. In: Tan, Y., Shi, Y., Coello, C.A.C. (eds) Advances in Swarm Intelligence. ICSI 2014. Lecture Notes in Computer Science, vol 8794. Springer, Cham. https://doi.org/10.1007/978-3-319-11857-4_53

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-11857-4_53

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-11856-7

  • Online ISBN: 978-3-319-11857-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics