Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Network Modeling Analysis in Health Informatics and Bioinformatics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
