dc.creatorAnselmo, CAF
dc.creatorPinheiro, A
dc.date2012
dc.date2014-07-30T14:31:56Z
dc.date2015-11-26T16:44:01Z
dc.date2014-07-30T14:31:56Z
dc.date2015-11-26T16:44:01Z
dc.date.accessioned2018-03-28T23:29:14Z
dc.date.available2018-03-28T23:29:14Z
dc.identifierJournal Of Statistical Computation And Simulation. Taylor & Francis Ltd, v. 82, n. 9, n. 1287, n. 1297, 2012.
dc.identifier0094-9655
dc.identifierWOS:000307948700004
dc.identifier10.1080/00949655.2011.576676
dc.identifierhttp://www.repositorio.unicamp.br/jspui/handle/REPOSIP/59720
dc.identifierhttp://repositorio.unicamp.br/jspui/handle/REPOSIP/59720
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1273781
dc.descriptionConselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
dc.descriptionFundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
dc.descriptionThe paper considers the problem of phylogenetic tree construction. Our approach to the problem bases itself on a non-parametric paradigm seeking a model-free construction and symmetry on Types I and II errors. Trees are constructed through sequential tests using Hamming distance dissimilarity measures, from internal nodes to the tips. The method presents some novelties. The first, which is an advantage over the traditional methods, is that it is very fast, computationally efficient and feasible to be used for very large data sets. Two other novelties are its capacity to deal directly with multiple sequences per group (and built its statistical properties upon this richer information) and that the best tree will not have a predetermined number of tips, that is, the resulting number of tips will be statistically meaningful. We apply the method in two data sets of DNA sequences, illustrating that it can perform quite well even on very unbalanced designs. Computational complexities are also addressed. Supplemental materials are available online.
dc.description82
dc.description9
dc.description1287
dc.description1297
dc.descriptionConselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
dc.descriptionFundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
dc.descriptionConselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
dc.descriptionFundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
dc.languageen
dc.publisherTaylor & Francis Ltd
dc.publisherAbingdon
dc.publisherInglaterra
dc.relationJournal Of Statistical Computation And Simulation
dc.relationJ. Stat. Comput. Simul.
dc.rightsfechado
dc.rightshttp://journalauthors.tandf.co.uk/permissions/reusingOwnWork.asp
dc.sourceWeb of Science
dc.subjectdissimilarity measures
dc.subjectnon-parametric tests
dc.subjectquasi-U-statistics
dc.subjectstatistical genetics
dc.subjectU-statistics
dc.subjectSequences
dc.titlePhylogenetic trees via Hamming distance decomposition tests
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución