Please use this identifier to cite or link to this item: http://repositorio.unicamp.br/jspui/handle/REPOSIP/59720
Full metadata record
DC FieldValueLanguage
dc.contributor.CRUESPUniversidade Estadual de Campinaspt_BR
dc.typeArtigo de periódicopt_BR
dc.titlePhylogenetic trees via Hamming distance decomposition testspt_BR
dc.contributor.authorAnselmo, CAFpt_BR
dc.contributor.authorPinheiro, Apt_BR
unicamp.author.emailpinheiro@ime.unicamp.brpt_BR
unicamp.authorAnselmo, Cezar A. F. Pinheiro, Aluisio Univ Estadual Campinas, IMECC, Dept Stat, BR-13083970 Campinas, SP, Brazilpt_BR
dc.subjectdissimilarity measurespt_BR
dc.subjectnon-parametric testspt_BR
dc.subjectquasi-U-statisticspt_BR
dc.subjectstatistical geneticspt_BR
dc.subjectU-statisticspt_BR
dc.subject.wosSequencespt_BR
dc.description.abstractThe 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.pt
dc.relation.ispartofJournal Of Statistical Computation And Simulationpt_BR
dc.relation.ispartofabbreviationJ. Stat. Comput. Simul.pt_BR
dc.publisher.cityAbingdonpt_BR
dc.publisher.countryInglaterrapt_BR
dc.publisherTaylor & Francis Ltdpt_BR
dc.date.issued2012pt_BR
dc.identifier.citationJournal Of Statistical Computation And Simulation. Taylor & Francis Ltd, v. 82, n. 9, n. 1287, n. 1297, 2012.pt_BR
dc.language.isoenpt_BR
dc.description.volume82pt_BR
dc.description.issuenumber9pt_BR
dc.description.firstpage1287pt_BR
dc.description.lastpage1297pt_BR
dc.rightsfechadopt_BR
dc.rights.licensehttp://journalauthors.tandf.co.uk/permissions/reusingOwnWork.asppt_BR
dc.sourceWeb of Sciencept_BR
dc.identifier.issn0094-9655pt_BR
dc.identifier.wosidWOS:000307948700004pt_BR
dc.identifier.doi10.1080/00949655.2011.576676pt_BR
dc.description.sponsorshipConselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)pt_BR
dc.description.sponsorshipFundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)pt_BR
dc.description.sponsorship1Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)pt_BR
dc.description.sponsorship1Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)pt_BR
dc.date.available2014-07-30T14:31:56Z
dc.date.available2015-11-26T16:44:01Z-
dc.date.accessioned2014-07-30T14:31:56Z
dc.date.accessioned2015-11-26T16:44:01Z-
dc.description.provenanceMade available in DSpace on 2014-07-30T14:31:56Z (GMT). No. of bitstreams: 0 Previous issue date: 2012en
dc.description.provenanceMade available in DSpace on 2015-11-26T16:44:01Z (GMT). No. of bitstreams: 0 Previous issue date: 2012en
dc.identifier.urihttp://www.repositorio.unicamp.br/jspui/handle/REPOSIP/59720
dc.identifier.urihttp://repositorio.unicamp.br/jspui/handle/REPOSIP/59720-
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
There are no files associated with this item.


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