1992
DOI: 10.1016/1055-7903(92)90021-8
|View full text |Cite
|
Sign up to set email alerts
|

Split decomposition: A new and useful approach to phylogenetic analysis of distance data

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
301
0

Year Published

1997
1997
2017
2017

Publication Types

Select...
4
4
1

Relationship

0
9

Authors

Journals

citations
Cited by 463 publications
(302 citation statements)
references
References 12 publications
1
301
0
Order By: Relevance
“…Nucleotide transformations were weighted equally, single base-pair gaps were treated as additional character states; gaps of two or more base pairs were treated as missing data. Split decomposition (Bandelt & Dress 1992) was performed with SplitsTree 1.0 using a Jukes-Cantor translated distance matrix of all paired ITS sequences as input file.…”
Section: Fig 1 Phylogenetic Relationships Of Annualmentioning
confidence: 99%
“…Nucleotide transformations were weighted equally, single base-pair gaps were treated as additional character states; gaps of two or more base pairs were treated as missing data. Split decomposition (Bandelt & Dress 1992) was performed with SplitsTree 1.0 using a Jukes-Cantor translated distance matrix of all paired ITS sequences as input file.…”
Section: Fig 1 Phylogenetic Relationships Of Annualmentioning
confidence: 99%
“…Basic models of recombination were suggested by Hein (1990Hein ( , 1993. General frameworks are discussed in Bandelt and Dress (1992), Baroni et al (2004), Moret et al (2004), and Nakhleh et al (2005).…”
Section: Introductionmentioning
confidence: 99%
“…Theorem 2 (see [1]). The dissimilarity matrix δ realizes a weighted circular split system if and only if it satisfies the following Kalmanson condition with respect to some circular ordering π: For every i < j < k < l in the circular ordering π, both of the following inequalities hold:…”
Section: 2mentioning
confidence: 99%
“…1 In general, moving around in this space varies the edge lengths of the underlying tree; when an edge length reaches 0, a degeneration occurs which can be resolved in one of several ways, each of which leads to a new tree.…”
Section: Definitionmentioning
confidence: 99%