Concatenation methods concatenate a set of multiple alignments and construct a tree from the concatenated alignment, treating the estimated "super-gene" tree as a species tree estimate [ 6, 13, 16].
We utilized a second phylogenetic approach, gene alignment concatenation, to construct a species tree.
Any multiword term can be constructed by a concatenation of overlapping doublets.
Finally, we comment on the example in Section 3 that shows how different alignments may lead to the same neighbor-joining tree, whereas the neighbor-joining tree constructed from a concatenation of the alignments is different.
A supermatrix constructed from a concatenation of the aligned amino acid sequences of all inferred gene families with four or more members and analyzed using maximum likelihood (ML) and maximum parsimony (MP) clustering algorithms produced congruent trees broadly in agreement with Clades I III described earlier.
A phylogeny including the bat species from which complete PV genome sequences have been retrieved was constructed using a concatenation of partial sequences from three mitochondrial markers, namely Cytochrome Oxidase I (COI, 592 bp), Cytochrome b (Cytb, 754 bp), and NADH dehydrogenase (ND1, 518 bp), and the nuclear gene recombination activating gene (RAG2, 759 bp).
The gene sequences were concatenated and the concatenation was used to construct a phylogenetic tree similar to that performed by Wirth et al. in 2007 [ 9].
Summarizing the 2,007 gene trees into an extended Majority Rule Consensus (eMRC) phylogeny or using them as input to construct a coalescent-based species phylogeny resulted in topologies that were identical to the concatenation phylogeny (fig. 1).
Goodman and Quine construct a theory of syntax for the set-theoretic language and a proof theory based on the Calculus of Individuals (see section 3.2 below) supplemented with a token-concatenation theory.
Given a set S of strings generated from an arbitrary alphabet via concatenation and a meaning function m which assigns the members of an arbitrary set M to the members of S, we can construct a new meaning function μ such that for all s, t ∈ S μ(s.t) = μ(s)(μ(t)) and μ(s)(s) = m(s).
Construct a basic pocket.
