Please use this identifier to cite or link to this item:
Type: Artigo de periódico
Title: Inferring Patterns In Mitochondrial Dna Sequences Through Hypercube Independent Spanning Trees.
Author: Silva, Eduardo Sant׳Ana da
Pedrini, Helio
Abstract: 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.
Subject: Dna Sequence
Independent Spanning Trees
Pattern Recognition
Citation: Computers In Biology And Medicine. v. 70, p. 51-57, 2016-Jan.
Rights: embargo
Identifier DOI: 10.1016/j.compbiomed.2016.01.004
Date Issue: 2016
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
File SizeFormat 
pmed_26802544.pdf825.9 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.