2007
DOI: 10.1080/10635150701499571
|View full text |Cite
|
Sign up to set email alerts
|

Spectral Partitioning of Phylogenetic Data Sets Based on Compatibility

Abstract: We describe two new methods to partition phylogenetic data sets of discrete characters based on pairwise compatibility. The partitioning methods make no assumptions regarding the phylogeny, model of evolution, or characteristics of the data. The methods first build a compatibility graph, in which each node represents a character in the data set. Edges in the compatibility graph may represent strict compatibility of characters or they may be weighted based on a fractional compatibility scoring procedure that me… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
9
0

Year Published

2008
2008
2022
2022

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 11 publications
(9 citation statements)
references
References 57 publications
0
9
0
Order By: Relevance
“…Spectral partitioning subdivides characters in an alignment into a prespecified number of clusters based on character compatibility [46]. Characters in the same cluster are more phylogenetically compatible with each other than they are to characters in different clusters.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…Spectral partitioning subdivides characters in an alignment into a prespecified number of clusters based on character compatibility [46]. Characters in the same cluster are more phylogenetically compatible with each other than they are to characters in different clusters.…”
Section: Resultsmentioning
confidence: 99%
“…Spectral partitioning is a technique that partitions alignments based on character compatibility. More specifically, it clusters the characters with the highest average pairwise compatibility, so that characters in each cluster are more compatible with each other than they are with characters in the other clusters [46]. If the relative contribution of spectral partitions differs strongly between gene types, genomes or loci, this can be taken as evidence for conflict between them.…”
Section: Methodsmentioning
confidence: 99%
“…In various configurations, graph theory has been successful in understanding the organizing principles behind biological phenomena at every scale, including the regulation of gene-expression (22), protein-protein interactions (23), metabolic networks (24) and ecological food webs (25). Graph theory and associated spectral analyses have also been useful in phylogenetics, particularly in developing approaches for tree inference (26) or for comparing the phylogenetic composition of microbial samples (27). Metrics like the Robinson-Foulds distance (28) and nearest neighbour interchange (29), too, for example, are used to compare different trees representing the same set of organisms, by counting the number of steps needed to transform one into the other (or both into a third); while others take a geometric approach to define polytopic contours around a reconstructed tree in order to define 'confidence regions' in the tree (30).…”
mentioning
confidence: 99%
“…Additionally, FUGA implements a greedy algorithm for community detection that uses network modularity as a measure of community structure [18], as well as several functions for spectral graph partitioning [19]. Such unsupervised algorithms are well adapted to large biological networks and may uncover previously undetected interactions.…”
Section: Resultsmentioning
confidence: 99%