A graph theoretical approach for node covering in tree based architectures and its application to bioinformatics

  • D. Angel Email author
Original Article


Investigation of DNA sequences is a paramount stage for apprehending biological structures and functions. The known methods for investigating DNA sequence alignments usually fail to produce an exact solution. Motivated by the problem of finding similarities in DNA and amino sequences, we study certain classes of phylogenetic trees and present an exact solution for the minimum node cover which can be used for genetic sequence comparisons. The smallest number of nodes removed to disconnect a graph \(G\) is the smallest node cover. In this paper, we address the problem of finding a minimum node cover for certain tree-derived architectures, namely, Hyper trees, Slim trees, \(X\) trees, \(l\)-sibling trees, and \(k\)-rooted sibling trees. Trees are advantageous in biology especially for bioinformatics, systematics, and phylogenetics. The smallest node cover set is the minimum number of nodes in a graph which monitors all the edges in the graph. Therefore, these sets are much useful in bioinformatics workflow management system. Moreover, our results can also be applied to identify genetic variants and to characterize common DNA variants.


Node cover Hyper tree Slim tree \(X\) tree \(l\)-sibling tree \(k\)-rooted sibling tree 



  1. Alimonti P, Kann V (2000) Some APX-completeness results for cubic graphs. Theor Comput Sci 237(1):123–134MathSciNetCrossRefGoogle Scholar
  2. Auyeung A, Abraham A (2004) The largest compatible subset problem for phylogenetic data, genetic and evolutionary computation 2004 conference (GECCO-2004), bird-of-a-feather workshop on application of hybrid evolutionary algorithms to complex optimization problems. Springer, Berlin, pp 1–11Google Scholar
  3. Babar ME, Pervez MT, Nadeem A, Hussain T, Aslam N (2014) Multiple sequence alignment tools: assessing performance of the underlying algorithms. J Appl Environ Biol Sci 4(8S):76–80Google Scholar
  4. Chen J, Kanj IA, Xia G (2010) Improved upper bounds for vertex cover. Theor Comput Sci 411:3736–3756MathSciNetCrossRefGoogle Scholar
  5. Chen J, Lin Y, Li J, Lin G, Ma Z, Tan A (2016) A rough set method for the minimum vertex cover problem of graphs”. Appl Soft Comput 42:360–367CrossRefGoogle Scholar
  6. Corel E, Pitschi F, Morgenstern B (2010) A min-cut algorithm for the consistency problem in multiple sequence alignment. Bioinformatics 26(8):1015–1021. CrossRefGoogle Scholar
  7. Fernau H, Fomin FV, Philip G, Saurabh S (2015) On the parameterized complexity of vertex cover and edge cover with connectivity constraints. Theor Comput Sci 565:1–15MathSciNetCrossRefGoogle Scholar
  8. Harary F (1993) Graph theory. Narosa Publishers, New Delhi, pp 21–23Google Scholar
  9. Hochbaum D (1983) Efficient bounds for the stable set, vertex cover and set packing problem. Discrete Appl Math 6(3):243–254MathSciNetCrossRefGoogle Scholar
  10. Jianhua T (2015) A fixed-parameter algorithm for the vertex cover P3 problem. Inf Process Lett 115(2):96–99CrossRefGoogle Scholar
  11. Kamath SS, Bhat RS (2007) On strong (weak) independent sets and vertex coverings of a graph. Discrete Math 307(9–10):1136–1145MathSciNetCrossRefGoogle Scholar
  12. Karakostas G (2005) A better approximation ratio for the vertex cover problem. In: Proceedings of the 32nd international colloquium, ICALP 2005, Lisbon, Portugal, July 11–15, pp 1043–1050Google Scholar
  13. Karakostas G (2009) A better approximation ratio for the vertex cover problem. ACM Trans Algorithms 5(4):1–8MathSciNetCrossRefGoogle Scholar
  14. Karp RM (1972) Reducibility among combinatorial problems, complexity of computer computations. Springer, Berlin, pp 85–103CrossRefGoogle Scholar
  15. Paul D, Rajasingh I, Rajan RS (2015) Tree derived architectures with decycling number equal to cycle packing number. Procedia Comput Sci 57:716–726CrossRefGoogle Scholar
  16. Wang Z, Huang D, Tang C (2013) Fast parallel algorithm to the minimum edge cover problem based on DNA molecular computation. Appl Math Inf Sci 7(2):711–716MathSciNetCrossRefGoogle Scholar
  17. Xu H, Kumar TS, Koenig S (2016) A new solver for the minimum weighted vertex cover problem, integration of AI and OR techniques in constraint programming, lecture notes in computer science, vol 9676, pp 392–405Google Scholar

Copyright information

© Springer-Verlag GmbH Austria, part of Springer Nature 2019

Authors and Affiliations

  1. 1.Department of MathematicsSathyabama Institute of Science and TechnologyChennaiIndia

Personalised recommendations