Tree searches under Sankoff parsimony

被引：0

作者：

Goloboff, PA ^{[1
]}

机构：

[1] Consejo Nacl Invest Cient & Tecn, Inst Miguel Lillo, RA-4000 San Miguel De Tucuman, Tucuman, Argentina

来源：

CLADISTICS | 1998年 / 14卷 / 03期

关键词：

D O I：

暂无

中图分类号：

Q [生物科学];

学科分类号：

07 ; 0710 ; 09 ;

摘要：

Algorithms to speed up tree searches under Sankoff parsimony are described. For T terminal taxa, an exact algorithm allows calculating length during searches T to 2T times faster than a complete down-pass optimization. An approximate but accurate method is from 3T to 8T times faster than a down-pass. Other algorithms that provide additional increases of speed for simple symmetrical transformation costs are described. (C) 1998 The Willi Hennig Society.

引用

页码：229 / 237

页数：9

共 50 条

[31] Analysis of the distribution of bootstrap tree lengths using the maximum parsimony method
Bhattacharya, D
MOLECULAR PHYLOGENETICS AND EVOLUTION, 1996, 6 (03) : 339 - 350
[32] MPBoot: fast phylogenetic maximum parsimony tree inference and bootstrap approximation
Diep Thi Hoang
Le Sy Vinh
Flouri, Tomas
Stamatakis, Alexandros
von Haeseler, Arndt
Bui Quang Minh
BMC EVOLUTIONARY BIOLOGY, 2018, 18
[33] Gene tree parsimony vs. uninode coding for phylogenetic reconstruction
Cotton, JA
Page, RDM
MOLECULAR PHYLOGENETICS AND EVOLUTION, 2003, 29 (02) : 298 - 308
[34] Use of mitogenomic information in teleostean molecular phylogenetics: A tree-based exploration under the maximum-parsimony optimality criterion
Miya, M
Nishida, M
MOLECULAR PHYLOGENETICS AND EVOLUTION, 2000, 17 (03) : 437 - 455
[35] Application of tree-based searches to Matching Pursuit
Cotter, SF
Rao, BD
2001 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, VOLS I-VI, PROCEEDINGS: VOL I: SPEECH PROCESSING 1; VOL II: SPEECH PROCESSING 2 IND TECHNOL TRACK DESIGN & IMPLEMENTATION OF SIGNAL PROCESSING SYSTEMS NEURALNETWORKS FOR SIGNAL PROCESSING; VOL III: IMAGE & MULTIDIMENSIONAL SIGNAL PROCESSING MULTIMEDIA SIGNAL PROCESSING, 2001, : 3933 - 3936
[36] Biliary Tree of Knowledge: Assessing Cholecystitis Google Searches
Van Vleet, Jared
Phelps, Cole
Hughes, Griffin K.
Shepard, Samuel
Sharp, Ali
Potter, Isaac
Diener, Brian C.
Vassar, Matt
JOURNAL OF THE AMERICAN COLLEGE OF SURGEONS, 2023, 237 (05) : S282 - S283
[37] Searches on a binary tree with random edge-weights
Stacey, A
COMBINATORICS PROBABILITY & COMPUTING, 1999, 8 (06): : 555 - 565
[38] A practical suffix-tree implementation for string searches
Dorohonceanu, B
Nevill-Manning, C
DR DOBBS JOURNAL, 2000, 25 (07): : 133 - +
[39] Application of tree-based searches to Matching Pursuit
Cotter, SF
Rao, B
2001 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, VOLS I-VI, PROCEEDINGS: VOL I: SPEECH PROCESSING 1; VOL II: SPEECH PROCESSING 2 IND TECHNOL TRACK DESIGN & IMPLEMENTATION OF SIGNAL PROCESSING SYSTEMS NEURALNETWORKS FOR SIGNAL PROCESSING; VOL III: IMAGE & MULTIDIMENSIONAL SIGNAL PROCESSING MULTIMEDIA SIGNAL PROCESSING - VOL IV: SIGNAL PROCESSING FOR COMMUNICATIONS; VOL V: SIGNAL PROCESSING EDUCATION SENSOR ARRAY & MULTICHANNEL SIGNAL PROCESSING AUDIO & ELECTROACOUSTICS; VOL VI: SIGNAL PROCESSING THEORY & METHODS STUDENT FORUM, 2001, : 4045 - 4045
[40] PHYLOGENETIC ANALYSIS OF THE AQUATIC OLIGOCHAETA UNDER THE PRINCIPLE OF PARSIMONY
ERSEUS, C
HYDROBIOLOGIA, 1987, 155 : 75 - 89

← 1 2 3 4 5 →