2001
DOI: 10.1080/10635150119012
|View full text |Cite
|
Sign up to set email alerts
|

Changing the Landscape: A New Strategy for Estimating Large Phylogenies

Abstract: In this paper we describe a new heuristic strategy designed to find optimal (parsimonious) trees for data sets with large numbers of taxa and characters. This new strategy uses an iterative searching process of branch swapping with equally weighted characters, followed by swapping with reweighted characters. This process increases the efficiency of the search because, after each round of swapping with reweighted characters, the subsequent swapping with equal weights will start from a different group (island) o… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
34
0

Year Published

2001
2001
2007
2007

Publication Types

Select...
6
2
1

Relationship

2
7

Authors

Journals

citations
Cited by 36 publications
(34 citation statements)
references
References 17 publications
0
34
0
Order By: Relevance
“…We estimated phylogenies using maximum parsimony (MP) in PAUP Ã version 4.0b10 (Swofford 2002). We treated gaps as missing data and, following Quicke et al (2001), conducted an initial heuristic search with 10 000 random additions and TBR branch swapping, holding one tree per replicate. We then used the trees generated by the initial search as starting trees for a second heuristic search, in which we saved multiple trees.…”
Section: (B) Molecular Methodsmentioning
confidence: 99%
“…We estimated phylogenies using maximum parsimony (MP) in PAUP Ã version 4.0b10 (Swofford 2002). We treated gaps as missing data and, following Quicke et al (2001), conducted an initial heuristic search with 10 000 random additions and TBR branch swapping, holding one tree per replicate. We then used the trees generated by the initial search as starting trees for a second heuristic search, in which we saved multiple trees.…”
Section: (B) Molecular Methodsmentioning
confidence: 99%
“…Searches were carried out to the limit allowed by computer memory. No shorter trees were recovered by using the iterative reweighting strategy proposed by Quicke et al (2001). The largest numbers of trees from analyses I and II are identical (341 200), and correspond to the maximum number of trees that could be stored at the end of the tree search.…”
Section: Data Matrix Processingmentioning
confidence: 99%
“…This strategy (see Quicke et al 2000) allows searching in a wide area of tree space and maximises chances of finding multiple islands of equally parsimonious trees (Maddison 1991;Goloboff 1999). Thereafter, all trees from the different islands were used as starting trees for further TBR searches with maxtrees effectively unlimited.…”
Section: Separate Male and Female Analyses (Analyses 1 And 2)mentioning
confidence: 99%