| dc.creator | da Silva | |
| dc.creator | Eduardo Sant'Ana; Pedrini | |
| dc.creator | Helio | |
| dc.date | 2016 | |
| dc.date | mar | |
| dc.date | 2017-11-13T11:31:17Z | |
| dc.date | 2017-11-13T11:31:17Z | |
| dc.date.accessioned | 2018-03-29T05:46:16Z | |
| dc.date.available | 2018-03-29T05:46:16Z | |
| dc.identifier | Computers In Biology And Medicine. Pergamon-elsevier Science Ltd , v. 70, p. 51 - 57, 2016. | |
| dc.identifier | 0010-4825 | |
| dc.identifier | 1879-0534 | |
| dc.identifier | WOS:000371843100005 | |
| dc.identifier | 10.1016/j.compbiomed.2016.01.004 | |
| dc.identifier | http://www-sciencedirect-com.ez88.periodicos.capes.gov.br/science/article/pii/S0010482516000081 | |
| dc.identifier | http://repositorio.unicamp.br/jspui/handle/REPOSIP/325883 | |
| dc.identifier.uri | http://repositorioslatinoamericanos.uchile.cl/handle/2250/1362889 | |
| dc.description | Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP) | |
| dc.description | Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) | |
| dc.description | Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES) | |
| dc.description | 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. | |
| dc.description | 70 | |
| dc.description | 51 | |
| dc.description | 57 | |
| dc.description | FAPESP - Sao Paulo Research Foundation [2011/22749-8] | |
| dc.description | CNPq [307113/2012-4] | |
| dc.description | CAPES (DeepEyes Project) | |
| dc.description | Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP) | |
| dc.description | Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) | |
| dc.description | Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES) | |
| dc.language | English | |
| dc.publisher | Pergamon-Elsevier Science LTD | |
| dc.publisher | Oxford | |
| dc.relation | Computers in Biology and Medicine | |
| dc.rights | fechado | |
| dc.source | WOS | |
| dc.subject | Dna Sequence | |
| dc.subject | Hypercube | |
| dc.subject | Independent Spanning Trees | |
| dc.subject | E-cube | |
| dc.subject | Pattern Recognition | |
| dc.title | Inferring Patterns In Mitochondrial Dna Sequences Through Hypercube Independent Spanning Trees | |
| dc.type | Artículos de revistas | |
