期刊
COMPUTERS IN BIOLOGY AND MEDICINE
卷 70, 期 -, 页码 51-57出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.compbiomed.2016.01.004
关键词
DNA sequence; Hypercube; Independent spanning trees; E-cube; Pattern recognition
类别
资金
- FAPESP - Sao Paulo Research Foundation [2011/22749-8]
- CNPq [307113/2012-4]
- CAPES (DeepEyes Project)
Given a graph G, a set of spanning trees rooted at a vertex r of G is said vertex/edge independent if, for each vertex v of G, v not equal r, the paths of r to v in any pair of trees are vertex/edge disjoint. Independent spanning trees (ISTs) provide a number of advantages in data broadcasting due to their fault tolerant properties. For this reason, some studies have addressed the issue by providing mechanisms for constructing independent spanning trees efficiently. In this work, we investigate how to construct independent spanning trees on hypercubes, which are generated based upon spanning binomial trees, and how to use them to predict mitochondrial DNA sequence parts through paths on the hypercube. The prediction works both for inferring mitochondrial DNA sequences comprised of six bases as well as infer anomalies that probably should not belong to the mitochondrial DNA standard. (C) 2016 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据