2011
DOI: 10.1111/j.1096-0031.2010.00318.x
|View full text |Cite
|
Sign up to set email alerts
|

Phylogenetic morphometrics (II): algorithms for landmark optimization

Abstract: This paper describes algorithms for optimizing two-or three-dimensional landmark data onto trees directly. The method is based on a first approximation using grids, and subsequent iterative refinement of the initial point estimates. Details of the implementation are discussed, as well as an empirical example.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
65
0
1

Year Published

2011
2011
2020
2020

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 59 publications
(66 citation statements)
references
References 19 publications
0
65
0
1
Order By: Relevance
“…Finding the point positions that, for a given tree, minimize the total displacements between all ancestor/descendant points for the given landmark is considerably more difficult than for only three nodes, even for binary trees. Suffice it to say here that Goloboff and Catalano (in press) have developed and incorporated into TNT (Goloboff et al., 2003, 2008) heuristic methods (based on a Sankoff approximation as a first step, and a final iterative refinement), which produce a good approximation to the optimum. The problem is related to the problem of Euclidean Steiner trees.…”
Section: Description Of the Approachmentioning
confidence: 99%
See 2 more Smart Citations
“…Finding the point positions that, for a given tree, minimize the total displacements between all ancestor/descendant points for the given landmark is considerably more difficult than for only three nodes, even for binary trees. Suffice it to say here that Goloboff and Catalano (in press) have developed and incorporated into TNT (Goloboff et al., 2003, 2008) heuristic methods (based on a Sankoff approximation as a first step, and a final iterative refinement), which produce a good approximation to the optimum. The problem is related to the problem of Euclidean Steiner trees.…”
Section: Description Of the Approachmentioning
confidence: 99%
“…Therefore the steps to perform a phylogenetic analysis from aligned specimens will be (i) optimize each landmark, finding optimal ancestral positions, (ii) calculate its score, (iii) divide the score of each landmark by the number of landmarks in the configuration, (iv) sum the scores of each configuration (possibly taking into account scale and/or units of measurement; see Goloboff and Catalano, in press), (v) sum this score with the remainder of the scores of other characters to obtain the final score of the tree.…”
Section: Description Of the Approachmentioning
confidence: 99%
See 1 more Smart Citation
“…Because GM deals with coordinate data as opposed to the interlandmark distances of standard morphometrics, it allows patterns of variation in shape to be easily visualized (Bookstein 1991;Zelditch et al 2004;Slice 2007). Certain kinds of GM data can be used under a parsimony framework (Catalano et al 2010;Goloboff and Catalano 2011;Catalano and Goloboff 2012), and we see this as a promising new avenue of research. However, as with any phylogenetic analysis, taxon construction remains a fundamental issue.…”
Section: Geometric Morphometricsmentioning
confidence: 97%
“…Count us as fans of the new landmark optimization methods recently developed by Catalano et al. (2010) and Goloboff and Catalano (2010). These build on the retooling of TNT to handle continuous data (Goloboff et al., 2006, 2008), which we enthusiastically employed to give us phylogenetic hypotheses for species currently beyond the reach of molecular systematics and lacking many codable characters (Clouse et al., 2009; de Bivort et al., 2010).…”
mentioning
confidence: 99%