首页> 外文期刊>Network Modeling Analysis in Health Informatics and Bioinformatics >A graph theoretical approach for node covering in tree based architectures and its application to bioinformatics
【24h】

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

机译:基于树的架构中节点覆盖的图表理论方法及其在生物信息学的应用

获取原文
获取原文并翻译 | 示例
           

摘要

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.
机译:对DNA序列的研究是令人思索的生物学结构和功能的最重要的阶段。用于研究DNA序列比对的已知方法通常不能产生精确的溶液。通过发现DNA和氨基序列中的相似性的问题,我们研究了某些类别的系统发育树,并对最小节点盖进行了精确的解决方案,其可用于遗传序列比较。删除的最小节点以断开图G是最小的节点盖。在本文中,我们解决了为某些树衍生的架构找到最小节点盖的问题,即超树,纤薄的树木,X树,L-兄弟树和K根兄弟树。树木在生物学中是有利的,特别是对生物信息学,系统性和系统源。最小的节点覆盖集是图表中的图表中的最小节点数量,其监视图中的所有边缘。因此,这些组在生物信息学工作流管理系统中非常有用。此外,我们的结果也可以应用于鉴定遗传变异性并表征常见的DNA变体。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号