کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
6920916 864480 2016 7 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Inferring patterns in mitochondrial DNA sequences through hypercube independent spanning trees
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نرم افزارهای علوم کامپیوتر
پیش نمایش صفحه اول مقاله
Inferring patterns in mitochondrial DNA sequences through hypercube independent spanning trees
چکیده انگلیسی
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≠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.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers in Biology and Medicine - Volume 70, 1 March 2016, Pages 51-57
نویسندگان
, ,